Timetable
| Week 1 (starting 30th Sept) | ||||
| No lectures, no tutorials. | ||||
| Week 2 (starting 7th Oct) | ||||
| 10/10 | Thursday 12-1 | 01 Introduction and becoming binary thinkers | Lecture | Schuller |
| 10/10 | Thursday 2-3 | 02 Binary arithmetic | Lecture | Schuller |
| 10/10 | Thursday 3-4 | 03 Floating point representation | Lecture | Schuller |
| Coursework Task 1: data representation | ||||
| Week 3 (starting 14th Oct) | ||||
| 17/10 | Thursday 12-1 | 04 Boolean algebra and logic gates | Lecture | Schuller |
| 17/10 | Thursday 2-3 | Functions Propositional Calculus, de Morgan’s Theorem | Tutorial | Schuller |
| 17/10 | Thursday 3-4 | 05 Canonical Forms and Karnaugh Maps | Lecture | Schuller |
| Week 4 (starting 21st Oct) | ||||
| 24/10 | Thursday 12-1 | 06 Combinatorial Circuit Design | Lecture | Kainz |
| 24/10 | Thursday 2-3 | Boolean Algebra and Karnaugh maps | Tutorial | Kainz |
| 24/10 | Thursday 3-4 | 07 Time-Dependent Behaviour of Digital Circuits and Feedback | Lecture | Kainz |
| Coursework Task 2: Combinatorial Circuit Design | ||||
| Week 5 (starting 28th Oct) | ||||
| 31/10 | Thursday 12-1 | 08 Introduction to Sequential Circuits and Flip Flops | Lecture | Kainz |
| 31/10 | Thursday 2-3 | Timing in Logic Circuits | Tutorial | Kainz |
| 31/10 | Thursday 3-4 | 09 Synchronous Digital Systems | Lecture | Kainz |
| Week 6 (starting 4th Nov) | ||||
| 07/11 | Thursday 12-1 | 10 Finite State representation of Digital Circuits | Lecture | Kainz |
| 07/11 | Thursday 2-3 | Two mode counter design | Tutorial | Kainz |
| 07/11 | Thursday 3-4 | 11 Traffic Lights – a design example | Lecture | Kainz |
| Week 7 (starting 11th Nov) | ||||
| 14/11 | Thursday 12-1 | 12 Registers | Lecture | Schuller |
| 14/11 | Thursday 2-3 | Binary sequence recogniser | Tutorial | Schuller |
| 14/11 | Thursday 3-4 | 13 Registers, Multiplexers, Decoders, Comparators | Lecture | Schuller |
| Coursework Task 3: Registers | ||||
| Week 8 (starting 18th Nov) | ||||
| 21/11 | Thursday 12-1 | 14 Arithmetic | Lecture | Kainz |
| 21/11 | Thursday 2-3 | Binary coded decimal adder | Tutorial | Kainz |
| 21/11 | Thursday 3-4 | 15 A Manual Processor | Lecture | Kainz |
| Week 9 (starting 25th Nov) | ||||
| 28/11 | Thursday 12-1 | 16 A Manual Processor | Lecture | Schuller |
| 28/11 | Thursday 2-3 | A Manual Processor | Tutorial | Schuller |
| 28/11 | Thursday 3-4 | 17 Random Access memory | Lecture | Schuller |
| Week 10 (starting 2nd Dec) | ||||
| 05/12 | Thursday 12-1 | 18 A 32 bit Computer Architecture | Lecture | Schuller |
| 05/12 | Thursday 2-3 | 19 A 32 bit Computer Sequencing | Lecture | Schuller |
| 05/12 | Thursday 3-4 | No lecture or tutorial |
Coursework
There will be three coursework exercises, one after the first session, one after week 3 and one by the end of the course. Coursework sheets can be downloaded from CATE. Unique student numbers can be found on CATE. If you cannot find your number in this list, please let me know.
DIGISIM , created by Prof. Duncan Gillis.
you can play around with a simple online logic circuit simulator here: https://simulator.io/