GATE CS 2015 Set 1 — Question 6
The larger of the two eigenvalues of the matrix \(\begin{bmatrix} 4 & 5 \\ 2 & 1 \end{bmatrix}\) is ______.
Year-wise GATE papers
GATE 2015
25 questions and papers
GATE CS 2015 Set 2 — Question 17
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is TRUE?
GATE CS 2015 Set 2 — Question 25
Let \(R\) be the relation on the set of positive integers such that \(aRb\) if and only if \(a\) and \(b\) are distinct and have a common divisor…
GATE CS 2015 Set 3 — Question 22
The cardinality of the power set of \(\{0, 1, 2, \ldots, 10\}\) is ______.
GATE CS 2015 — Question 31
The total number of prime implicants of the function \(f(w,x,y,z) = \sum m(0,\,2,\,4,\,5,\,6,\,10)\) is _______ .
GATE CS 2015 — Question 9
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is:
GATE CS 2015 Set 3 — Question 54
Consider a simple checkpointing protocol and the following set of operations in the log:(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5,…
GATE CS 2015 Set 2 — Question 34
Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and the block pointer…
GATE CS 2015 Set 2 — Question 42
Consider two relations \(R_1(A, B)\) with the tuples \((1, 5), (3, 7)\) and \(R_2(A, C) = (1, 7), (4, 9)\). Assume that \(R(A, B, C)\) is the full natural outer join of \(R_1\) and \(R_2\). Consider the following tuples of…
GATE CS 2015 Set 3 — Question 40
Consider a processor with byte-addressable memory. Assume that all registers, including Program Counter (PC) and Program Status Word (PSW), are of size 2 bytes. A stack in the…
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.