UC Davis
1
Hussain Al-Asaad
U
NIVERSITY
OF
C
ALIFORNIA
—D
AVIS
D
EPARTMENT
OF
E
LECTRICAL
& C
OMPUTER
E
NGINEERING
EEC180A—D
IGITAL
S
YSTEMS
I
S
PRING
2004
F
INAL
E
XAM
S
TUDENT
I
NFORMATION
I
NSTRUCTIONS
•
The exam is closed book and notes. Up to three double-sided cheat sheets are allowed.
•
Print your name and your ID number.
•
Circle your lab section number(s).
•
There are six problems in the exam. Solve
five
of them completely and put an X in the table
below for the problem that you do not wish to be graded. Show your work for partial credit.
•
If you need more space for your solution, use the back of the sheets.
E
XAM
G
RADE
Name
ID Number
Lab
Section
Registered
A01
(M 7-11pm)
A02
(T 7-11pm)
A03
(W 7-11pm)
A04
(R 7-11pm)
Attending
A01
(M 7-11pm)
A02
(T 7-11pm)
A03
(W 7-11pm)
A04
(R 7-11pm)
Problem
Maximum
Points
Student
Score
1
20
2
20
3
20
4
20
5
20
6
20
Total
100
This
preview
has intentionally blurred sections.
Sign up to view the full version.
UC Davis
2
Hussain Al-Asaad
1. M
EALY
S
TATE
M
ACHINES
(15 + 5 = 20
POINTS
)
1.1
A Mealy finite state machine has one input
X
and one output
Z
. The output
Z
= 1 occurs every
time the sequence 000 is observed on the input
X
provided that the sequence 111 has never been
seen on
X
. Draw the state diagram of this machine. Do not use excessive number of states. A typ-
ical input-output behavior is shown below:
1.2
This is the end of the preview.
Sign up
to
access the rest of the document.
- Spring '08
- REDINBO
- Karnaugh map
-
Click to edit the document details
