DOC112 Computer Hardware Course

• Course Outline

• Lecture 1 (Handout:Slides)  Introduction to Boolean Algebra
• Lecture 2 (Handout:Slides) Gates Integrated Circuits and Boolean functions
• Lecture 3 (Handout:Slides) Canonical Forms and Karnaugh Maps
• Lecture 4 (Handout:Slides) Cirucit Minimization
• Lecture 5 (Handout:Slides) Physical Realisation of Boolean gates
• Lecture 6 (Handout:Slides) Physical Time Dependent Behaviour of Digital Circuits
• Lecture 7 (Handout:Slides) Introduction to Sequential Circuits and Flip Flops
• Lecture 8 (Handout:Slides) Synchronous Digital Systems
• Lecture 9 (Handout:Slides) Finite State Repsesentation of Digital Circuits
• Lecture 10 (Handout:Slides) Traffic Lights: a design example
• Lecture 11 (Handout:Slides) Registers (part 1)
• Lecture 12 (Handout:Slides) Registers (part 2)
• Lecture 13 (Handout:Slides) Computer Arithmetic
• Lecture 14 (Handout:Slides) A manual Processor (part 1)
• Lecture 15 (Handout:Slides) A manual Processor (part 2)
• Lecture 16 (Handout:Slides) Random Access Memory
• Lecture 17 (Handout:Slides) Designing a processor (part 1)
• Lecture 18 (Handout:Slides) Designing a processor (part 2)

• Tutorial 1 (Question Sheet :Solution) Propositional Calculus, de Morgan's Theorem
• Tutorial 2 (Question Sheet :Solution) Boolean Algebra and Truth Tables
• Tutorial 3 (Question Sheet :Solution) Karnaugh Maps
• Tutorial 4 (Question Sheet :Solution) Timing in Logic Circuits
• Tutorial 5 (Question Sheet :Solution) Two mode counter design
• Tutorial 6 (Question Sheet :Solution) Binary sequence recogniser
• Tutorial 7 (Question Sheet :Solution) Binary coded decimal adder
• Tutorial 8 (Question Sheet :Solution) Registers
• Tutorial 9 (Question Sheet :Solution) A Manual Processor

• Unique Student Numbers for the coursework
• Coursework 1: Combinatorial Circuit Design (Handout: Digisim )
• Coursework 2: Sequential Design Exercise


• Errata