|
|
Computer Science 324
Computer Architecture
Mount Holyoke College
Fall 2009
|
|
Lecture 03: Digital Logic and Basic TTL Circuits
Date: Friday, September 18, 2009
We will meet briefly in my office, Clapp 226, and then will move into the lab, Clapp 201.
- Announcements
- Original lecture assignment from today is due on Tuesday (it is below)
- Digital Logic Gates
- Representing Mathematical Functions
- sum-of-products form
- simplification using Karnaugh maps
- Digital Logic Lab: constructing some simple circuits
Due at the start of class, Tuesday, September 22.
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.
Suppose you are interested in constructing a circuit that is high
precisely when four input lines DCBA represent a prime in 4-bit
unsigned binary.
- Use a Karnaugh map to generate a logical expression in
sum-of-products form with the smallest number of terms that computes
this function. Do not optimize the expression further.
- Suppose we didn't care if the function worked on the range
12..15. Use another Karnaugh map to generate a logical expression
in sum-of-products form with the smallest number of terms that
computes this function.