GATE IT 2008


Q31.

The total number of keys required for a set of n individuals to be able to communicate with each other using secret key and public key cryptosystems, respectively are:
GateOverflow

Q32.

Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional dependencies are known to hold: AB \to CD, DE \to P, C \to E, P \to C and B \to G. The relational schema R is
GateOverflow

Q33.

Let R (A, B, C, D) be a relational schema in which the following functional dependencies are known to hold: A \to B, \; B \to C, \; C \to D and D \to B. The decomposition of R into (A,B), (B,C), (B,D)
GateOverflow

Q34.

Assume that EA = (X)+ is the effective address equal to the contents of location X, with X incremented by one word length after the effective address is calculated; EA = -(X) is the effective address equal to the contents of location X, with X decremented by one word length before the effective address is calculated; EA = (X)- is the effective address equal to the contents of location X, with X decremented by one word length after the effective address is calculated. The format of the instruction is (opcode, source, destination), which means (destination \longleftarrow source op destination). Using X as a stack pointer, which of the following instructions can pop the top two elements from the stack, perform the addition operation and push the result back to the stack.
GateOverflow

Q35.

How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame?
GateOverflow

Q36.

A processor that has the carry, overflow and sign flag bits as part of its program status word (PSW) performs addition of the following two 2's complement numbers 01001101 and 11101001. After the execution of this addition operation, the status of the carry, overflow and sign flags, respectively will be:
GateOverflow

Q37.

A non pipelined single cycle processor operating at 100 MHz is converted into a synchronous pipelined processor with five stages requiring 2.5 nsec, 1.5 nsec, 2 nsec, 1.5 nsec and 2.5 nsec, respectively. The delay of the latches is 0.5 nsec. The speedup of the pipeline processor for a large number of instructions is:
GateOverflow

Q38.

Consider the function f(x) = x^{2} - 2x - 1. Suppose an execution of the Newton-Raphson method to find a zero of f(x) starts with an approximation x_{0} = 2 of x. What is the value of x_{2}, the approximation of x that algorithm produces after two iterations, rounded to three decimal places?
GateOverflow

Q39.

A sample space has two events A and B such that probabilities P(A\cap B) = \dfrac{1}{2}, P(A') = \dfrac{1}{3}, P(B') =\dfrac{1}{3}. What is P(A\cup B) ?
GateOverflow

Q40.

What is the probability that in a randomly chosen group of r people at least three people have the same birthday?
GateOverflow