Difference between revisions of "Syllabus"

From CSE260M Wiki
Jump to navigationJump to search
Line 6: Line 6:
 
|MATERIAL
 
|MATERIAL
 
|PREPARATION
 
|PREPARATION
 +
 
|-
 
|-
 
|1
 
|1
Line 11: Line 12:
 
|Course Introduction
 
|Course Introduction
 
|Chapter 1
 
|Chapter 1
 +
 
|-
 
|-
 
|2
 
|2
Line 22: Line 24:
 
|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
 
|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
 
|Chapter 2
 
|Chapter 2
|-4
+
 
 +
|-
 +
|4
 
|SEPT 11
 
|SEPT 11
 
|Essential Prime Implicants and Optimized Expressions<br />Standard Forms: SOP Notation<br />Five- and Six-Variable K-Maps<br />Don’t cares<br />Gate propagation delay<br />The Mux<br />The Decoder<br />Implementing Circuits Using Muxes
 
|Essential Prime Implicants and Optimized Expressions<br />Standard Forms: SOP Notation<br />Five- and Six-Variable K-Maps<br />Don’t cares<br />Gate propagation delay<br />The Mux<br />The Decoder<br />Implementing Circuits Using Muxes
 
|Chapter 2
 
|Chapter 2
 +
 
|}
 
|}

Revision as of 14:00, 9 May 2017

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