Difference between revisions of "Syllabus"
From CSE260M Wiki
Jump to navigationJump to search| Line 8: | Line 8: | ||
|- | |- | ||
|1 | |1 | ||
| − | | | + | |AUG 28 |
|Course Introduction | |Course Introduction | ||
|Chapter 1 | |Chapter 1 | ||
|- | |- | ||
|2 | |2 | ||
| − | | | + | |AUG 30 |
|Boolean Algebra<br />The Consensus Theorem<br />Introduction to K-Maps | |Boolean Algebra<br />The Consensus Theorem<br />Introduction to K-Maps | ||
|Chapter 2 | |Chapter 2 | ||
| + | |3 | ||
| + | |SEPT 6 | ||
| + | |Standard Forms: POS Notation<br />Two-Level Circuit Optimization Using K-Maps<br />Proving Identities Using K-Maps<br />The XOR Gate<br />The Half Adder<br />The Full Adder<br />The Ripple-Carry Adder | ||
|} | |} | ||
Revision as of 13:39, 9 May 2017
| 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 |
