OpenDSA

Embeddable Exercises/Visualizations

Algorithm Analysis
Calculating Program Running Time
Binary Search Algorithm Slideshow [Preview]
Binary Search Proficiency Exercise [Preview]
Binary Search recurrence slideshow [Preview]
Program Code Analysis Exercise [Preview]
Problems, Algorithms, and Programs
Problem, Algorithm, and Program definitions Slideshow [Preview]
Problems, Algorithms, Programs Exercise [Preview]
Comparing Algorithms
Comparing Growth Rates Exercise [Preview]
Growth Rates Ordering Exercise [Preview]
Best, Worst, and Average Cases
Simple analysis cases slideshow [Preview]
Best, Worst, and Average cases slideshow [Preview]
Faster Computer, or Faster Algorithm?
Faster Computer or Faster Algorithm Exercise [Preview]
Asymptotic Analysis and Upper Bounds
Upper Bounds visualization [Preview]
Asymptotic Analysis and Upper Bounds Exercise [Preview]
Lower Bounds and Theta Notation
Lower Bounds visualization [Preview]
Lower Bounds and Theta Notation Exercise [Preview]
Analyzing Problems
Problem Analysis Exercise [Preview]
Common Misunderstandings
Example's graph Visualization [Preview]
Common Misconceptions Exercise [Preview]
Algorithm Analysis Summary Exercises
Algorithm Analysis Summary Questions [Preview]
Algorithm Analysis Summary Exercises
Algorithm Analysis Summary Questions [Preview]
Advanced Analysis
Solving Recurrence Relations
Divide-and-Conquer Expansion Slideshow [Preview]
Divide-and-Conquer Expansion Slideshow2 [Preview]
The Transformation Concept
fft slideshow 1 polynomial [Preview]
fft slideshow 2 evaluation and interpolation [Preview]
fft slideshow 3 polynomial product [Preview]
fft slideshow 4 evaluation of polynomial product [Preview]
Polynomial_multiplication [Preview]
The Fast Fourier Transform
fft slideshow 1 even and odd polynomials [Preview]
Nth_root [Preview]
fft slideshow 4 DFT matrix [Preview]
DFT matrix properties [Preview]
fft slideshow 6 FFT procedure [Preview]
Introduction and Mathematical Background
Data Structures and Algorithms
Introduction Summary Questions [Preview]
Sets and Relations
Relations Exercise [Preview]
Equivalence Exercise [Preview]
PartialOrder Exercise [Preview]
Logarithms
Logarithms Practice Questions [Preview]
Recurrence Relations
Linear Recurrences Slideshow [Preview]
Linear Recurrences Slideshow (n) [Preview]
Chapter Summary Questions
Math Background Summary Questions [Preview]
Summations
Summation of the first N Integers visualization [Preview]
Summation Two Power I visualization [Preview]
Mathematical Proof Techniques
Two Coloring Proof Slideshow [Preview]
Binary Trees
Binary Tree as a Recursive Data Structure
Sum values in a Binary Tree Slide Show [Preview]
Binary Tree Traversals
Preorder Traversal Slideshow [Preview]
Postorder Traversal Slideshow [Preview]
Inorder Traversal Slideshow [Preview]
Binary Tree Preorder Traversal Exercise [Preview]
Binary Tree Postorder Traversal Exercise [Preview]
Binary Tree Inorder Traversal Exercise [Preview]
Tree Traversal Summary Questions [Preview]
Binary Tree Node Implementations
Expression Tree Traversal Slideshow [Preview]
Binary Search Trees
BST Search Slideshow [Preview]
BST Search Proficiency Exercise [Preview]
BST Insert Slideshow [Preview]
BST Insert Proficiency Exercise [Preview]
BST deletemax Slideshow [Preview]
BST remove Slideshow [Preview]
BST Remove Proficiency Exercise [Preview]
BST Question Summary [Preview]
Heaps and Priority Queues
Heap insert Slideshow [Preview]
Heap Insert Proficiency Exercise [Preview]
Heap Build Choices [Preview]
Heapbuild Slideshow [Preview]
Heap Build Proficiency Exercise [Preview]
Heap build analysis proof Slideshow [Preview]
Remove Max Slideshow [Preview]
Heap Remove Exercise [Preview]
Remove Any Slideshow [Preview]
Heap Question Summary [Preview]
Huffman Coding Trees
Huffman Coding Tree Slideshow: Build [Preview]
Huffman Coding Tree Slideshow: Label Edges [Preview]
Huffman Coding Tree Slideshow: Setting Codes [Preview]
Huffman Coding Tree Slideshow: Decoding [Preview]
Huffman Decoding Proficiency Exercise [Preview]
huffmanCustomBuildAV [Preview]
Trees versus Tries
Tree timeline Slideshow [Preview]
Trie timeline Slideshow [Preview]
Binary Trees
Tree Definition Summary Exercises [Preview]
Tree/Node Exercises [Preview]
Binary Trees Recursion
Information Flow in Recursive Functions
Binary Tree Common Mistakes Slideshow [Preview]
Binary Tree Guided Information Flow
Inefficient Binary Tree Traversal on Range Slide Show [Preview]
Computational Thinking
Classwork 8
Iteration Khan Exercise [Preview]
Homework 8
Iteration Exercise JSAV [Preview]
Design
Design Patterns
Design Patterns Summary Exercise [Preview]
Comparing Records
Record Comparison Summary Exercise [Preview]
The Dictionary ADT
Dictionary Summary Exercise [Preview]
Abstract Data Types
Concept map data types exercises [Preview]
ADT Summary Questions [Preview]
File Processing
Buffer Pools
Buffer Pool Introduction Slideshow [Preview]
LRU Replacement Slideshow [Preview]
LRU Replacement with write Slideshow [Preview]
Buffer Pool Visualization [Preview]
External Sorting
External Merge Sort Slideshow [Preview]
External Merge Sort Example Slideshow [Preview]
External Replacement Selection Slideshow [Preview]
Replacement Selection Proficiency Exercise [Preview]
Multiway Merge Example Slideshow [Preview]
Multi-way Merge Proficiency Exercise [Preview]
Formal Languages
Major Concepts
Characterizing a Language, Problem 1 [Preview]
Characterizing a Language, Problem 2 [Preview]
Deterministic Finite Acceptors
Machine Trace Slideshow [Preview]
TraceEvenBinaryDFACON [Preview]
Regular Grammars
REtoFACON [Preview]
FAtoRegGrammmarCON [Preview]
Context-Free Languages
ParseTree1CON [Preview]
Determine Number of nodes [Preview]
String Generated By a Grammar [Preview]
Number Of Parse Trees, Problem 1 [Preview]
Number Of Parse Trees, Problem 2 [Preview]
Number Of Parse Trees, Problem 3 [Preview]
Determining Ambiguities [Preview]
Evaluating Expression Based on Grammar [Preview]
ParseTreeForExpCON [Preview]
Associativity [Preview]
Precedence and associativity [Preview]
Characterizing Language 3 [Preview]
Extended BNF [Preview]
Transforming Grammars
RemoveUselessCON [Preview]
RemoveLambdaCON [Preview]
RemoveUnitCON [Preview]
ChomskyCON [Preview]
Sheet 1
Sheet 1 Exercise 1 [Preview]
Sheet 1 Exercise 2 [Preview]
Sheet 1 Exercise 3 [Preview]
Sheet 1 Exercise 4 [Preview]
Sheet 1 Exercise 5 [Preview]
Sheet 1 Exercise 6 [Preview]
Sheet 1 Exercise 7 [Preview]
Sheet 2
Sheet 2 Exercise 1 NFAtoDFA exercise [Preview]
Sheet 1 Exercise 2 DFA minimization [Preview]
Sheet 2 Exercise 3 Construct DFA that accepts a language [Preview]
Sheet 2 Exercise 4 onstruct the NFA that accepts a language [Preview]
Sheet 3
Sheet 3 Exercise 1 Regular Expressions Exercise [Preview]
Sheet 3 Exercise 1 Regular Expressions Exercise [Preview]
Sheet 3 Exercise 1 Regular Expressions Exercise [Preview]
Sheet 3 Exercise 4 Give a left-linear grammar for the following an NFA [Preview]
Sheet 3 Exercise 5 Give a left-linear grammar for a language [Preview]
Sheet 3 Exercise 6 Find a regular grammar for a language [Preview]
Sheet 5
Sheet 5 Exercise 1 Grammer Exercise 1 [Preview]
Sheet 5 Exercise 1 Grammer Exercise 2 [Preview]
Sheet 6
Sheet 6 Exercise 1 Draw a DFA for a language [Preview]
Sheet 6 Exercise 1 Grammer Exercise 1 [Preview]
Sheet 6 Exercise 1 Grammer Exercise 2 [Preview]
Sheet 6 Exercise 1 Grammer Exercise 2 [Preview]
Sheet 1
Sheet 1 Practice Exercise 1 Draw a FA for a language [Preview]
Sheet 1 Practice Exercise 2 Draw a FA for a language [Preview]
Sheet 1 Practice Exercise 3 Draw a FA for a language [Preview]
Sheet 1 Exercise 4 Draw a FA for a language [Preview]
Sheet 1 Practice Exercise 5 write a grammar for a language [Preview]
Sheet 1 Practice Exercise 6 write a grammar for a language [Preview]
Sheet 1 Practice Exercise 7 write a grammar for a language [Preview]
Sheet 2 Practice
Sheet 2 Practice 1 NFAtoDFA Practice [Preview]
Sheet 1 Exercise 2 DFA minimization Practice [Preview]
Sheet 2 Practice 3 Construct DFA that accepts a language [Preview]
Sheet 2 Practice 4 Construct the NFA that accepts a language [Preview]
Sheet 3 Practice
Sheet 3 Practice 1 Regular Expressions Practice [Preview]
Sheet 3 Practice 2 Regular Expressions Practice [Preview]
Sheet 3 Practice 3 Regular Expressions Practice [Preview]
Sheet 3 Practice 4 Give a left-linear grammar for the following an NFA [Preview]
Sheet 3 Practice 5 Give a left-linear grammar for a language [Preview]
Sheet 3 Practice 6 Find a regular grammar for a language [Preview]
Sheet 5 Practice
Sheet 5 Grammer Practice 1 [Preview]
Sheet 5 Grammer Practice 2 [Preview]
Intro Exercises
Three string grammar [Preview]
anbm grammar [Preview]
anb2n grammar [Preview]
Odd number of a's [Preview]
Odd number of a's, even number of b's [Preview]
Odd number of a's, at most 3 b's [Preview]
No string with 3 consecutive a's [Preview]
FA Exercises
NFAtoDFA exercise 1 long version [Preview]
Sheet 1 Exercise 2 DFA minimization [Preview]
Sheet 2 Exercise 3 Construct DFA that accepts a language [Preview]
Create a NFA 1 [Preview]
Regular Language Exercises
Regular Expression construction: bba in even position [Preview]
Regular Expression construction: no aa [Preview]
Regular Expression construction: one bbb [Preview]
Regular Grammar: right-linear grammar for NFA [Preview]
Regular Grammar: left-linear grammar for bbbsaaaas [Preview]
Regular Grammar: regular grammar for a divisible by 3 [Preview]
Sheet 7
Sheet 7 Exercise 1 Draw a PDA for a language [Preview]
Sheet 7 Exercise 1 Draw a PDA for a language [Preview]
Sheet 7 Exercise 1 Draw a PDA for a language [Preview]
Sheet 7 Exercise 1 Draw a PDA for a language [Preview]
FA Exercise Practice
DFA exercise even a [Preview]
DFA exercise even a odd b [Preview]
DFA exercise even a min 3 b [Preview]
DFA exercise both even or odd [Preview]
NFAtoDFA exercise 2 [Preview]
Create a NFA 2 [Preview]
Regular Language Exercise Practice
Regular Expression construction: a divisible by 3 [Preview]
Regular Grammar: left-linear grammar for NFA [Preview]
Regular Grammar: left-linear grammar for aaabsbas [Preview]
Regular Grammar: regular grammar for anbm odd length [Preview]
Regular Expressions
schematicRepCON [Preview]
schematicORRepCON [Preview]
schematicConcatRepCON [Preview]
schematicStarRepCON [Preview]
RENFAtoDFACON [Preview]
GTGtoNFACON [Preview]
REtoMinimizedDFACON [Preview]
NFAtoRECON [Preview]
Identifying Non-regular Languages
Proof 1 Non-Regular Grammar Slideshow [Preview]
Pumping Lemma Slideshow [Preview]
Regular Pumping Lemmma [Preview]
Turing Machines
Turing Machine RClear center [Preview]
Sheet 2 Exercise 1 NFAtoDFA exercise [Preview]
Sheet 2 Exercise 1 NFAtoDFA exercise [Preview]
Sheet 2 Exercise 1 NFAtoDFA exercise [Preview]
Turing Machine Replace center [Preview]
TManbncnCON [Preview]
General Trees
General Trees
General Tree Preorder Traversal Slideshow [Preview]
General Tree Postorder Traversal Slideshow [Preview]
Union/Find and the Parent Pointer Implementation
Union/Find Example [Preview]
Union/Find Path Compression Example [Preview]
Union/Find Proficiency Exercise [Preview]
Sequential Tree Representations
First sequential representation Slideshow [Preview]
First Sequential Representation Exercise [Preview]
Second sequential representation Slideshow [Preview]
Alternate Sequential Representation Exercise [Preview]
Bit vector sequential representation Slideshow [Preview]
Bit Vector Sequential Representation Exercise [Preview]
General Tree sequential representation Slideshow [Preview]
General Tree Sequential Representation Exercise [Preview]
Graphs
Graphs Chapter Introduction
Graph Space Requirements Exercise [Preview]
Graph Terminology Summary Exercise [Preview]
Graph Traversals
Depth-First Search Slideshow [Preview]
DFS Proficiency Exercise [Preview]
Breadth-First Search Slideshow [Preview]
BFS Proficiency Exercise [Preview]
Topological Sort
TopSort Slideshow [Preview]
topSortQCON Slideshow [Preview]
Shortest-Paths Problems
Dijkstra's Algorithm Proficiency Exercise [Preview]
Minimal Cost Spanning Trees
Prim's Minimum Cost Spanning Tree Algorithm Slideshow [Preview]
Prim's Algorithm Proficiency Exercise [Preview]
Kruskal's Algorithm
Kruskal Slideshow [Preview]
Kruskal's Algorithm Proficiency Exercise [Preview]
Hashing
Introduction
Hashing Intro Slideshow [Preview]
Hash Function Principles
Birthday Problem Calculator [Preview]
Birthday Problem Exercise [Preview]
Sample Hash Functions
Hash Function Slideshow 1 [Preview]
Hash Function Slideshow 2 [Preview]
Mid-Square Calculator [Preview]
Simple String Folding Calculator [Preview]
Improved String Folding Calculator [Preview]
Hash Function Pick Slot Summary [Preview]
Hash Function Summary Exercise [Preview]
Open Hashing
Open Hashing Proficiency Exercise [Preview]
Bucket Hashing
Bucket Hashing Slideshow 1 [Preview]
Bucket Hashing Proficiency Exercise [Preview]
Bucket Hashing Slideshow 2 [Preview]
Alternate Bucket Hashing Proficiency Exercise [Preview]
Improved Collision Resolution
Linear Probing By Steps Slideshow 1 [Preview]
Linear Probing By Steps Slideshow 2 [Preview]
Linear Probing By Steps Proficiency Exercise [Preview]
Pseudo-Random Probing Slideshow [Preview]
Pseudo-Random Probing Proficiency Exercise [Preview]
Avoiding the Train [Preview]
Quadratic Probing Slideshow [Preview]
Quadratic Probing Proficiency Exercise [Preview]
Quadratic Probing Problem [Preview]
Double Hashing Slideshow 2 [Preview]
Double Hashing Slideshow 3 [Preview]
Double Hashing Proficiency Exercise [Preview]
Analysis of Closed Hashing
Analysis of Closed Hashing Summary Exercise [Preview]
Deletion
Hash Deletion Slideshow [Preview]
Hash Deletion Proficiency Exercise [Preview]
Hash Deletion Summary Exercise [Preview]
Hashing Chapter Summary Exercises
Hashing Chapter Summary Exercise [Preview]
Collision Resolution
Linear Probing Slideshow 1 [Preview]
Linear Probing Slideshow 2 [Preview]
Linear Probing Proficiency Exercise [Preview]
Indexing
Linear Indexing
Simple linear index Slideshow [Preview]
Two-level linear index Slideshow [Preview]
Linear Indexing Proficiency Exercise [Preview]
Tree-based Indexing
Paged BST Slideshow [Preview]
Paged BST With Disk Accesses Slideshow [Preview]
Tree Indexing Proficiency Exercise [Preview]
2-3 Trees
2-3 Tree Insert Slideshow [Preview]
2-3 Tree Insert Promotion Slideshow [Preview]
2-3 Tree Insert Split Slideshow [Preview]
B-Trees
TTPbuildCON [Preview]
TTPfindCON [Preview]
TTPdeleteCON [Preview]
BPfindCON [Preview]
BPbuildCON [Preview]
B+ Tree Proficiency Exercise [Preview]
BPdeleteCON [Preview]
BPbuild5CON [Preview]
Intro to Software Design
Getting Started
Micro-Worlds [Preview]
Turning Micro-Worlds into Code [Preview]
Programming Concepts [Preview]
Inheritance and Polymorphism: Subclasses and Methods
Working with Jeroos [Preview]
Working class hierarchy and inheritance [Preview]
Developing Algorithms [Preview]
Writing Methods [Preview]
Programming Concepts [Preview]
Conditional and Repeating Actions
Working with If-Then-Else Statements [Preview]
Working with If-Then Statements [Preview]
Deciding When to Use Each Type of Structure [Preview]
AND, OR, and NOT [Preview]
Working with While Loops [Preview]
Programming Concepts [Preview]
Software Testing
Software Testing Concepts [Preview]
Understanding Method Signatures [Preview]
Methods with Parameters [Preview]
Logical Equivalence [Preview]
Module Review [Preview]
Arrays
Iterating with Arrays [Preview]
Arrays Review [Preview]
Multi-dimensional Arrays
2D Arrays [Preview]
Iterating with 2D Arrays [Preview]
Modulus [Preview]
Static, Main, and Exceptions
Main Methods [Preview]
The Static Keyword [Preview]
Throwing Exceptions [Preview]
Try/Catch Blocks [Preview]
Limits to Computing
Reductions
Sorting Problem [Preview]
Pair to Sorting Reduction Slideshow [Preview]
Sorting to Pairing Reduction Slideshow [Preview]
Matrix Multiplication [Preview]
3-CNF Satisfiability
3-Satisfiability [Preview]
Practice Exercise for 3-SAT [Preview]
The Clique Problem
Practice Exercise for Clique [Preview]
The Independent Set Problem
Independent Set [Preview]
Practice Exercise for Independent Set [Preview]
The Vertex Cover Problem
Vertex Cover [Preview]
Practice Exercise for Vertex Cover [Preview]
The Hamiltonian Cycle Problem
Hamiltonian Cycle [Preview]
Practice Exercise for Hamiltonian Cycle [Preview]
The Traveling Salesman Problem
Traveling Salesman [Preview]
Practice Exercise for Traveling Salesman Problem [Preview]
Linear Structures
Array-Based List Implementation
Array-based List Variables Slideshow [Preview]
Array-based List Intro Slideshow [Preview]
Array-based List Insertion Slideshow [Preview]
Array-based List Insert Exercise [Preview]
Array-based List Append Slideshow [Preview]
Array-based List Remove [Preview]
Array-based List Remove Exercise [Preview]
Array-based List Summary [Preview]
Linked Lists
Linked List Slideshow 1 [Preview]
Linked List Slideshow 2 [Preview]
Linked List Variables Slideshow [Preview]
Linked List Constructors Slideshow [Preview]
Linked List Insert Slideshow [Preview]
Linked List Special Insert Slideshow [Preview]
Linked List Insert Exercise [Preview]
Linked List Remove Slideshow [Preview]
Linked List Remove Exercise [Preview]
Linked List Position Slideshow [Preview]
Comparison of List Implementations
Breakeven Point Exercise [Preview]
Linked List Summary Exercise [Preview]
Doubly Linked Lists
Doubly Linked List Insert [Preview]
Doubly Linked List Append [Preview]
Doubly Linked List Remove [Preview]
Doubly Linked List Prev [Preview]
List Element Implementations
List Element Data [Preview]
List Element Type [Preview]
List Element Delete [Preview]
List Summary Questions [Preview]
Stacks
Array stack variables slideshow [Preview]
Array stack top position slideshow [Preview]
Array stack push slideshow [Preview]
Array-based Stack Push Exercise [Preview]
Array stack pop slideshow [Preview]
Array-based Stack Pop Exercise [Preview]
Linked Stacks
Linked stack push [Preview]
Linked Stack Push Exercise [Preview]
Linked stack pop [Preview]
Linked Stack Pop Exercise [Preview]
Freelists
Freelist Slideshow 1 [Preview]
Queues
Array-based Queue Positions Slideshow [Preview]
Array-based Queue Drift Slideshow [Preview]
Array-based Queue Bad Representation Slideshow [Preview]
Circular Array-based Queue Slideshow [Preview]
Empty Circular Array-based Queue Slideshow [Preview]
Array-based Queue Variables Slideshow [Preview]
Array-based Queue Enqueue Exercise [Preview]
Array-based Queue Dequeue Exercise [Preview]
Linked Queues
Linked Queue Intro [Preview]
Linked Queue Enqueue [Preview]
Linked Queue Enqueue Exercise [Preview]
Linked Queue Dequeue [Preview]
Linked Queue Dequeue Exercise [Preview]
Stack/Queue Summary Exercise [Preview]
Linear Structure Summary Exercises
List Data Structures General Questions [Preview]
List Chapter Summary [Preview]
The List ADT
List ADT Positions Slideshow [Preview]
Memory Management
Pointers in Java
Basic References Part 2
Pointer Exercise 1 [Preview]
Shallow Deep Copy Slideshow [Preview]
Pointer Exercise 2 [Preview]
Local Memory
simpleLifetimeCON [Preview]
T1-T5CON [Preview]
Heap Memory
garbageDisposalCON [Preview]
LocalHeapintptr42 [Preview]
Link Nodes
linkNodes1CON [Preview]
linkNodes2CON [Preview]
Pointer Exercise 3 [Preview]
Pointers Syntax
employeePtr2CON [Preview]
examplePointerCodeCON [Preview]
Programming Languages
Variations on how Languages Think about Types
ML type inferencing 1 [Preview]
ML type inferencing 2 [Preview]
ML type inferencing 3 [Preview]
ML type inferencing 4 [Preview]
ML type inferencing 5 [Preview]
ML type inferencing 6 [Preview]
Ambiguous Grammars
parseTree5a [Preview]
parseTree5b [Preview]
Number Of Parse Trees, Problem 1 [Preview]
Number Of Parse Trees, Problem 2 [Preview]
Number Of Parse Trees, Problem 3