This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: l' First Name Last Name PID CSE 140 Midterm 2 (mm. grammar) Tajana Simunic Rosing
Spring 2006 0 Do not start the exam until you are told
to. 0 Turn off any cell phones or pagers. Close all backpacks. 1. ? points
0 Write your name and PID at the top of
. 2. ? points
every page. Do not separate the pages.
0 This is a closed—book, closednotes, no— .
3. ? pornts
calculator exam. You many only refer
to one page of your own notes.
4. ? points
0 Do not look at anyone else’s exam. Do
not talk to anyone but an exam proctor .
during the exam. 5 ? pomts
o If you have a question, raise your hand ,
6. ? pomts and an exam proctor will come to you. 0 You have 80 minutes to ﬁnish the TOTAL 100 points
exam. When the time is ﬁnished, you
must stop writing. 0 Write your answers in the space pro
vided. 0 To get the most partial credit, clearly
and neatly show all steps of your work. 1.» First Name Last Name PID
1. [ ? points ] Consider the following Boolean function: G(A, 3,0, D) 2 (2+ C)(Z+'E)(A + B + '5) a. What is the corresponding Karnaugh map for G? Arc
L/‘WrWlH b. Does the given implementation of G have any static—0 hazards?‘ Justify your
answer either by explaining why there is no hazard or by providing a hazard—free,
productof—sums implementation of G. W :67 MW‘M First Name Last Name PID 2. [ ? points ] Implement a positive edgetriggered master—slave T ﬂip ﬂop using only
clocked SR latches, 2—input AND gates, 2—input OR gates, and 1input NOT gates. WW gun/e SR 50PM:— ”mam”yum m mam... First Name Last Name PID 3. [ ? points ] Given the observed output Q of a negative edgetriggered JK ﬂip ﬂop
below, determine what the inputs C'lk, J, and K must be or write X if the value of the input doesn’t matter. You may make the following assumptions: 0 In the diagram below, the time difference between ti and ti+1 for all i is 1 nanosec—
ond (11s). 0 The ﬁrst rising edge of the clock occurs at time t1. 0 The JK ﬂip ﬂop has a setup time Tau of 2 ns, a hold time Th of 1 ns, and a
propagation delay Tpd of 4 ns ) \Q
23130 116111117” 0”” L
2%” “93". ’ My \ W“ Wm . ‘M
‘3’ W9)“ 4’» ()“2/ T96 ‘1 ”W 1,0190%“
1 [Nam—a :1 ,. C Pr ‘
QmmmmmmL: HHHHJlllllllldﬁllllm
11 1 1 1 r 1 1 r .1“1:1‘I‘51:1::::::1:1:::£:£1:1" ' ‘
Clk LOLIJ11LJ LI 1 0: o1oLoLo mLLLI :1 o_L Q10L0:01_11LI_L\:I 016:3L5101 01
I I I i
T T I Ewa7ﬁu¥ﬁh TMOL‘ 7 4+2 (WWJ762 First Name Last Name PID 4. [ ? points ] Consider a Mealy, non—resetting ﬁnite state machine that has one bi
nary input X and one binary output Z. The output Z = 1 occurs Whenever the
last ﬁve bits on input X have been 11101; otherwise, the output Z = 0. This ma—
chine recognizes overlapping sequences also. For example, if the input sequence is
X = 11101110111110111010, then the output sequence is Z = 00001000100000100010.
Draw a state diagram that implements this machine using exactly ﬁve states. First Name Last Name PID
5. [ ? points ] Consider the state transition and output table below. Present Next State Output Y
State AB=00 AB=01 AB=1X AB=OO AB=01 AB=1X b. List all of the orginal states, grouped into maximal classes of compatibility. Use
only as many groups as necessary. go= i 90) $25515
91: 3 $22) $5 3 .
92: $1 93 94 95 First Name _ _, IN 919?“? _,__ _ ,W1;’_L11_w_____ “m C. Show the minimized state transition and output table. Fill in ()7in as many rows
01 the table as necessary. Next State Output Y Present
AB: 00'1 B = 01 l AB 21X AB : 00 AB : 01 ‘43:, 1X St ate a::T—emw.____.i_r.~.,_~.._~.~..._w_~ . T _. ,,,,, 1....~_._____._._ 02,?“ l9! (0‘13? (93) ‘3: (0')} l l '0
OLE; l l l ' V 30. (9?) 3°, (OP) 53' .0? D J, i, mi" .Q__..i__9 d. Using a simple binary (sequential) encoding of the iiiinimizncl states. Show the nnxtismt'o and nutput equations.
352 3) we “w z buts; +2) made Qweg. lP/l 8\&D: {00)0U03 WWW gfeje’g 90)3:)gz First Name Last Name PID e. Provide the logic schematic of this Mealy (not synchronous Mealy) machine using
only D ﬂipﬂops, AND gates, OR gates, and NOT gates. Use only as many of the
ﬂipﬂops below as necessary. A
D Q
B Q1
* CK 6
Y
D Q
Q0
* CK 6
CK First Name Last Name PID 6. [ ? points ] Consider the ﬁnite state machine below. / 0/0 J WWW bog“) m
hnuM‘Mvv ywdﬁ W Implement a state assignment using the minimum bitchange heuristic. W‘d W Assignment . Q W
State Name Q2 Q1 Q0 be 0% ﬁne) one ‘ 9, 9% Wm be na‘ghbé‘é 0% 9:9 £12934— X‘IWW, 02%?“ W
Wu, 2% ' "”7799 mam/‘58 5} 94,5). é; with? '9; gunk/[2W we W AW 0‘ “WM“ ”MaiW‘MW”
bow sqomd 93—) MHW g; bﬁbde g5) @ 9% What 6} 99,53. First Name Last Name PID This page is intentionally left blank. Use as scratch paper or to provide additional
answers. 10 ...
View
Full Document
 Fall '06
 Rosing

Click to edit the document details