Syllabus

From CSE260M Wiki
Revision as of 14:00, 9 May 2017 by Wdr (talk | contribs)
Jump to navigationJump to search
SYLLABUS
LECTURE DATE MATERIAL PREPARATION
1 AUG 28 Course Introduction Chapter 1
2 AUG 30 Boolean Algebra
The Consensus Theorem
Introduction to K-Maps
Chapter 2
3 SEPT 6 Standard Forms: POS Notation
Two-Level Circuit Optimization Using K-Maps
Proving Identities Using K-Maps
The XOR Gate
The Half Adder
The Full Adder
The Ripple-Carry Adder
Chapter 2
4 SEPT 11 Essential Prime Implicants and Optimized Expressions
Standard Forms: SOP Notation
Five- and Six-Variable K-Maps
Don’t cares
Gate propagation delay
The Mux
The Decoder
Implementing Circuits Using Muxes
Chapter 2