|
Computer Science 324
Computer Architecture
Mount Holyoke College
Fall 2007
|
|
Lecture 09: Adders, Multiplexers, Demultiplexers
Date: Wednesday, October 3, 2007
- Announcements
- Exam questions and answers
- Adding Circuits
- Half adders
- Full adders
- Ripple-Carry adders
- Subtractors
- More efficient adders
- Multiplexers and demultiplexers
- Exam 1 out
Due at the start of class, Wednesday, October 10.
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.
- Consider a 2-bit ripple-carry adder and a direct implementation
of a 2-bit adder using sum-of-products circuits (3 functions of 5
inputs). You need not construct the actual circuits, but discuss
the relative costs in terms of gate count and gate delay. How do
you think these change as the number of bits increases?