Class Schedule

Week Topics Reading Homework
1 Tu 01/04 Intro to combinational logic and two-level logic Ch 2.1, 2.2, 2.3 (skip time behavior and waveforms for now), 2.4 (skip maxterms for now), 2.5 Set 1: Ch 2.2, 2.3, 2.4, 2.5, 2.10, 2.25c, 2.26abc, 2.34

Set-1-Part-1 Solutions

Th 01/06 Two-level logic minimization using K-maps Ch 3.1
2 Tu 01/11 Two-level logic minimization using Quine McCluskey Method Ch 3.2 (skip 3.2.2 on Espresso) Set 1: Ch 3.1b, 3.2b (only related to 3.1b), 3.3bc, 3.4bc (only related to 3.3bc), 3.5abc, 3.6, 3.9ace

Set-1-Part-2 Solutions

Th 01/13 Hazard-free minimization Ch 3.5.4 Set 1: Ch 3.18ab (only consider static hazards, don't worry about dynamic hazards)
3 Tu 01/18 Multi-level logic Ch 2.3.3, 2.6, 3.5.1, 3.5.2 Set 1: Ch 2.37, 2.38, 2.40
Th 01/20 Critical path analysis Set 1: Homework problem

Set-1-Part-3 Solutions

4 Tu 01/25 Ripple-carry, carry-lookahead, carry-select adders Ch 5.6.1, 5.6.2, 5.6.3 Set 2: Ch 5.2, 5.3, 5.13

Set-2-Part-1 Solutions

Th 01/27 Midterm 1 in class (covers thru Th 01/20)

Midterm 1 topics

Midterm 1 solutions

5 Tu 02/01 Negative number representation, subtraction, ALUs ... Appendix A.4 Set 2: Appendix A.11, A.12, A.13, A.14
Th 02/03 Finite state machines Ch 7.1, 7.2, 7.3, 7.4 Set 2: 7.2, 7.3, 7.4, 7.16, 7.20, 7.22, 7.23, 7.24, 7.26, 7.27

Set-2-Part-2 Solutions

6 Tu 02/08 Finite state machines
Th 02/10 State minimization Ch 8.1 Set 2: Ch 8.1, 8.2, 8.3, 8.4, 8.5

Set-2-Part-3 Solutions

7 Tu 02/15 State minimization
Th 02/17 Control-path/data-path
8 Tu 02/22 More on control-path/data-path
Th 02/24 Midterm 2 in class (covers thru Tu 02/15)

Midterm 2 topics

Midterm 2 solutions

9 Tu 03/01 Review
Th 03/03 Revisit carry-select and carry-lookahead adders, more on state machine designs ...
10 Tu 03/08 Flip-flops
Th 03/10 Wrap up and looking ahead