GAte theory of computation question

Set-15 TOC GATE 2006

TOC |Gate-2007| Previous Year Questions| Set-14

TOC |Gate-2007| Theory of Computation ( Automata) Which of the following problems is undecidable?  [GATE – 2007] a. Membership problem for CFGs.b. Ambiguity problem for CFGs.c. Finiteness problem for FSAs.d. Equivalence problem for FSAs. Answer : b) Which of the following is TRUE?  [GATE – 2007] a. Every subset of a regular set is regular.b. …

TOC |Gate-2007| Previous Year Questions| Set-14 Read More »

Set-15 TOC GATE 2006

TOC |Gate-2008| Previous Year Questions| Set-13

TOC |Gate-2008| Theory of Computation ( Automata) Which of the following is true for the language {ap|p is a prime} ?  [GATE – 2008] a. It is not accepted by a Turing Machineb. It is regular but not context-freec. It is context-free but not regulard. It is neither regular nor context-free, but accepted by a Turing machine Answer …

TOC |Gate-2008| Previous Year Questions| Set-13 Read More »

Set-15 GATE-2006 Engineering-Mathematics

Engineering-Mathematics |Gate-2006| Previous Year Questions| Set-15

Engineering-Mathematics |Gate-2006| The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G is: [GATE – 2006] a. nb. n+2c. 2n/2d. …

Engineering-Mathematics |Gate-2006| Previous Year Questions| Set-15 Read More »

Set-15 GATE-2006 Engineering-Mathematics

Engineering-Mathematics |Gate-2007| Previous Year Questions| Set-14

Engineering-Mathematics |Gate-2007| 1. Consider the following two statements about the function f(x)=|x| P. f(x) is continuous for all real values of xQ. f(x) is differentiable for all real values of x Which of the following is TRUE? [GATE – 2007] a. P is true and Q is falseb. P is false and Q is true.c. …

Engineering-Mathematics |Gate-2007| Previous Year Questions| Set-14 Read More »

Set-15 GATE-2006 Engineering-Mathematics

Engineering-Mathematics |Gate-2008| Previous Year Questions| Set-13

Engineering-Mathematics |Gate-2008| If P, Q, R are subsets of the universal set U, then (P∩Q∩R) ∪ (Pc∩Q∩R) ∪ Qc ∪ Rc is : [GATE – 2008] a. Qc ∪ Rcb. P ∪ Qc ∪ Rcc. Pc ∪ Qc ∪ Rcd. U Answer : d) The following system of equations x1 + x2  + 2×3  = 1 x1 + 2×2 + 3 x3 = 2 …

Engineering-Mathematics |Gate-2008| Previous Year Questions| Set-13 Read More »

Set-15 GATE-2006 Engineering-Mathematics

Engineering-Mathematics |Gate-2009| Previous Year Questions| Set-12

Engineering-Mathematics |Gate-2009| Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? [GATE – 2009] a. No two vertices have the same degree.b. At least two vertices have the same degree.c. At least three vertices have the same degree.d. All vertices have the same degree. Answer : …

Engineering-Mathematics |Gate-2009| Previous Year Questions| Set-12 Read More »