GATE CS 2014 Set 3 — Question 51
Which one of the following propositional logic formulas is TRUE when exactly two of \(p\), \(q\) and \(r\) are TRUE?
Year-wise GATE papers
GATE 2014
19 questions and papers
GATE CS 2014 Set 1 — Question 20
The maximum number of edges in a bipartite graph on 12 vertices is ______.
GATE CS 2014 Set 3 — Question 13
If \(G\) is a forest with \(n\) vertices and \(k\) connected components, how many edges does \(G\) have?
GATE CS 2014 — Question 16
Consider the equation \((123)_5 = (x8)_y\) with \(x\) and \(y\) as unknown. The number of possible solutions is _______ .
GATE CS 2014 Set 2 — Question 30
Consider the following relational schema:employee(empId, empName, empDept) customer(custId, custName, salesRepId, rating)salesRepId is a foreign key referring to empId of the employee relation. Assume that each employee makes a…
GATE CS 2014 Set 2 — Question 43
Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage…
GATE CS 2014 Set 1 — Question 47
Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of…
GATE CS 2014 Set 1 — Question 17
Which one of the following is FALSE?
GATE CS 2014 Set 2 – Question 38
Suppose \(P\), \(Q\), \(R\), \(S\), \(T\) are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging…
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.