Digital Logic Circuits (DLC) MCQs with answers Page - 4

Here, you will find a collection of MCQ questions on Digital Logic Circuits (DLC). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 831.35K Points
Coach

Q. The systematic reduction of logic circuits is accomplished by:

  • (A) symbolic reduction
  • (B) ttl logic
  • (C) using boolean algebra
  • (D) using a truth table

A

Admin • 831.35K Points
Coach

Q. Each “1” entry in a K-map square represents:

  • (A) a high for each input truth table condition that produces a high output
  • (B) a high output on the truth table for all low input combinations
  • (C) a low output for all possible high input conditions
  • (D) a don’t care condition for all possible input truth table combinations

A

Admin • 831.35K Points
Coach

Q. Each “0” entry in a K-map square represents:

  • (A) a high for each input truth table condition that produces a high output
  • (B) a high output on the truth table for all low input combinations
  • (C) a low output for all possible high input conditions
  • (D) a don’t care condition for all possible input truth table combinations

A

Admin • 831.35K Points
Coach

Q. Looping on a K-map always results in the elimination of

  • (A) variables within the loop that appear only in their complemented form
  • (B) variables that remain unchanged within the loop
  • (C) variables within the loop that appear in both complemented and uncomplemented form
  • (D) variables within the loop that appear only in their uncomplemented form

A

Admin • 831.35K Points
Coach

Q. Which of the following expressions is in the sum-of-products form?

  • (A) (a + b)(c + d)
  • (B) (a * b)(c * d)
  • (C) a* b *(cd)
  • (D) a * b + c * d

A

Admin • 831.35K Points
Coach

Q. What is an ambiguous condition in a NAND based S’-R’ latch?

  • (A) s’=0, r’=1
  • (B) s’=1, r’=0
  • (C) s’=1, r’=1
  • (D) s’=0, r’=0

A

Admin • 831.35K Points
Coach

Q. In a NAND based S’-R’ latch, if S’=1 & R’=1 then the state of the latch is

  • (A) no change
  • (B) set
  • (C) reset
  • (D) forbidden

A

Admin • 831.35K Points
Coach

Q. A NAND based S’-R’ latch can be converted into S-R latch by placing

  • (A) a d latch at each of its input
  • (B) an inverter at each of its input
  • (C) it can never be converted
  • (D) both a d latch and an inverter at its input

A

Admin • 831.35K Points
Coach

Q. The difference between a flip-flop & latch is

  • (A) both are same
  • (B) flip-flop consist of an extra output
  • (C) latches has one input but flip-flop has two
  • (D) latch has two inputs but flip-flop has one

A

Admin • 831.35K Points
Coach

Q. How many types of flip-flops are?

  • (A) 2
  • (B) 3
  • (C) 4
  • (D) 5

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ