Skip to content

Tag Archives: GATE-CS-2009

Which one of the following is FALSE? (A) There is unique minimal DFA for every regular language (B) Every NFA can be converted to an… Read More
Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)* ? (A) The set of all strings containing… Read More
Let pA be a problem that belongs to the class NP. Then which one of the following is TRUE? (A) There is no polynomial time… Read More
Which of the following statement(s)is / are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exist s. Q:… Read More
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of (A) All palindromes (B) All odd length… Read More
What is the number of swaps required to sort n elements using selection sort, in the worst case? (A) (n) (B) (n log n) (C) (n^2 ) (D) (n^2… Read More
The essential content(s) in each entry of a page table is / are (A) Virtual page number (B) Page frame number (C) Both virtual page… Read More
In which one of the following page replacement policies, Belady’s anomaly may occur? (A) FIFO (B) Optimal (C) LRU (D) MRU Answer: (A) Explanation: Belady’s… Read More
A CPU generally handles an interrupt by executing an interrupt service routine (A) As soon as an interrupt is raised (B) By checking the interrupt… Read More
What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates? (A) 2 (B)… Read More
(1217)8 is equivalent to (A) (1217)16 (B) (028F)16 (C) (2297)10 (D) (0B17)16 Answer: (B) Explanation: (1217)8 = (001 010 001 111)8 = (0010 1000 1111) = (28F)16Quiz… Read More
Consider the binary relation R = {(x, y), (x, z), (z, x), (z, y)} on the set {x, y, z}. Which one of the following… Read More
Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? (A) No two vertices have the same… Read More
What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2.  (A) n-1 … Read More
Which one of the following in NOT necessarily a property of a Group? (A) Commutativity (B) Associativity (C) Existence of inverse for every element (D)… Read More