# Tag Archives: GATE-GATE-CS-2005

Consider the grammar S → (S) | a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2… Read More
Consider the grammar E → E + n | E × n | n For a sentence n + n × n, the handles in… Read More
Consider the following two problems on undirected graphs α : Given G(V, E), does G have an independent set of size | V | -… Read More
Consider the languages: L1 = {wwR |w ∈ {0, 1}*} L2 = {w#wR | w ∈ {0, 1}*}, where # is a special symbol L3… Read More
Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?… Read More
Consider the languages: L1 = {anbncm | n, m > 0} L2 = {anbmcm | n, m > 0} Which one of the following statements… Read More
Let Nf and Np denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let Df and Dp denote the… Read More
Consider the machine M: The language recognized by M is : (A) {w ∈ {a, b}* / every a in w is followed by ex­actly… Read More
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending… Read More
Box P has 2 red balls and 3 blue balls and box Q has 3 red balls and 1 blue ball. A ball is selected… Read More
Let G(x) = 1/(1 – x)2 = , where | x | < 1. What is g(i) ? (A) i (B) i+1 (C) 2i (D)… Read More
What are the eigenvalues of the following 2 × 2 matrix? (A) -1 and 1 (B) 1 and 6 (C) 2 and 5 (D) 4… Read More
Consider the following system of equations in three real variables xl, x2 and x3 2×1 – x2 + 3×3 = 1 3×1- 2×2 + 5×3… Read More
Which one of the following graphs is NOT planar? (A) G1 (B) G2 (C) G3 (D) G4 Answer: (A) Explanation: A graph is planar if… Read More
Consider the set H of all 3 × 3 matrices of the type where a, b, c, d, e and f are real numbers and… Read More