Data structures
Which sort finishes first?
Race seven algorithms on the same array and compare their work.
Try the sorting raceComputer science & electronics
From sorting races to cache hits, explore how things work through interactive experiments.
Browse all lessonsData structures
Race seven algorithms on the same array and compare their work.
Try the sorting raceComputer architecture
Switch mappings to see why some accesses hit and others miss.
Explore cache mappingDatabases
Interleave transactions and compare what each isolation level reveals.
Explore transactionsApplications covers connected components and shortest paths. Advanced combines distances and scheduling in an evacuation problem. Each guide includes the original problem link, an interactive experiment, and solution code.
Follow instruction execution, pipelines, caches, and virtual memory.
Applications covers sorting, searching, ranges, trees, and hashing. Advanced covers divide and conquer, heaps, and shortest paths.
Explore indexes, JOINs, normalization, and transaction isolation with interactive examples.
Build intuition for digital circuits with adders, memory, and ring oscillators.
Explore serial communication, PWM, sampling, and error detection.
Experiment with CPU scheduling, memory management, and synchronization.
These simulations model concepts for learning. Check the conditions and explanations on each page.
Explore my embedded systems and IoT research, development experience, and programs.