₹0 for students · Certificate · Beginner

Digital Logic

4 mini courses, 15 lessons: binary, logic gates, circuits that add and choose, and circuits that remember

Start free in the app

15 lessons · ~3 hours · 30-question final exam · pass mark 70%

About the course

What you’ll learn

How a computer is built from switches. Start with binary numbers, then logic gates and Boolean algebra, then the circuits that add, compare and route data, and finally flip-flops, counters and state machines, the circuits that remember. Every circuit is also simulated in a few lines of Python so you can test it yourself. Pass every lesson quiz and the final exam to earn a verifiable certificate.

Number systemsLogic gatesBoolean algebraCombinational circuitsSequential circuitsProblem solving

Part of the career tracks: Computer Science Foundations, Cybersecurity and Connected Systems

How the certificate works

  1. Read each lesson’s study guide, then the full lesson and any notebooks or exercises.
  2. Pass every lesson quiz with 70% or more.
  3. Pass the final exam: 30 questions in 45 minutes.
  4. Get a certificate with a public verification link, and add it to LinkedIn.

Syllabus

15 lessons in 4 mini courses

Each mini course takes about an hour. Already know one? Test out in the app and skip it.

1. Numbers in binary

Convert between number systems and do binary arithmetic, including negative numbers.

1
Binary, Octal and Hex
10 min · Each binary place is worth twice the one to its right.
2
Binary Arithmetic and Negative Numbers
12 min · 1 + 1 = 10 in binary: write 0, carry 1.
3
Codes: BCD, ASCII, Unicode and Gray
10 min · BCD stores each decimal digit in 4 bits.

2. Gates and Boolean algebra

Build any logic function from gates and simplify it with Boolean algebra and K-maps.

4
Logic Gates
10 min · A gate computes a logic function from transistors.
5
Boolean Algebra
12 min · AND is multiplication, OR is addition, NOT is a prime or bar.
6
Karnaugh Maps
12 min · A K-map lays out a truth table in Gray-code order.
7
NAND, NOR and Real Chips
10 min · NAND and NOR are universal: they can build any gate.

3. Circuits that compute

Design adders, multiplexers, decoders and comparators.

8
Half and Full Adders
12 min · Half adder: sum = A XOR B, carry = A AND B.
9
Multiplexers and Demultiplexers
10 min · A mux picks one of several inputs using select lines.
10
Decoders and Encoders
10 min · A decoder turns n bits into one of 2ⁿ output lines.
11
Comparators and the ALU
10 min · Two bits are equal when A XNOR B = 1; AND them for n bits.

4. Circuits that remember

Explain flip-flops, registers, counters and state machines.

12
Latches and Flip-flops
12 min · Feedback gives a circuit memory.
13
Registers and Counters
10 min · A register is a row of flip-flops on one clock.
14
Finite State Machines
12 min · An FSM is always in one of a fixed set of states.
15
Memory, PLDs and FPGAs
10 min · SRAM: six transistors per bit, fast, used for caches.

Written by Vikosha. Lessons, questions and exercises are original. Licence: Original Vikosha course..