Digital Logic and Design – GATE CSE Previous Year Questions

Solving GATE Previous Year’s Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of questions generally asked in the GATE exam, and that eventually helps you to gain good marks in the examination. Previous Year Questions help a candidate practice and revise for GATE, which helps crack GATE with a good score.

Digital Logic and Design Previous Year GATE Questions help in analyzing the question pattern of a subject and marking scheme as well as helps in time management which overall increases the score in the GATE exam. With regular practice of PYQs, candidates can easily crack GATE with a good GATE Score.

Before 2006, questions asked in GATE were mainly theoretical, but in recent years, the questions asked were multiple-choice questions with a single correct option or multiple correct options. We are looking to provide the multiple-choice questions that are asked in GATE.

Digital Logic & Design GATE Previous Year Questions

In this article, we are mainly focusing on the Digital Logic & Design GATE Questions that are asked in Previous Years with their solutions, and where an explanation is required, we have also provided the reason.

In Digital Logic and Design, we will deal with the following concepts. We have also provided GATE Previous Year’s Questions on these topics. Here is the list of those topics along with their links.

Below mentioned are the links to the Digital Logic & Design PYQ’s pages. On each page, you will get the questions asked in DLD along with the years asked.

Also, here we are going to discuss some basic PYQs related to Digital Logic & Design.

1. In 16-bit 2’s complement representation, the decimal number -28 is: [GATE CSE 2019]

(A) 1000 0000 1110 0100

(B) 0000 0000 1110 0100

(C) 1111 1111 1110 0100

(D) 1111 1111 0001 1100

For more, refer to GATE CS 2019 | Question 14.

2. Which one of the following is NOT a valid identity? [GATE CSE 2019]

(A) (x âŠ• y) âŠ• z = x âŠ• (y âŠ• z)

(B) (x + y) âŠ• z = x âŠ• (y + z)

(C) x âŠ• y = x + y, if xy = 0

(D) x âŠ• y = (xy + xâ€²yâ€²)â€²

For more, refer to GATE | GATE CS 2019 | Question 21.

3. Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is [GATE CSE 2015]

(A) 0, 1, 3, 7, 15, 14, 12, 8, 0

(B) 0, 1, 3, 5, 7, 9, 11, 13, 15, 0

(C) 0, 2, 4, 6, 8, 10, 12, 14, 0

(D) 0, 8, 12, 14, 15, 7, 3, 1, 0

For more, refer to GATE | GATE-CS-2015 (Set 1) | Question 30.

4. Which one of the following expressions does NOT represent the exclusive NOR of x and y? [GATE CSE 2013]

(A) xy + x’y’

(B) xâŠ•y’

(C) x’âŠ•y

(D) x’âŠ•y’

For more, refer to GATE | GATE CS 2013 | Question 65.

5. The minters expansion of f(P, Q, R) = PQ + QR’ + P’R’ is [GATE CSE 2010]

(A) m2 + m4 + m6 + m7

(B) m0 + m1 + m3 + m5

(C) m0 + m1 + m6 + m7

(D) m2 + m3 + m4 + m5

For more, refer to GATE | GATE CS 2010 | Question 6.

GATE CSE Previous Year Question Papers

These previous year’s questions help you in understanding the question patterns followed by GATE that directly help a candidate in scoring good marks in GATE. Below are the mentioned links of year-wise GATE Previous Question Papers.