All items on this calendar are subject to change. Please check back here occasionally during the quarter. Last revised 06/01/2001
Lecture transparencies, handouts, quizzes, and assignments will also be available.
Notes on textbook reading: in addition to specific sections and pages mentioned, be sure to reach each chapter introduction and chapter review.
Week Date
Reading 
Monday  Tuesday  Wednesday  Friday 
#1
3/26/2001 
Administration; Course overview; Introduction Number representations Katz pgs. 650–661 (App A.1A.3: positional notation; conversion; arithmetic operations) 
Number systems
Arithmetic 241–248 (5.1: signed numbers) 
More introduction
Miniquiz #1 
More introduction
1–27 (1.11.3.6: overviews and intros) 
#2
4/2 
Combinational logic
Katz pgs. 40–49 (2.1: logic functions and Boolean algegbra) Miniquiz #2 
Combinational logic Katz pgs.4965 (2.2: gate logic, canonical forms) Assignment 1 due 
Combinational logic
6583 (2.3: Twolevel simplification with Kmaps)


#3 4/9

Combinational logic
Katz pgs. 83–85 (2.3.6: 5 and 6 var. Kmaps) Pgs. 85–92 (2.4: CAD tool) are optional) 
Combinational logic
92–102 (2.5.1: technology metrics; 2.5.2: TTL logic; 2.5.2: Schematics standards) Miniquiz #3 
Combinational logic implementation
Katz pgs. 110–122 (3.1: multilevel logic; converting to NAND/NOR). Miniquiz #4 

#4 4/16  Combinational logic implementation [Optional: pgs. 122–126 (3.2: CAD tools for multilevel)]. 137–147 (3.3: time response; 3.4: hazards and glitches). 147–149 (3.5.1: data sheets). [149152 (3.5.23.5.3) are optional)] 
Combinational logic implementation Katz 173–207 (4.2: steering logic, multiplexers; decoders; ROMs; for now omit 4.2.4: tristate devices) Miniquiz #5 
Combinational logic implementation


#5 4/23  Combinational logic implementation
Katz pgs. 160–172 (4.1: programmable logic) 
Combinational logic examples
Katz pgs. 207224 (4.34.6: word problems and case studies) 
Combinational logic examples
Katz pgs. pp. 248–262 (5.25.5: arithmetic circuits). Assignment 4 due 

#6 4/30

Combinational logic examples

Hardware description languages  Sequential logic
Katz 282–299 (6.1: sequential switching networks, flipflops) Miniquiz #7

Sequential logic
Katz pgs. pp. 299–306 (6.2: timing methodologies) Quiz #3 
#7 5/7  Sequential logic
Katz pgs. pp. 306316 (6.3: flipflop choice; 6.4: asynchronicity) 
Sequential logic implementation

Katz pgs. pp. 194–202 (4.2.4: tristate devices) Assignment 6 due 

#8 5/14  Sequential logic implementation Katz 329–345 (7.1: registers and counters; 7.2: counter design; 7.3: selfstarting counters) 
Sequential logic implementation Katz 345–356(7.4: flipflop choice; 7.5: ripple counters). Optional: 356–373 (7.6: RAM)

Sequential logic implementation
Katz 383–395 (8.1: state machine concept; 8.2: basic approach). Assignment 7 due


#9 5/21

Sequential logic examples
Katz pgs. pp. 395–402  optional (8.3) Katz pgs. pp. 402–432 (8.4: Moore/Mealy machines; 8.5: FSM word problems) Quiz #4 
Sequential logic examples
Katz 449–470 (9.19.3: FSM optimization) 
Sequential logic examples
Katz 496–508 (10.1: FSM design with programmable logic). Katz chapter 11 (start) 

#10 5/28  No class: Memorial Day 
Assignment 8 due 
Computer organization Katz chapter 11.1 (skip 11.1.5), 11.2 (skim)

Last day of instruction. Computer organization Katz chapter 11.3 (skim) 
#11

Monday, June 4
Final exam: 2:30 p.m. 

Comments to: cse370webmaster@cs.washington.edu