This preview shows pages 1–6. Sign up to view the full content.
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 Document
Unformatted text preview: Name Section ECEZOO Digital Design May 28, 2008 Practice Final Exam Closed Book
No calculators, PDAs, computers or any other electronic devices Instructions: Write your name and section number on each sheet. Write your answers
and do all relevant work on the exam pages. Clearly mark your answers. In all
problems, you must show all your work. Correct answers without adequate
accompanying work will not carry full points. You may submit additional pages if
necessary. If needed, the last page of this exam contains Boolean algebraic
equalities. For use by instructors only Problem 1. (10 points) Implement the function F using only NOR gates. You can
use variables X,Y,Z, but not their complements (X’, Y’ Z’). Hint: Recall how to
make an inverter with a NOR gate. FXYZ = 2XYZ(1a2a5)6) j
Z R Neg \U/
'z' y M
awe/pm W
/ \/——l>O'— F Practice Final Exam, Spring 2008 Page 1 Name Section Problem 2. Consider a combinational circuit with four inputs, A, B, C, D, and one output
F. The inputs represent a 4bit unsigned binary number. The output F is 1 if and only if the input number is a multiple of 2, or of 1W (Zero is considered as a multiple
of both 2 and 3). The truth table below has two entries ﬁlled in. Answer the following questions: (a) (5 points) Show the truth table for the above problem.
(b) (5 points) Implement the truth table as a combinational circuit, using two 3x8
decoders (with an activehigh enable line) and the minimum number of external gates (NAND only). 44
(c) (10 points) Implement the truth table as a combinational circuit, using i 4x1
multiplexer! and the minimum number of external gates (AND/OR). Practice Final Exam, Spring 2008 Page 2 Name ‘ Section Problem 4. Analyze the clocked synchronous state machine shown below, and
answer the following questions. (a) (5 points) Write the nextstate equations and the output equation. (b) (10 points) Construct the state transition/output table. (0) (5 points) Draw the state diagram. Civcuil’ \‘5 Conle“29q “‘ng L5 S+a¥€ \/ otvx'alu Les go
Neﬁzglmte aliens: 3 NW): A* = 80;)
BCJcH): 8* = AMG) EOE) Practice Final Exam, Spring 2008 Page 4 Name Section Problem 5. Analyze the Mealy machine shown below, and answer the following
questions. (a) (5 points) Write the nextstate equations and the output equation. (b) (10 points) Construct the state transition/output table. olo (c) (5 points) Draw the state diagram. Practice Final Exam, Spring 2008 Page 5 Name Section Problem 6. Consider a Moore machine that produces an output of 1 if a 0101 pattern
occurs in the input sequence. Overlapping sequences should be detected. (a) (10 points) Draw the corresponding state diagram and determine the state
transition table.
(b) (10 points) Obtain the next—state and output equations in their minimum forms. Practice Final Exam, Fall 2008 Name Section Problem 7. (10 points) A sequential circuit has two onebit inputs (A and B) and contains
one D ﬂipﬂop with clock inputs. If A = B the ﬂipﬂop is unchanged, otherwise the ﬂip ﬂop is complemented. Develop the next—state equation for the D ﬂip ﬂop. Describe the
steps clearly. a. gig—QJFEBEJF MEI—p” Jr Agap
Q’“ : A@B@®\ Practice Final Exam, Spring 2008 Page 7 ...
View
Full
Document
This note was uploaded on 03/24/2012 for the course ECE 322097 taught by Professor Staff during the Spring '08 term at Drexel.
 Spring '08
 Staff

Click to edit the document details