Digital Logic and Design MCQs with Answers
Practice important Digital Logic and Design MCQs with answers and explanations.
Chapter: 32
Q661:
In ________ outputs depend only on the combination of current state and inputs.
A. Mealy machine
B. Moore Machine
C. State Reduction table
D. State Assignment table
Correct Answer:
B
Chapter: 32
Q662:
In the state reduction process, what happens when two states are found to be equivalent?
A. One state is removed and replaced by the other
B. Both states are combined into one state
C. Both states are kept as separate states
D. The outputs of the states are averaged
Correct Answer:
A
Chapter: 32
Q663:
What is the effect of state reduction on the number of flip-flops in a state machine?
A. It can reduce the number of flip-flops if the number of states decreases
B. It always increases the number of flip-flops
C. It has no effect on the number of flip-flops
D. It simplifies the logic gate configuration
Correct Answer:
A
Chapter: 33
Q664:
What is the main goal of state assignment in a sequential circuit?
A. Minimize bit changes
B. Maximize state transitions
C. Maximize bit changes
D. Minimize flip-flops
Correct Answer:
A
Chapter: 33
Q665:
A flip-flop is a type of ________.
A. Sequential circuit
B. Combinational circuit
C. Memory unit
D. Data converter
Correct Answer:
A
Chapter: 33
Q666:
In the context of state assignments, what is a key benefit of minimizing bit changes between states?
A. Simplifies combinational logic
B. Increases state complexity
C. Requires more flip-flops
D. Reduces state count
Correct Answer:
A
Chapter: 33
Q667:
Given the states a, b, c, d, and f with assignments 000, 001, 010, 011, and 100 respectively, which state assignment results in fewer bit changes?
A. Assignment 1
B. Assignment 2
C. Assignment 3
D. All are equal
Correct Answer:
C
Chapter: 33
Q668:
How many states are there in the Moore Machine described?
A. 4
B. 5
C. 6
D. 7
Correct Answer:
C
Chapter: 33
Q669:
In the Moore Machine state diagram, what is the sequence of states starting from 011?
A. 011, 111, 001, 010, 100, 110
B. 011, 001, 010, 100, 110, 111
C. 011, 111, 010, 100, 110, 001
D. 011, 001, 100, 110, 010, 111
Correct Answer:
A
Chapter: 33
Q670:
What does the Karnaugh Map help simplify in Boolean algebra?
A. Logic gate implementation
B. Boolean expressions
C. Arithmetic operations
D. Sequential circuits
Correct Answer:
B
Chapter: 33
Q671:
How many cells are in a Karnaugh Map for 2 variables?
A. 2
B. 4
C. 8
D. 16
Correct Answer:
B
Chapter: 33
Q672:
Which Boolean expression is simplified by the Karnaugh Map for J-K flip-flops?
A. J2 = Q1Q0X + Q1Q0
B. K2 = Q1X
C. J0 = Q2Q1X
D. K0 = Q1X
Correct Answer:
A
Chapter: 33
Q673:
For the first state assignment, what is the Boolean expression for D2?
A. Q2Q1Q0X + Q1Q0X
B. Q2 + Q0X + Q1Q0
C. Q2Q0X + Q1Q0X + Q1Q0X + Q2Q1Q0X
D. Q2Q1X + Q1Q0X
Correct Answer:
A
Chapter: 33
Q674:
In a Moore Machine, which state has the output 111 when the input X is 1?
A. a
B. b
C. c
D. f
Correct Answer:
A
Chapter: 33
Q675:
In the Mealy Machine, what is the output for state 'b' when input X=0?
A. 111
B. 1
C. 11
D. 100
Correct Answer:
C
Chapter: 33
Q676:
Which flip-flop input table corresponds to the Moore Machine described in the text?
A. Table 33.6
B. Table 33.7
C. Table 33.8
D. Table 33.10
Correct Answer:
A
Chapter: 33
Q677:
What is the simplified Boolean expression for J0 in the Karnaugh Map for the Mealy Machine?
A. Q2Q1X
B. Q1X
C. Q2Q1
D. Q0X
Correct Answer:
A
Chapter: 33
Q678:
Which output Boolean expression is derived from the Karnaugh Map for the Mealy Machine?
A. O2 = Q2X + Q2Q1
B. O1 = Q1Q0X + Q2Q0
C. O0 = Q1X + Q2Q1
D. All of the above
Correct Answer:
D
Chapter: 33
Q679:
For the Mealy Machine, what is the next state if the current state is 010 and X=1?
A. 110
B. 1
C. 100
D. 11
Correct Answer:
A
Chapter: 33
Q680:
What should be done if there are unused states in state assignment?
A. Choose the best state variable combinations
B. Ignore the unused states
C. Maximize the bit changes
D. Minimize the state variables
Correct Answer:
A