Question 1 |

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

There is a sample point at which X has the value 5. | |

There is a sample point at which X has value greater than 5. | |

There is a sample point at which X has a value greater than equal to 5. | |

None of the above |

Question 1 Explanation:

Question 2 |

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

n^2 | |

2^n | |

2^{n^2} | |

None of the above |

Question 2 Explanation:

Question 3 |

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

^{n-1}C_k | |

^nC_k | |

^nC_{k+1} | |

None of the above |

Question 3 Explanation:

Question 4 |

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

n states | |

n+1 states | |

n+2 states | |

None of the above |

Question 4 Explanation:

Question 5 |

Context-free languages are closed under:

Union, intersection | |

Union, Kleene closure | |

Intersection, complement | |

Complement, Kleene closure |

Question 5 Explanation:

Question 6 |

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?

L_1 = L_2 | |

L_1 \supset L_2 | |

L_1 \subset L_2 | |

None |

Question 6 Explanation:

Question 7 |

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

x NAND x | |

x NOR x | |

x NAND 1 | |

x NOR 1 |

Question 7 Explanation:

Question 8 |

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

\bar{A}B + CD | |

D(C+A) | |

AD+\bar{A}B | |

(C+D) (\bar{C}+D) + (A+B) |

Question 8 Explanation:

Question 9 |

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}

\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}

(A) - 2 (B) - 4 (C) - 3 (D) - 1 | |

(A) - 1 (B) - 2 (C) - 3 (D) - 4 | |

(A) - 3 (B) - 2 (C) - 4 (D) - 1 | |

(A) - 4 (B) - 1 (C) - 2 (D) - 3 |

Question 9 Explanation:

Question 10 |

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

Farthest cylinder next | |

Nearest cylinder next | |

First come first served | |

Elevator algorithm |

Question 10 Explanation:

There are 10 questions to complete.