![]() |
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 9Truth tables define Boolean functions. Alternatively, we can use Boolean expressions to define Boolean functions, or even circuits, that are build from gates. In this lecture, we will define what Boolean expressions, functions and circuits are, and we will argue that they are all equivalent. Code: booleans.sml. Reading: Invitation to Computer Science
Chapter 4. |
![]() |