GATE CS — Computer Science & IT Subject test

Digital Logic — GATE Previous Year Questions

  • 12Questions
  • 18Total marks
  • 36Minutes

Every verified previous-year GATE question in the Digital Logic section of the W3Colleges bank, in chronological order. Practise them untimed with worked explanations, or take the set as a timed test.

Start timed test Practice without timer

The timed run lasts 36 minutes and is held on the server.

Questions

Digital Logic

Question 1

MCQ 2 marks · −0.66 Digital Logic

Let \(A = 1111\,1010\) and \(B = 0000\,1010\) be two 8-bit 2's complement numbers. Their product in 2's complement representation is:

Answers and explanations are free — they just need an account.

Question 2

MCQ 2 marks · −0.66 Digital Logic

The minterm expansion of \(f(P,Q,R) = PQ + Q\overline{R} + P\overline{R}\) is:

Answers and explanations are free — they just need an account.

Question 3

MCQ 1 marks · −0.33 Digital Logic

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:

Answers and explanations are free — they just need an account.

Question 4

NAT 2 marks · no negative Digital Logic

Consider the equation \((123)_5 = (x8)_y\) with \(x\) and \(y\) as unknown. The number of possible solutions is _______ .

Answers and explanations are free — they just need an account.

Question 5

MCQ 1 marks · −0.33 Digital Logic

Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is:

Answers and explanations are free — they just need an account.

Question 6

NAT 2 marks · no negative Digital Logic

The total number of prime implicants of the function \(f(w,x,y,z) = \sum m(0,\,2,\,4,\,5,\,6,\,10)\) is _______ .

Answers and explanations are free — they just need an account.

Question 7

NAT 1 marks · no negative Digital Logic

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\) is _______ .

Answers and explanations are free — they just need an account.

Question 8

NAT 2 marks · no negative Digital Logic

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 of \(A\) is one, the decimal value of \(B\) that leads to the longest latency for the sum to stabilize is _______ .

Answers and explanations are free — they just need an account.

Question 9

MCQ 1 marks · −0.33 Digital Logic

Consider the Boolean operator \(\#\) with the following properties:

\(x \# 0 = x\),   \(x \# 1 = \overline{x}\),   \(x \# x = 0\)   and   \(x \# \overline{x} = 1\).

Then \(x \# y\) is equivalent to:

Answers and explanations are free — they just need an account.

Question 10

NAT 2 marks · no negative Digital Logic

Consider the minterm list form of a Boolean function \(F\) given below.

\(F(P,Q,R,S) = \sum m(0,\,2,\,5,\,7,\,9,\,11) + d(3,\,8,\,10,\,12,\,14)\)

Here, \(m\) denotes a minterm and \(d\) denotes a don't care term. The number of essential prime implicants of the function \(F\) is _______ .

Answers and explanations are free — they just need an account.

Question 11

MCQ 1 marks · −0.33 Digital Logic

Consider \(Z = X - Y\), where \(X\), \(Y\) and \(Z\) are all in sign-magnitude form. \(X\) and \(Y\) are each represented in \(n\) bits. To avoid overflow, the representation of \(Z\) would require a minimum of:

Answers and explanations are free — they just need an account.

Question 12

NAT 1 marks · no negative Digital Logic

A multiplexer is placed between a group of 32 registers and an accumulator to regulate data movement such that at any given point in time the content of only one register will move to the accumulator. The minimum number of select lines needed for the multiplexer is _______ .

Answers and explanations are free — they just need an account.