BEE Digital Logic and Systems 2

Question 1

Which minimization technique uses a tabular method to find the prime implicants of a Boolean function?

Accepted Answer

Quine-McCluskey method

Answer

The Quine-McCluskey method is a tabular algorithm for finding all prime implicants, useful for functions with many variables where K-maps become impractical.

Question 2

In a JK flip-flop, what is the output when both J=1 and K=1?

Accepted Answer

Toggle (Q changes state)

Answer

When J=K=1, the JK flip-flop toggles its output on each clock edge, which eliminates the undefined state of the SR flip-flop.

Question 3

A 4-bit ripple carry adder adds two numbers in how many gate delays compared to a carry look-ahead adder?

Accepted Answer

More gate delays

Answer

A ripple carry adder propagates carry serially through each stage, resulting in more gate delays than a carry look-ahead adder which computes carries in parallel.

Question 4

Which of the following is a universal gate?

Accepted Answer

NAND gate

Answer

NAND (and NOR) gates are universal because any Boolean function can be implemented using only NAND gates.

Question 5

In a Moore machine, the output depends on:

Accepted Answer

Current state only

Answer

In a Moore machine, outputs are a function of the current state only, making them synchronous with the clock.

BEE - Bachelor of Electrical Engineering Practice Test

BEE - Bachelor of Electrical Engineering Practice Test

BEE Digital Logic and Systems 2