Bits, gates & algorithms — from binary and logic gates through CPU cycles, memory, data structures, threads and client-server computing.
Assemble and run real RV32I-style programs on a five-stage pipeline, with forwarding, caching and a cycle-by-cycle trace.
Sample sensors, run a firmware scheduler and drive a motor or servo on a simulated MCU, with 11 injectable electrical faults.
An eight-bit register, place values and a ripple carry chain — unsigned carry versus signed overflow.
Six gates on a digital trainer — input switches, output lamp and an automatically cycling truth table.
Fetch, decode and execute a LOAD, ADD, STORE and HALT program on a simple accumulator machine.
Register, direct-mapped cache and RAM — locality, conflict thrashing and streaming access traces.
Call-stack frames beside a heap arena — clean unwinding, leaked blocks and a use-after-free access.
Array, linked list, stack, queue and binary search tree — one operation trace each, with comparison counts.
Bubble, insertion and selection sort on eight tagged values — comparisons, swaps and inversions.
Two threads share one counter — scheduler slices, a lost-update race and a mutex-protected critical section.
Clients, network delay, a FIFO queue and one worker — queueing latency, server errors and request timeouts.