Popular simulators and calculators
Jump straight to what you are studying. Every page explains the concept, shows the formulas and lets you try your own inputs.
Computer Networks
Delays, switching, packet flow and congestion — with the real formulas. View all →
Transmission Delay
How long a router needs to push every bit of a packet onto the link.
Open simulation →Propagation Delay
How long a signal takes to travel along the physical link.
Open simulation →Processing Delay
The time a router spends inspecting a packet and choosing its next hop.
Open simulation →Queuing Delay
Packets waiting in line for the outgoing link — and why traffic intensity matters.
Open simulation →Packet Switching
Split a message into packets and pipeline them across store-and-forward links.
Open simulation →Circuit Switching
Reserve a dedicated circuit first, then send — and compare with packet switching.
Open simulation →Data Transmission & Packet Flow
Follow packets across routers and see every part of the nodal delay.
Open simulation →Network Congestion
TCP's congestion window growing, overflowing the bottleneck and backing off.
Open simulation →Operating Systems
Scheduling, process states, deadlock, memory and page replacement. View all →
CPU Process Scheduling
FCFS, SJF, SRTF, Round Robin and Priority — with waiting and turnaround times.
Open simulation →Gantt Chart Visualization
Build the schedule on a timeline, process by process, and compare algorithms.
Open simulation →Process States
New → Ready → Running → Waiting → Terminated, with several processes at once.
Open simulation →Context Switching
Save one process's state, load another's — and the overhead it costs.
Open simulation →Deadlock
Banker's safety algorithm and deadlock detection, step by step.
Open simulation →Memory Management
First/Best/Worst fit allocation and paging address translation.
Open simulation →Page Replacement Algorithms
FIFO, LRU and Optimal — page faults, hits and the victim chosen each time.
Open simulation →Sorting Algorithms
Watch six classic sorts compare, swap and merge, step by step. View all →
Bubble Sort
Repeatedly swap neighbouring items that are out of order.
Open simulation →Selection Sort
Pick the smallest remaining item and put it in place.
Open simulation →Insertion Sort
Insert each item into its place in the sorted part, like sorting cards.
Open simulation →Merge Sort
Divide the list in halves, sort each, then merge them.
Open simulation →Quick Sort
Partition around a pivot, then sort each side.
Open simulation →Heap Sort
Build a max-heap, then repeatedly pull out the largest item.
Open simulation →Searching Algorithms
See how linear and binary search narrow down the answer. View all →
AI Search Algorithms
Build your own graph and watch BFS, DFS, UCS, A*, hill climbing and more find a path. View all →
Breadth-First Search (BFS)
Explore level by level, shallowest nodes first.
Open simulation →Depth-First Search (DFS)
Dive deep first, back up only at dead ends.
Open simulation →Uniform-Cost Search (UCS)
Always expand the cheapest path so far — guarantees the lowest cost.
Open simulation →Best-First Search
Expand the node with the best evaluation f(n) — you choose f.
Open simulation →Greedy Best-First Search
Chase the node that looks closest to the goal — fast, but not always best.
Open simulation →A* Search
Cost so far plus estimated cost to go — optimal with a good heuristic.
Open simulation →Hill Climbing
Always step to the best neighbour — and sometimes get stuck.
Open simulation →Iterative Deepening DFS (IDDFS)
Repeat DFS with growing depth limits: BFS's answer with DFS's memory.
Open simulation →Bidirectional Search
Search from both ends and meet in the middle.
Open simulation →Beam Search
Breadth-first, but keep only the k best nodes at each level.
Open simulation →Search Algorithm Comparison
Run all ten algorithms on your graph and compare them side by side.
Open simulation →