Course outline
CSE 203 Digital Logic Design — what the course covers and how it is organised, with every topic linked to its slide deck.
General information
| Course | CSE 203 · Digital Logic Design · theory course |
| Textbook | M. Morris Mano and Michael D. Ciletti, Digital Design, 5th edition, Pearson |
| Materials | The class lecture materials, rebuilt here as 13 interactive decks |
What you will be able to do
- Convert between number systems and use binary codes (BCD, Gray, ASCII) and signed arithmetic.
- Simplify Boolean functions with the laws of Boolean algebra, canonical forms and Karnaugh maps.
- Design combinational circuits: adders, subtractors, comparators, decoders, encoders, multiplexers and demultiplexers.
- Analyse and design sequential circuits: latches, flip-flops, state machines, counters and registers.
- Explain memory organisation, error detection and correction, ROM and programmable logic.
Lecture plan
| Topic | Content | Slides |
|---|---|---|
| 1 | Introduction to Digital Logic (Midterm) What a digital system is, why it uses only 0 and 1, and how simple gates grow into a computer. | Open |
| 2 | Number Systems & Binary Codes (Midterm) Positional number systems, base conversion, signed numbers, BCD and Gray code. | Open |
| 3 | Boolean Algebra & Logic Gates (Midterm) The algebra behind every circuit: laws, DeMorgan, gates, minterms and canonical forms. | Open |
| 4 | Universal Gates & Karnaugh Maps (Midterm) Build anything from NAND or NOR, then simplify functions visually with Karnaugh maps. | Open |
| 5 | Combinational Logic & Arithmetic Circuits (Midterm) Adders, subtractors, BCD adders and comparators: the arithmetic inside every ALU. | Open |
| 6 | Decoders, Encoders & Data Selectors (Final) Circuits that route and select data: decoders, encoders, multiplexers and demultiplexers. | Open |
| 7 | Sequential Logic: Latches & Flip-Flops (Final) Memory for digital circuits: clocks, latches, flip-flops and the timing rules they obey. | Open |
| 8 | State Machines & Sequential Circuit Design (Final) Describe behaviour as states and transitions, reduce it, and turn it into flip-flops and gates. | Open |
| 9 | Counters (Final) Ripple, synchronous, up/down, MOD-N, ring and Johnson counters, and frequency division. | Open |
| 10 | Registers (Final) Groups of flip-flops that store and move data: parallel load, shift registers and register transfer. | Open |
| 11 | Memory & Error Correction (Final) How memory is organised, decoded and expanded, and how errors are detected and corrected. | Open |
| 12 | ROM & Programmable Logic (Final) ROM as a lookup table, then PLA and PAL: configurable AND and OR arrays. | Open |
| 13 | Digital Systems & Practice (Review) Put the blocks together: a small ALU, a traffic light, a digital lock, and design workflows. | Open |
Midterm: topics 1–5 (number systems and codes, Boolean algebra and gates, universal gates and K-maps, combinational and arithmetic circuits). Final: topics 6–12 (decoders, encoders and multiplexers, latches and flip-flops, state machines, counters, registers, memory, ROM and programmable logic). Topic 13 puts the blocks together for revision.