BETA

Simulations

Step through the algorithms your courses cover instead of just watching them. Every simulation runs entirely in your browser — nothing is uploaded.

41 of 41 live · more landing each week

All courses CSE110 CSE111 CSE221 CSE422 CSE220 CSE370 CSE331 CSE260 CSE320 CSE423

Programming Fundamentals

CSE110 · CSE111

Trace Java line by line — variables, loops, references and objects.

CSE110 · CSE111

Java Code Visualizer

Paste Java and step forward and backward through the call stack, heap and console.

Try simulation

Algorithms

CSE221

Sorting, graph traversal, shortest paths, spanning trees and dynamic programming.

CSE221

Sorting Algorithm Visualizer

Run bubble, selection, insertion, merge and quick sort on the same array and compare their moves.

Try simulation

CSE221

BFS Simulator

Build your own graph, then step through the queue as breadth-first search sweeps it level by level.

Try simulation

CSE221

DFS Simulator

Build your own graph, then follow the stack as depth-first search dives deep and backtracks.

Try simulation

CSE221

Dijkstra's Simulator

Relax edges one at a time and watch the distance table settle into shortest paths.

Try simulation

CSE221

Bellman-Ford Simulator

Repeatedly relax every edge, then catch a negative cycle on the final pass.

Try simulation

CSE221

Prim's MST Simulator

Grow a minimum spanning tree one cheapest frontier edge at a time.

Try simulation

CSE221

Kruskal's MST Simulator

Sort every edge, then add the ones that do not close a cycle — union-find included.

Try simulation

CSE221

Knapsack Simulator

Fill the 0/1 DP table cell by cell, then compare it against the fractional greedy answer.

Try simulation

CSE221 · CSE422

A* Pathfinding Simulator

Compare g, h and f at every expansion to see why A* beats plain Dijkstra on a grid.

Try simulation

Data Structures

CSE220

Abstract data types with their pointers, capacities and edge cases made visible.

CSE220

Stack (ADT) Simulator

Push, pop and peek against a fixed capacity, with overflow and underflow shown explicitly.

Try simulation

CSE220

Queue (ADT) Simulator

Enqueue and dequeue while front and rear move independently down the array.

Try simulation

CSE220

Circular Queue (ADT) Simulator

See exactly when front and rear wrap around, and how full is told apart from empty.

Try simulation

CSE220

Linked List (ADT) Simulator

Insert, delete and traverse while every next pointer is redrawn as it changes.

Try simulation

CSE220

Doubly Linked List Simulator

Track prev and next together through insertion and deletion at both ends.

Try simulation

CSE220

Binary Search Tree Simulator

Insert and delete nodes, then run in-order, pre-order, post-order and level-order traversals.

Try simulation

CSE220

Graph (ADT) Simulator

Place nodes and edges, and watch the adjacency list and adjacency matrix update together.

Try simulation

CSE220 · CSE370

B+ Tree Simulator

Insert, search and delete with node splits and merges animated at each level.

Try simulation

Artificial Intelligence

CSE422

Search, game trees and the arithmetic behind learning.

CSE422

Search Tree Simulator

Compare BFS, DFS, uniform cost and greedy heuristic search on one search tree.

Try simulation

CSE422

Minimax Simulator

Propagate values up a two-player game tree and see which move each level picks.

Try simulation

CSE422

Alpha-Beta Pruning Simulator

Watch alpha and beta tighten and see exactly which branches get cut off, and why.

Try simulation

CSE422

Decision Tree Simulator

Split a small dataset on each feature and compare entropy and information gain.

Try simulation

CSE422

Weight Update Simulator

Step through gradient descent as error and learning rate move each weight.

Try simulation

CSE422

Confusion Matrix Simulator

Move the decision threshold and watch TP, FP, TN, FN, precision and recall react.

Try simulation

Theory of Computation

CSE331

Automata, grammars and machines you can build and run on your own strings.

CSE331

DFA Simulator

Fill in your own transition table, then step a string through it and see it accept or reject.

Try simulation

CSE331

NFA Simulator

Give a cell as many targets as you like, then watch every branch run at once, epsilon moves included.

Try simulation

CSE331

CFG Simulator

Write your own productions and expand the shortest leftmost derivation one step at a time.

Try simulation

CSE331

Pushdown Automaton

An NFA with a stack. Write the rules for aⁿbⁿ and watch the stack do the counting a DFA cannot.

Try simulation

CSE331

Turing Machine Simulator

Write your own transition rules and run the head across the tape one move at a time.

Try simulation

CSE331

NFA → DFA Conversion

Subset construction, one row at a time — the working, not just the answer.

Try simulation

CSE331

DFA Minimization

Split accepting from non-accepting, then refine until no group splits. See which states merge and why.

Try simulation

CSE331

Automaton Design Sandbox

Build a machine and flip it between DFA and NFA rules to see exactly what determinism costs you.

Try simulation

Digital Logic & Number Systems

CSE260

Gates, truth tables, K-maps and base conversion.

CSE260

Logic Gate Circuit Builder

Type a boolean expression and get its truth table, K-map and minimal SOP, derived step by step.

Try simulation

CSE260

Number System Converter

Convert between binary, octal, decimal and hex with every division and remainder shown.

Try simulation

CSE260

Number System Operations

Add, subtract and complement in any base, carries and borrows worked out in place.

Try simulation

Data Communications

CSE320

Turning bits into signals on the wire.

CSE320

Line Coding Visualizer

Type a bit sequence and get oscilloscope waveforms for nine schemes, B8ZS and HDB3 substitutions included.

Try simulation

Computer Graphics

CSE423

Rasterization, clipping and transformation maths on a pixel grid.

CSE423

DDA Line Drawing Simulator

Step through slope, increment and rounding to see which pixel DDA lights up next.

Try simulation

CSE423

Midpoint Line Drawing Simulator

Convert to zone zero, track the decision parameter and plot pixel by pixel.

Try simulation

CSE423

Cohen-Sutherland Clipping

Compute outcodes region by region and clip the line against each window boundary.

Try simulation

CSE423

Cyrus-Beck Clipping

Use boundary normals and t values to classify each intersection as entering or leaving.

Try simulation

CSE423

2D & 3D Transformations

Chain translation, scaling, rotation and shear, and read off the composite matrix.

Try simulation