Lecture 3. Boolean
Algebra, Logic Gates
Prof. Sin-Min Lee
Department of Computer
Science
2x
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Boolean Algebra, logic circuit, Lecture notes of Digital Logic Design and Programming
universal digital logic circuits
Typology: Lecture notes
2016/2017
1 / 64
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Boolean Algebra, logic circuit and more Lecture notes Digital Logic Design and Programming in PDF only on Docsity!
Lecture 3. Boolean
Algebra, Logic Gates
Prof. Sin-Min Lee
Department of Computer
Science
2x
Chapter Goals
- (^) Boolean Algebra
- (^) Identify the basic gates and describe the
behavior of each
- (^) Combine basic gates into circuits
- (^) Describe the behavior of a gate or circuit using
Boolean expressions, truth tables, and logic
diagrams
<B; +, ,’, 0,1> Algebraic System Binary operations: +, Unary operation: ‘
Properties of Boolean Algebra
jasonm: Redo table (p101) jasonm: Redo table (p101) Page 101
Computers
- (^) There are three different, but equally powerful, notational methods for describing the behavior of gates and circuits - (^) Boolean expressions - (^) logic diagrams - (^) truth tables
- (^) Logic diagram: a graphical representation of a circuit - (^) Each type of gate is represented by a specific
graphical symbol
- (^) Truth table: defines the function of a gate by listing all possible input combinations that the gate could encounter, and the corresponding output