Syllabus (Microsoft Word format)

Interesting Links

• Hades, logic simulator (courtesy of Thomas Shaffer)
• Gray code information (from Wikipedia)
• ASCII (from Wikipedia)
• Unicode (from Wikipedia)
• Extended Binary Coded Decimal Interchange Code (from Wikipedia)
• Consistency Guarantees for Concurrent Shared Objects: Upper and Lower Bounds
• Information about flip-flops (from Wikipedia)
• Information about 3-state buffers (from Wikipedia)
• Why the 4-bit by 3-bit Multiplier From Figure 4.16 Works (Microsoft Word format)
• Binary Marble Adding Machine (courtesy of Daniel White)
• Demonstrations of Logic Circuits (courtesy of Jake Dawson)
  • Full Adder (right-click to save)
• InfoTraffic
• Circuit Editor by Nicholas Duchon
• Byte Measurement Units
• Information about an Algebraic Proof of DeMorgan's Laws

Practice Problems by Chapter

• Chapter 1
  Problems 2 through 4, 7 through 25, 27, 29, 31, 32
• Chapter 2
  • 3rd edition: 1-6, 8, 9, 10-12, 14-22
  • 4th edition: 1-9, 12-15, 17-25
• Chapter 3
  • Problems 1-10, 12-21, 23, 24, 26, 30
• Chapter 4
  • Problems 1, 2, 4-5, 6-7 (part a only in 4th edition), 10, 11, 13-14, 16-18, 20 (part a only in 4th edition), 21-25, 27-28, 30-35
• Chapter 5
  • Problems 1-10, 12-14, 16-20
• Chapter 6
  • Problems 3-4, 6-8, 9a, 10-11, 13-22, 24-29
• Chapter 7
  Problems 1-4, 6-15, 17-25, 26 (3rd edition), 27 (4th edition)