GATE CS 2019 - Digital Logic Quiz-5 ( Combinational Circuits-1)

Attempt now to get your rank among 446 students!

Question 1

Without any additional circuitary, an 8:1 MUX can be used to obtain.

• Asome but not all Boolean functions of 3 variables.
• Ball functions of 3 variables but none of 4 variables.
• Call functions of 3 variables and some but not all of 4 variables.
• Dall functions of 4 variables.

Question 2

Consider the digital circuit shown below

The digital circuit acts as

• A9’s complement circuit
• B10’s complement circuit
• C5’s complement circuit
• D9’s complement circuit if C3=0 and 10’s complement circuit if C3=1

Question 3

A 1-bit full adder takes 20ns to generate carryout bit and 40ns for the sum bit. What is the maximum rate of addition per second when four 1-bit full adders are cascaded?

• A(10)^7
• B1.25*(10)^7
• C6.25*(10)^6
• D(10)^5

Question 4

Minimum number of 2-input NAND gates required to implement the function,
F= is

• A1
• B2
• C3
• D4

Question 5

Consider the circuit given below

Which of the following statements is true for Y.

• A
• B
• C
• D

Question 6

The logic function f (A, B, C, D) implemented by the circuit shown below is

• A
• B
• C
• DD(A.B)

• 446 attempts
• 1 upvote
• 2 comments