Lecture slides

Please contact us if you want the source files of the slides.
  1. Chapter 1: Sets and Functions.

  2. Chapter 2: Induction and Recursion.

  3. Chapter 3: Sequences and Series. See also slides on the pigeonhole principle.

  4. Chapter 4: Directed Graphs.

  5. Chapter 5: Binary Representation.

  6. Chapter 6: Propositional Logic.

  7. Chapter 7: Asymptotics.

  8. Chapter 9: Representation of Boolean Functions by Formulas.

  9. Chapter 10: The Digital Abstraction.

  10. Chapter 11: Foundations of combinational circuits.

  11. Chapter 12: Trees.

  12. Chapter 13: Decoders and Encoders.

  13. Chapter 14: Selectors.

  14. Chapter 14: Shifters.

  15. Chapter 15: Addition.

  16. Chapter 16: Signed Addition.

  17. Chapter 17: Flip-Flops.

  18. Chapter 18: Memory Modules.

  19. Chapter 19: Foundations of Synchronous Circuits.

  20. Chapter 20: Synchronous Modules.

  21. Chapter 21: The ISA of a Simplified DLX.

  22. Chapter 22: A Simplified DLX: Implementation.

Guy Even 2015-01-13