A____is a pictorial depiction of the schema of a database that shows the relations in the databases, their attributes, and primary keys and foreign keys.

Consider the following table of arrival time and burst time for three processes P0,P1,P2

The preemptive shortest job first scheduling algorithm is used scheduling is carried out only at arrival or completion of process. The average waiting time for three process is____.

According to boolean law: (A')' = ?

int function (int x, int y)
{
 if(y<=0) return x;
 return function (y, x%y);
} 

The above recursive function computes ______

The working set model is used in memory management to implement the concept of:

Depth first search graph search algorithm uses ____ data structure for its implementation.

In RSA
1. P and Q are chosen as very large prime number
2. Compute n = p*q and Φ(n) = (n-1)*(q-1)
Letter e encryption key chosen. How is this encryption key selected?

Consider the following problem X
"Given a Turing Machine M over the input alphabet Σ any state q of M and word Σ*, does the computation of M on w visit the state q"

The expression for commutative law is given by:

Consider the following grammar

 S → m | mn | mno 

Consider the classful addressing, the IP address 128.252.144.84 denotes:

Consider the following statement.
I. Packet filter firewall analyzes network traffic at transport layer.
II. Circuit level firewall operate transport and session layer of OSI model.
From the above statement which statement/s is/are TRUE?

___ is not a public key cryptosystem

Consider the FA shown in fig below which language is accepted by the FA:

Generation of intermediate code based on an abstract machine model is useful in compilers because:

The maximum height of a binary tree with 'n' nodes is ____

In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique-
I. Bucket (for contiguous storage)
II. Chains (for linked storage)

The main memory of a computer has 2cm blocks while the cache has 2c blocks. If cache uses set associative mapping scheme with two blocks per set, then the block k of the main memory maps to set:

Consider the following two statements.
1. A binary tree T is full if each node is either a leaf or possesses exactly two child nodes.
2. A binary tree with n levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to the left side.
Which statement is/are TRUE?

Consider the Unix i-node which uses 12 direct DBAs, 1 single indirect, 1 double indirect, 1 triple indirect. The disk block address requires 32 bits and disk block size is 1 KB. What is the maximum file size?

A trigger has three parts.
The ____ describes the change that activates the trigger.
The _____ is a query that is run whenever the trigger is activated.
The ___ is the procedure that is executable if the trigger is activated and the condition is true.

Which layer is associated with log in and log out from the network?

Digital certificates are described using ____ format.

___ command is used to enable, disable, modify or drop a constraint in SQL

Which is equivalent CFG without useless symbols for the given grammar:

S → PQ | p, P → p 

Which of the following derivations does a top-down parser use while parsing a input string?
The input is assumed to be scanned in left to right order.

Polynomial addition is implemented using ___ data structure.

A ____ of a relation is a set of one or more attributes whose values are guaranteed to identify tuples in the relation uniquely.

For implementation of recursion system uses ____ data structure.

Which of the following statement is true?

Page fault occurs when

Queue structure is used in ____

In RSA algorithm if p=7, q=11 and e=13 then what will be the value of d?

Consider the following statements:
Arithmetic Logic Unit(ALU)
1. Performs arithmetic operations
2. performs comparisons
3. Communicates with I/O devices
4. Keeps watch on the system
Which of these statements are correct?

The term cycle stealing is used in context of:

For following logic diagram which expression is true?

Excess-3 code of decimal number 2 is:

Consider a system with page fault service time(S)=100 ns, main memory access time(M)=20 ns, and page fault rate(P)=65%. Calculate the effective memory access time.

Solve the following recurrence relation:
T(n) = 4T(n/2) + n²

In ____balance factor of a node is the difference between left subtree and right subtree.

The language generated by following grammar is:
S --> aSa | bSb | ε

The language {a^m bⁿ c^m+n | m, n>=1} is:

Which of the following affects the processing power of CPU
1. Data bus width
II. Clock speed
III. Address bus width

In D flip flop the out-put state Q is related with D input in what way?

____includes a query language and commands to insert tuples into, delete tuples from, and modify tuples in the database.

Which grammar rules violate the requirement of the operator grammar? A,B,C are variables and a,b,c are terminals.

I. A → BC
II. A → CcBb
III. A → BaC
IV. A → ε 

Principle of locality is used in ___

In____authentication, the claimant proves that she knows the secret without sending it to the verifier.

The following is the sequence of insertion in a binary search tree.

45, 65, 35, 40, 33, 70, 60, 75, 69 

Find the output of the following

#include
int main()
{
 int x=5, y=9;
 x=(x=x+y)-(y=x-y);
 printf("%d%d", x,y);
 return 0;
} 

Solve the following recurrence relation

A ___ is the combination of one or more column values in a table that make a row of data unique within the table

Write true (T) / false (F) for each of the following statements:
A. Symbol table is used only in the first phase of a compiler.
B. A pretty printer analyses a program and prints it in such a way that the structure of the program becomes early visible.
C. YACC build up LALR parsing table
D. If a grammar is LALR(1), it is not necessarily SLR(1)

The following grammar is:

S →  Aa | bAc | Bc | bBa
A →  d
B →  d 

Let L be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite state automaton accepting languages is ____

____ is First in last out kind of data structure.

What is meant by stable sorting algorithm?

Consider the following Inorder and Preorder traversal of a tree

Inorder- D B E F A G H C
Pre Order- A B D E F C G H 

In SQL-the function -avg,min,max,sum,count are called as ____

What is the output of the following C program

#include
int main()
{
int i=5;
printf("%d%d%d", i++, i ,++i);
return 0;
} 

What is the number of page faults by least recently used page replacement for a memory with 4 frames for the page reference string 2, 0, 1, 2, 4, 0, 5, 1, 4, 6, 4, 2, 1, 3, 0?

Relations and fields can be renamed in relational algebra using the renaming operator

Consider the binary search tree with n elements. The time required to search given element is ___

In database management system ACID property refers to:

Which of the following statements is true?

Mutual Exclusion problem occurs ______

The time complexity of searching an element in linked n will be:

Consider the disk which has average seek time of 32 ns and rotational rate of 360 rpm (round per minute), each track of the disk has 512 sectors, each of size 512 bytes.
What is the time taken to read four continuous sectors? And what is the data transfer rate?

MSB stands for

Which scheduling algorithm gives a minimum average waiting time?

Consider the following statements
1. Insertion sort and merge sort are stable
2. Heap sort is inherently unstable
3. Selection sort is not inherently stable, but may be coded in such a way that it is stable

Which of the following statement is false?

A tuple relational calculus query is expressed as ___

Consider the grammar

S --> AbBaCc |ε
A --> aAb | ba
B --> bBC | cb
C --> cCa | ac 

Calculate the link utilization (throughput) for stop and wait flow control mechanism if the frame size is 4800 bits, bit rate is 9600 bps, and distance between the devices is 2000 km.
Given propagation speed is 200000 km/s.

Which is the correct method to obtain 10's complement of a decimal number?

Maximum throughput of slotted ALOHA network is:

Which one of the following is TRUE?

A computer uses RAM chips of 1024x1 capacity.
How many chips are needed to provide memory capacity of 16K bytes?

Number of states in DFA accepting the following languages is:
L = {aⁿ b^2m | n, m>=1}

Which of the following has lowest access time?

Which of the following is equivalent to the boolean expression given below?

 A+A'.B+A.B' 

Which of the following is/are correct
I. A language is context free if and only if it accepted by PDA
II. PDA is a finite automata with push down stack

With respect to deque which of the following is true?

A negative edge triggered flip flop transfers data from input on the:

Consider the following relational schema

Sailors(sid, sname, rating, age)
Reserves(sid, bid, day)
Boats(bid, bname, color) 

What is the equivalent of following relational algebra query in SQL query

Πsname((σcolor='red'Boats)⨝ Reserves ⨝ Sailors) 

What is the complexity of merge sort?

___ of graph is a vertex whose removal disconnects graph

Canonical SOP form of logic expression consists of only ____

The following grammar is:

S →  Aa | b Ac | dc | bda
A →  a 

A relation is in ____ form if every field consists only of atomic values, that is, not lists or sets.

In hashing, collision results when ____

In SQL, the ___ command is used to recompile view

The multiplicand register and multiplier register of hardware circuit implementation of booth's algorithm have (11101) and (1100). the result shall be:

The ____ defines a set of operations on relations, paralleling the usual algebraic operations such as addition, subtraction or multiplication, which operates on numbers.

The class of context-free grammar is not closed under ____ operations

Which of the following is a unary operation?

Which of the following statement is false about Prim's algorithm?

Which of the following problems are undecidable?

I. Membership problem in context-free languages
II. Whether a given context-free languages is regular
III. Whether a finite state automation halts on all inputs
IV. Membership problem for type 0 languages

During DMA transfer, DMA controller transfers data ___