Year-wise GATE papers

GATE 2015

25 questions and papers

GATE CS 2015 Set 1 — Question 23

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

Let \(L\) be the language represented by the regular expression \(\Sigma^*0011\Sigma^*\), where \(\Sigma = \{0,1\}\). What is the minimum number of states in a DFA that recognizes \(\bar{L}\) (complement of \(L\))?

GATE CS 2015 Set 1 — Question 47

Numerical answer 2 marks Probability and Statistics GATE CS — Computer Science & IT

Suppose \(X_i\) for \(i=1,2,3\) are independent and identically distributed random variables whose probability mass functions are \(\Pr[X_i=0]=\Pr[X_i=1]=1/2\) for \(i=1,2,3\). Define another random variable \(Y=X_1X_2\oplus X_3\), where \(\oplus\) denotes XOR. Then…

GATE CS 2015 Set 1 — General Aptitude Q9

Multiple choice 2 marks General Aptitude GATE CS — Computer Science & IT

In a triangle \(PQR\), \(PS\) is the angle bisector of \(\angle QPR\) and \(\angle QPS = 60^\circ\), where \(S\) lies on \(QR\). If \(PQ = r\) and \(PR = q\), what is the length of \(PS\)?