HANOI UNIVERSITY OF SCIE. & TECH.

FINAL EXAMINATION
SCHOOL OF ELECs. & TELECOM. DIGITAL ELECTRONICS
Date: 28/02/2023
Test: 01 Total page: 1 Time length: 90 minutes
(Do not use any type of materials
Return this sheet and your solution sheet)
Issuer: Course team leader:
Sign

Problem 1 (4 points)
Give the following state transition table and output state table. Please design a sequential circuit
using SR FF and D FF:
Current Next Stage Output Z
State wt=00 wt=01 wt = 10 wt = 11
A A B D H 1
B E D H A 0
C F D B F 0
D D H D H 1
E F D H F 0
F F D D H 1
G D H A H 1
H E D H A 0
Problem 2 (4 points)
Please analyze the following sequential circuit:

Problem 3 (2 points)
Plot the state graph of the 3-input-1-output Mealy finite state machine with the following
requirements:
- 3 inputs are x1, x2, x3 and 1 output is Z
- Output Z = 1 when the input bitstreams are:
x1 = 1010
x2 = 1001
x3 = 0110
 HANOI UNIVERSITY OF SCIE. & TECH. FINAL EXAMINATION
SCHOOL OF ELECs. & TELECOM. DIGITAL ELECTRONICS
Date: 28/02/2023
Test: 02 Total page: 1 Time length: 90 minutes
(Do not use any type of materials
Return this sheet and your solution sheet)
Issuer: Course team leader:
Sign

Problem 1 (4 points)
Give the following state transition table and output state table. Please design a sequential circuit
using JK FF and T FF:
TT kết tiếp Đầu ra Z
TT Hiện tại
wt=00 wt=01 wt = 10 wt = 11
A A B A B 0
B C A B D 1
C F A B F 1
D D H A B 0
E F A H F 1
F F A A B 0
G A B D B 0
H C A B D 1
Problem 2 (4 points)
Please analyze the following sequential circuit:

Problem 3 (2 points)
Plot the state graph of the 3-input-1-output Moore finite state machine with the following
requirements:
- 3 inputs are x1, x2, x3 and 1 output is Z
- Output Z = 1 when the input bitstreams are:
x1 = 1100
x2 = 1000
x3 = 0011