Skip to content

Tag Archives: GATE CS 1999

Which of the following disk strategies is likely to give the best throughput? (A) Farthest cylinder next (B) Nearest cylinder next (C) First come first… Read More
Listed below are some operating system abstractions (in the left column) and the hardware components or mechanism (in the right column) that they are abstractions… Read More
Which of the following function implements the Karnaugh map shown below? (A) a (B) b (C) c (D) d Answer: (B) Explanation: Quiz of this… Read More
Which of the following expressions is not equivalent to X‾  ? (A) x NAND x (B) x NOR x (C) x NAND 1 (D) x… Read More
Let LD  be the set of all languages accepted by a PDA by final state and LF  the set of all languages accepted by empty… Read More
Context free languages are closed under- (A) Union, Intersection (B) Union, Kleene closure (C) Intersection, Complement (D) Complement, Kleene closure Answer: (B) Explanation: Context free… Read More
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: (A) n states… Read More
The number of binary strings of n zeros and k ones such that no two ones are adjacent is: (A) a (B) b (C) c… Read More
Suppose that the expectation of a random variable X is 5. Which of the following statement is True?   (A) There is a simple point… Read More
The number of binary relations on a set with n elements is: (A) n² (B) 2^n (C) 2^n² (D) None of the above Answer: (C)… Read More

Start Your Coding Journey Now!