Simulations (Beta)
Interactive learning tools and practice simulators for Computer Science.
Algorithms
9A* Algorithm
Show pathfinding using cost, heuristic, and total estimated distance.
Try Simulation →
Sorting Algorithm Visualiser
Visualise sorting algorithms
Try Simulation →
BFS (Breadth First Search) Simulator
Build interactive graphs and watch BFS explore networks level-by-level using a visual queue.
Try Simulation →
DFS (Depth First Search) Simulator
Build interactive graphs and watch DFS plunge down deep paths and backtrack using a visual stack.
Try Simulation →
Dijkstra Simulator
Build interactive graphs and watch Dijkstra prioritize the lowest-cost paths to the target using a real-time priority queue.
Try Simulation →
Bellman-Ford Simulator
Build interactive graphs and watch Bellman-Ford algorithm prioritize the lowest-cost paths to the target.
Prim's Simulator
Build interactive graphs and watch Prim's algorithm prioritize the lowest-cost edges to connect all nodes into a Minimum Spanning Tree using a real-time priority queue.
Try Simulation →
Kruskal Simulator
Build interactive graphs and watch Kruskal's algorithm construct a Minimum Spanning Tree by sorting edges from lowest to highest cost and connecting the network while avoiding cycles.
Try Simulation →
Knapsack Simulator
Simulate 0/1 Knapsack using dynamic programming tabulation and Fractional Knapsack using greedy approach.
Try Simulation →
Data Structures
8B+ Tree
Insert, delete, search in a B+ tree visualiser
Try Simulation →
Stack (ADT) Simulator
Visualise push, pop, overflow, and underflow operations
Try Simulation →
Queue (ADT) Simulator
Show enqueue, dequeue, front, rear, overflow, and underflow.
Try Simulation →
Circular Queue (ADT) Simulator
Demonstrate wrap-around movement of front and rear pointers.
Try Simulation →
Linked List (ADT) Simulator
Show insertion, deletion, traversal, and pointer changes.
Doubly Linked List (ADT) Simulator
Visualize previous and next pointer changes during operations.
Graph (ADT) Simulator
Allow users to create nodes and edges and view adjacency lists/matrices.
Binary Tree (ADT) Simulator
Show tree insertion, traversal, height, and leaf nodes.
Artificial Intelligence
6Search Tree Simulator
Show BFS, DFS, uniform cost search, and heuristic search.
Minimax Algorithm
Show game tree evaluation for two-player games.
Try Simulation →
Alpha-Beta Pruning Simulator
Show branches skipped during minimax optimization.
Try Simulation →
Weight Update Simulator
Show how weights change using error and learning rate.
Confusion Matrix Simulator
Show TP, FP, TN, FN, precision, recall, and accuracy.
Transformer Attention Simulator
Show query, key, value, attention scores, and weighted output.
Logic Gates
1Theory of Computation: Automata and Computability
5DFA Simulator
Build, edit, and simulate strings in a DFA visualizer
Try Simulation →
State Transition Diagram
Create, edit, and test state machines interactively.
Try Simulation →
CFG (Context Free Grammar) Simulator
Interactive Context-Free Grammar parser and derivation visualizer
Try Simulation →
NFA Simulator
Build, edit, and simulate strings in an NFA visualizer
Try Simulation →
TM (Turing Machine) Simulator
Design, edit, and run computations in an interactive Turing Machine simulator
Try Simulation →
Number Systems
2Number System Converter
Convert between binary, decimal, hex, octal
Try Simulation →
Number System Operations
Operations on number systems