GATE CSE 1999

Suppose that the expectation of a random variable X is 5. Which of the following statements is true?

The number of binary relations on a set with n elements is:

The number of binary strings of n zeros and k ones in which no two ones are adjacent is

Consider the regular expression (0 + 1) (0+1) ... n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains

Context-free languages are closed under:

Let L_1 be the set of all languages accepted by a PDA by final state and L_2 the set of all languages accepted by empty stack. Which of the following is true?

Which of the following expressions is not equivalent to \bar{x}?

Which of the following functions implements the Karnaugh map shown below?

Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column)
\small \begin{array}{cl|cl}\hline \text{(A)}& \text{Thread} & \text{1.}& \text{Interrupt} \\\hline \text{(B)}& \text{Virtual address space} & \text{2.}& \text{Memory} \\\hline \text{(C)} &\text{File system} & \text{3.} &\text{CPU} \\\hline \text{(D)} &\text{Signal} & \text{4.}& \text{Disk} \\\hline \end{array}

Which of the following disk scheduling strategies is likely to give the best throughput?