Explore topic-wise MCQs in Digital Circuits.

This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Digital Circuits knowledge and support exam preparation. Choose a topic below to get started.

1.

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
Answer» D. Variables within the loop that appear only in their uncomplemented form
Discussion
2.

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
Answer» B. A HIGH output on the truth table for all LOW input combinations
Discussion
3.

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
Answer» B. A HIGH output on the truth table for all LOW input combinations
Discussion
4.

The systematic reduction of logic circuits is accomplished by _______________

A. Symbolic reduction
B. TTL logic
C. Using Boolean algebra
D. Using a truth table
Answer» D. Using a truth table
Discussion
5.

The observation that a bubbled input OR gate is interchangeable with a bubbled output AND gate is referred to as __________________

A. A Karnaugh map
B. DeMorgan’s second theorem
C. The commutative law of addition
D. The associative law of multiplication
Answer» C. The commutative law of addition
Discussion
6.

The Boolean expression Y = (AB)’ is logically equivalent to what single gate?

A. NAND
B. NOR
C. AND
D. OR
Answer» B. NOR
Discussion
7.

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
Answer» D. Variables within the loop that appear only in their uncomplemented form
Discussion
8.

Which of the following is an important feature of the sum-of-products form of expressions?$

A. All logic circuits are reduced to nothing more than simple AND and OR operations
B. The delay times are greatly reduced over other forms
C. No signal must pass through more than two gates, not including inverters
D. The maximum number of gates that any signal must pass through is reduced by a factor of two
Answer» B. The delay times are greatly reduced over other forms
Discussion
9.

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
Answer» E.
Discussion
10.

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
Answer» B. A HIGH output on the truth table for all LOW input combinations
Discussion
11.

The Boolean expression Y = (AB)’ is logically equivalent to what single gate?$

A. NAND
B. NOR
C. AND
D. OR
Answer» B. NOR
Discussion