GATE CS 2016 Set 2 — Question 8
Let \(X\) be the number of distinct 16-bit integers in 2's complement representation. Let \(Y\) be the number of distinct 16-bit integers in sign magnitude representation. Then \(X - Y\)…
GATE exam stream
GATE CS — Computer Science & IT
174 questions and papers
GATE CS 2016 Set 1 — Question 41
Consider an eight-bit ripple-carry adder for computing the sum of \(A\) and \(B\), where \(A\) and \(B\) are integers represented in 2's complement form. If the decimal value…
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 2014 — Question 16
Consider the equation \((123)_5 = (x8)_y\) with \(x\) and \(y\) as unknown. The number of possible solutions is _______ .
GATE CS 2011 — Question 9
The simplified sum-of-products (SOP) form of the Boolean expression\((P + \overline{Q} + \overline{R}) \cdot (P + \overline{Q} + R) \cdot (P + Q + \overline{R})\)is:
GATE CS 2004 — Question 8
Let \(A = 1111\,1010\) and \(B = 0000\,1010\) be two 8-bit 2's complement numbers. Their product in 2's complement representation is:
GATE CS 2010 — Question 6
The minterm expansion of \(f(P,Q,R) = PQ + Q\overline{R} + P\overline{R}\) 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 2019 — Question 35
Consider the following two statements about database transaction schedules:I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.II. Timestamp-ordering concurrency control protocol with Thomas' Write…
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.