Please wait
Loading technology simulations
The requested content is still loading.
Please wait
Loading technology simulations
The requested content is still loading.
Interactive laboratory // 55 published
Free interactive CS and technology simulations: algorithms, data structures, machine learning, cryptography, networking, and more. Learn by doing.
Experiment with core AI concepts hands-on in this interactive AI playground. Adjust parameters, observe model behavior, and build intuition for artificial intelligence fundamentals.
Interactive BFS vs DFS simulator. Watch breadth-first and depth-first search explore a graph step by step, with the queue and stack shown as they run.
Compare constant, logarithmic, linear, quadratic, exponential, and factorial growth on an interactive Big-O chart. Change input size and predict which complexity class grows faster.
Interactive binary counter. Watch an animated counter tick up in binary, see each bit flip and its place value, and read the decimal equivalent live.
Build a binary min-heap and watch push bubble up and extract-min sift down, with the tree and its backing array shown together. See why a heap gives O(log n) priority-queue operations.
Interactive binary search simulator: watch LOW, MID, and HIGH pointers halve a sorted array each step and see why it runs in O(log n) comparisons.
Watch values walk down a binary search tree on insert and search, and see why sorted inserts degenerate into an O(n) chain while shuffled inserts stay O(log n). Predict the search path yourself at each node.
Visualize how blockchain works: create blocks, link them with cryptographic hashes, and see what happens when a record is tampered with. Great for students learning distributed ledger technology.
Interactive Bloom filter simulator: add items, watch k hash functions flip bits, and compare measured vs. theoretical false-positive rates in real time.
Watch a finite buffer fill when data arrives faster than it can be processed, and drop packets when it's full — the exact failure that crashed the first ARPANET message in 1969.
Understand cloud computing architecture by simulating virtual machines, load balancers, and auto-scaling. See how cloud services distribute workloads across servers in real time.
Explore computer graphics concepts: apply 2D/3D transformations, experiment with lighting models, and see how rasterization converts geometry into pixels on screen.
Explore the building blocks of computer science: algorithms, data representation, logic gates, and computation models. Interactive visualizations make abstract CS theory tangible.
Learn how computers see: apply edge detection, feature extraction, and object recognition to real images. See the filters and convolutions that power modern computer vision systems.
Interactive Conway's Game of Life. Draw cells or load gliders and blinkers, then press play and watch emergent patterns evolve from four simple rules.
Practice cryptanalysis by attacking substitution ciphers, running frequency analysis, and decoding encoded messages. Understand how classical encryption schemes are mathematically broken.
Learn how cryptography protects data: simulate symmetric encryption, public-key cryptography, and digital signatures. See how keys and algorithms transform plaintext into secure ciphertext.
Explore cybersecurity concepts: simulate network attacks, configure firewalls, and practice identifying vulnerabilities. Build practical intuition for protecting systems and data.
Discover hidden patterns in data with interactive data mining techniques: clustering, classification, and association rule learning. See how algorithms extract actionable knowledge from raw datasets.
Visualize how data structures work: insert, delete, and search in arrays, linked lists, stacks, queues, binary trees, and hash tables. Perfect for CS students mastering core data organization.
See how database indexes speed up queries: visualize B-tree indexes, compare indexed vs full-table scans, and understand how indexes affect insert, update, and delete performance.
Learn how relational database systems manage data: run SQL queries, visualize join operations, and see how ACID transactions maintain consistency under concurrent access.
Watch Dijkstra settle the closest node, relax its edges, and build a shortest-path tree on a weighted graph. See why a priority queue beats scanning, and predict which node gets settled next.
Watch the Levenshtein DP table fill cell by cell with live dependency arrows, trace the optimal alignment path, and test yourself by computing cells from their neighbors.
Interactive floating point simulator showing why 0.1 + 0.2 is not 0.3 in binary. Watch fractions expand bit by bit, spot repeating loops, and shrink rounding error.
Interactive hash collision simulator. Add items to hash buckets and watch collisions appear far sooner than intuition expects — the birthday paradox in action.
Place keys into hash-table buckets and compare separate chaining with linear probing. Change the load factor, predict collisions, and observe how each strategy resolves them.
Watch a domain name resolve step by step through the DNS hierarchy: recursive resolver, root server, TLD server, and authoritative name server — plus the effect of caching.
Send GET, POST, PUT, and DELETE requests and read the raw HTTP response: status codes (200, 404, 301, 500), headers, and body. See how the web works.
Interactive Huffman coding simulator. Build a Huffman tree from letter frequencies and see the optimal variable-length codes that make data compression work.
Interactive logic gates simulator: flip inputs A and B to watch AND, OR, XOR and NAND outputs light up in real time and build the truth table live.
Train and evaluate machine learning models interactively: visualize gradient descent, adjust hyperparameters, and see how supervised learning algorithms fit data in real time.
Simulate mechatronic systems combining mechanical, electrical, and software components: program sensors and actuators, tune PID controllers, and design feedback control loops.
Watch backtracking place and undo queens row by row with attacked squares shaded live, then solve the board yourself. See why pruning turns an exponential search into a few thousand nodes.
See how average queueing delay follows 1/(1−ρ) and shoots toward infinity as offered load approaches a link's capacity — the congestion cliff, plotted and animated.
Explore natural language processing techniques: tokenize text, analyze sentiment, parse syntax trees, and see how machines understand human language step by step.
See data get encapsulated layer by layer through the OSI model — Application to Physical — with each header added and the PDU renamed from Data to Segment to Packet to Frame to Bits.
See why the internet chops messages into packets instead of reserving a line. Compare circuit switching and packet switching, watch link utilization, and find the congestion cliff with statistical multiplexing.
Visualize pathfinding algorithms like A*, Dijkstra's, and BFS on customizable grids. Draw walls, place start and end points, and watch the algorithm explore the shortest route.
Run ping to measure round-trip time and traceroute to reveal every router between you and a host — with TTL, per-hop latency, and min/avg/max RTT.
Explore quantum computing with an interactive qubit simulator: apply quantum gates, visualize superposition and entanglement, and run simple quantum circuits step by step.
Watch the Fibonacci call tree explode under naive recursion, then collapse with memoization. Click any node to light up every place that subproblem is recomputed, and see the call count fall from exponential to linear.
Train a reinforcement learning agent interactively: set up environments, define reward functions, and watch the agent learn an optimal policy through trial and error.
Compare brute-force O(n·k) re-summing with an O(n) sliding-window method. Move the window, inspect entering and leaving values, and measure the reduction in operations.
Watch bubble sort and insertion sort race as animated bars swap in real time. Interactive sorting algorithm visualizer with comparison and swap counters.
Push the same values into a stack and a queue at once and watch LIFO vs FIFO make their outputs diverge. Click the top or front to remove nodes; the lab enforces each structure's one-end access rule.
See why packet switching serves several times more users than circuit switching on the same link. Set capacity, per-user rate, and activity, and watch the multiplexing gain and overflow probability.
See why a router must fully receive a packet before forwarding it, and how pipelining many packets across hops collapses total time from hops × packets to hops + packets − 1.
Free subnetting calculator — enter an IPv4 address and CIDR prefix to instantly see subnet mask, network/broadcast address, usable host range, and binary breakdown.
Watch a backtracking algorithm solve Sudoku cell by cell, placing digits and undoing dead ends, or solve it yourself with live row/column/box conflict detection. See why pruning beats brute force.
Watch a TCP connection open with SYN, SYN-ACK, and ACK, exchange data, and close with FIN/ACK — including sequence numbers and each side's TCP state.
Trace TCP packets through a network: visualize the three-way handshake, inspect packet headers, and see how TCP ensures reliable, ordered delivery of data over the internet.
Build a trie and watch words share prefixes; search walks one node per letter, and autocomplete lights up every word beneath a prefix. See why lookup is O(L), independent of dictionary size.
Interactive Two Sum visualizer: compare brute force, two pointers, and hash map side by side. Watch L and R pointers glide with a live sum readout and see the operation count fall as you pick a better approach.
Click nodes to union sets and watch find() walk to the root. See how naive union builds an O(n) chain while union-by-rank and path compression flatten the forest toward near-constant inverse-Ackermann cost.
Free interactive CS and technology simulations: algorithms, data structures, machine learning, cryptography, networking, and more. Learn by doing.