CS3031 · WEEK 3

SOP, POS, universal gates and timing.

Understand digital circuits with illustrated explanations, worked examples, past-paper discussions and revision questions.

5 study sections15 illustrations1 resource
Start Lesson 1 →

Study sections

Follow the order or choose a section
01

From SOP to a Circuit — Two-Level Logic

Last week you turned a truth table into a Sum of Products formula. This week you turn that formula into a real circuit you could build…

1 illustrations
02

Product of Sums (POS) and Maxterms

SOP looks at the rows where the output is 1 . But what if the output is 1 almost everywhere, and 0 in just two rows? Then it’s easier t…

3 illustrations
03

Universal Gates — Building Everything from NAND or NOR

Imagine a LEGO box with only one kind of brick, yet you can still build anything. NAND gates are like that: with enough NAND gates, you…

3 illustrations
04

Multilevel Logic and Timing Diagrams

A room has three doors , with a light switch at each one. Flip any switch and the bulb should change: on to off, or off to on. How woul…

5 illustrations
05

How to Solve Week 3 Exam Questions

“What is the minimum number of gates?” comes in every quiz and end-term. This page teaches the method from zero, then solves every Week…

2 illustrations