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