Subject-wise GATE questions

Digital Logic

12 questions and papers

GATE CS 2020 — Question 7

Numerical answer 1 mark GATE CS — Computer Science & IT 2020

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…

GATE CS 2019 — Question 11

Multiple choice 1 mark GATE CS — Computer Science & IT 2019

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\)…

GATE CS 2018 — Question 39

Numerical answer 2 marks GATE CS — Computer Science & IT 2018

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…

GATE CS 2017 Set 2 — Question 5

Multiple choice 1 mark GATE CS — Computer Science & IT 2017

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:

GATE CS 2016 Set 2 — Question 8

Numerical answer 1 mark GATE CS — Computer Science & IT 2016

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 CS 2016 Set 1 — Question 41

Numerical answer 2 marks GATE CS — Computer Science & IT 2016

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

Numerical answer 2 marks GATE CS — Computer Science & IT 2015

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

Multiple choice 1 mark GATE CS — Computer Science & IT 2015

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

GATE CS 2014 — Question 16

Numerical answer 2 marks GATE CS — Computer Science & IT 2014

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

GATE CS 2011 — Question 9

Multiple choice 1 mark GATE CS — Computer Science & IT 2011

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: