Year-wise GATE papers

GATE 2012

7 questions and papers

GATE CS 2012 — Question 27

Multiple choice 2 marks Theory of Computation GATE CS — Computer Science & IT

Which of the following problems are decidable?Does a given program ever produce an output?If \(L\) is a context-free language, then is \(\bar{L}\) also context-free?If \(L\) is a regular language, then is \(\bar{L}\) also regular?If \(L\) is a recursive…

GATE CS 2012 — Question 2

Multiple choice 1 mark Probability and Statistics GATE CS — Computer Science & IT

Consider a random variable \(X\) that takes values \(+1\) and \(-1\) with probability \(0.5\) each. The values of the cumulative distribution function \(F(x)\) at \(x=-1\) and \(x=+1\) are

GATE CS 2012 — Question 43

Multiple choice 2 marks Databases GATE CS — Computer Science & IT

Suppose \(R_1(A, B)\) and \(R_2(C, D)\) are two relation schemas. Let \(r_1\) and \(r_2\) be the corresponding relation instances. \(B\) is a foreign key that refers to \(C\) in \(R_2\).…

GATE CS 2012 — Question 52

Multiple choice 2 marks Computer Networks GATE CS — Computer Science & IT

Consider a source computer \(S\) transmitting a file of size \(10^{6}\) bits to a destination computer \(D\) over a network of two routers \(R_1\) and \(R_2\) and three…

GATE CS 2012 – Question 16

Multiple choice 1 mark Algorithms GATE CS — Computer Science & IT

Let \(W(n)\) and \(A(n)\) denote respectively the worst-case and average-case running time of an algorithm executed on an input of size \(n\). Which of the following is ALWAYS…