Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007

Agenda

• Announcements
• Lecture assignment recap
• Exam recap
• Lab 3 recap
• Sequential circuits
  • edge detection
  • clocks
  • latches and flip-flops

Lecture Assignment

Due at the start of class, Monday, October 15, 2007.

Turn in short answers to these questions. Please turn in a hard copy (typeset or handwritten are OK). We will discuss these questions during class, so no late submissions are accepted.

The readings for next time are my notes on Sequential Circuits.

1. Draw a much simpler circuit that is equivalent to the following:

   

2. Occasionally it is necessary to add 1 to a number, for example, a program counter. Construct a device that is less expensive than a ripple-carry adder, that adds one to a value that is provided (D0..D3) and provides the result on the output (Q0..Q3). (Hint: you may consider a modular approach.)