![]() |
CPSC 201: Introduction to Computer Science |
![]() |
|||||||||||||||
![]() |
![]() |
![]() |
![]() Instructor: Carsten Schürmann Department of Computer Science Yale University Time: MWF 11:30-12:20 Room: AKW200 |
![]() |
![]() |
||||||||||||
|
![]() |
Lecture 12We have seen many Boolean functions in this class so far, and we have seen that certain Boolean functions can be expressed in terms of others. Is there are smallest set of Boolean functions that lets us allow to express all of them? The answer is yes, and this smallest set is called a Boolean bases. It turns out that NAND and NOR alone already form a Boolean basis. Next, we design sequential circuits. A sequential circuit is a circuit with feed back. This means that the output of a circuit is fed back into the circuit as input. Circuits of this form allow us to build hardware components that store information. Reading: Invitation to Computer Science
Chapter 4. |
![]() |