CS/ECE 752: Advanced Computer Architecture I
Homework #0
Due: Thursday, September 9, 1999
Problem 1
Fill out a 4 by 6 index card with the following information:
Be sure to leave a 2" by 2" space in the upper right hand corner
for your photograph (see below).
- Name (last name, first name)
- E-Mail Address
- Year in School
- Major Field
- Final Degree Goal (e.g., Ph.D.)
- Previous Education (degrees, institutions)
- Previous Computer Architecture Courses
- Previous Computer Science Courses
- Relevant Work Experience
- Outside Interests
Start each item on a new line. Please print clearly.
Problem 2
Supply a 2" by 2" (passport size) photograph of yourself.
Be sure to write your name on the back.
Attach it to the card for problem 1 with a staple or tape
(not a paper clip).
The photos will not be returned.
Problem 3 (not to be turned in)
752 assumes that you remember the gist of the implementation issues in 552.
Here are two problems to jog your memory.
Let a 2-bit decoder have inputs enable and
select[1:0] and outputs out0, out1,
out2, and out3, where outi is asserted
(is 1) if enable is asserted and select[1:0]
equals i.
- Define a 4-bit decoder with enable.
- Implement a 4-bit decoder with 2-bit decoders and
simple gates (AND, OR, NOT).
Problem 4 (not to be turned in)
Assume a sequential circuit is clocked
by clk, has input in, and output out.
Let a new in be provided each clock. Make output out be asserted
if and only if the current in is 1, the previous in
was 0, and the previous previous in was 1.
- Draw a finite state machine that represents the above circuit (you know
circles for states and arcs for transitions).
- Implement your design with latches (e.g., D latches) and simple
gates (e.g., AND, OR, NOT).