GATE 1999 Computer Science questions and solutions

Recent questions tagged gate1999

26 votes
2 answers
61
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
25 votes
2 answers
62
29 votes
6 answers
63
Which of the following disk scheduling strategies is likely to give the best throughput?Farthest cylinder nextNearest cylinder nextFirst come first servedElevator algorit...
18 votes
2 answers
64
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)}& ...
24 votes
2 answers
65
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)$
19 votes
5 answers
66
Which of the following expressions is not equivalent to $\bar{x}$?$x \text{ NAND } x$$x \text{ NOR } x$$x \text{ NAND } 1$$x \text{ NOR } 1$
20 votes
3 answers
67
Context-free languages are closed under:Union, intersectionUnion, Kleene closureIntersection, complementComplement, Kleene closure
30 votes
5 answers
69
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
23 votes
2 answers
70
35 votes
4 answers
72
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with ...
57 votes
1 answer
73