Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
GATE 1999 Computer Science questions and solutions
Recent questions tagged gate1999
26
votes
2
answers
61
GATE CSE 1999 | Question: 1.12
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
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...
Kathleen
9.2k
views
Kathleen
asked
Sep 23, 2014
Algorithms
gate1999
algorithms
sorting
easy
+
–
25
votes
2
answers
62
GATE CSE 1999 | Question: 1.11, UGCNET-Dec2015-II: 44
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
Kathleen
11.9k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
normal
ugcnetcse-dec2015-paper2
os-protection
+
–
29
votes
6
answers
63
GATE CSE 1999 | Question: 1.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
Which of the following disk scheduling strategies is likely to give the best throughput?Farthest cylinder nextNearest cylinder nextFirst come first servedElevator algorit...
Kathleen
11.1k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
disk-scheduling
normal
+
–
18
votes
2
answers
64
GATE CSE 1999 | Question: 1.9
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column) ... 4 (A) - 3 (B) - 2 (C) - 4 (D) - 1 (A) - 4 (B) - 1 (C) - 2 (D) - 3
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)}& ...
Kathleen
6.9k
views
Kathleen
asked
Sep 23, 2014
Operating System
gate1999
operating-system
easy
interrupts
virtual-memory
disk
+
–
24
votes
2
answers
65
GATE CSE 1999 | Question: 1.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)$
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)$
Kathleen
5.7k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
k-map
easy
+
–
19
votes
5
answers
66
GATE CSE 1999 | Question: 1.7
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$
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$
Kathleen
8.5k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
easy
boolean-algebra
+
–
20
votes
3
answers
67
GATE CSE 1999 | Question: 1.5
Context-free languages are closed under: Union, intersection Union, Kleene closure Intersection, complement Complement, Kleene closure
Context-free languages are closed under:Union, intersectionUnion, Kleene closureIntersection, complementComplement, Kleene closure
Kathleen
7.4k
views
Kathleen
asked
Sep 23, 2014
Theory of Computation
gate1999
theory-of-computation
context-free-language
easy
+
–
46
votes
2
answers
68
GATE CSE 1999 | Question: 1.4
Consider the regular expression $(0 + 1) (0+1) \dots 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
Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression cont...
Kathleen
25.0k
views
Kathleen
asked
Sep 23, 2014
Theory of Computation
gate1999
theory-of-computation
finite-automata
easy
minimal-state-automata
+
–
30
votes
5
answers
69
GATE CSE 1999 | Question: 1.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
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
Kathleen
8.9k
views
Kathleen
asked
Sep 23, 2014
Combinatory
gate1999
combinatory
normal
+
–
23
votes
2
answers
70
GATE CSE 1999 | Question: 1.2
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above
The number of binary relations on a set with $n$ elements is:$n^2$$2^n$$2^{n^2}$None of the above
Kathleen
11.2k
views
Kathleen
asked
Sep 23, 2014
Set Theory & Algebra
gate1999
set-theory&algebra
relations
combinatory
easy
+
–
37
votes
4
answers
71
GATE CSE 1999 | Question: 1.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.
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 ...
Kathleen
10.0k
views
Kathleen
asked
Sep 23, 2014
Probability
gate1999
probability
expectation
easy
+
–
35
votes
4
answers
72
GATE CSE 1999 | Question: 2.20
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 $25$ records) is: $165$ $90$ $75$ $65$
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 ...
Keith Kr
14.4k
views
Keith Kr
asked
Sep 12, 2014
Algorithms
gate1999
algorithms
normal
greedy-algorithm
+
–
57
votes
1
answer
73
GATE CSE 1999 | Question: 1.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
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...
Keith Kr
21.9k
views
Keith Kr
asked
Sep 10, 2014
Theory of Computation
normal
theory-of-computation
gate1999
pushdown-automata
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register