OpenDSA

Embeddable Exercises/Visualizations

Computational Thinking
Formal Languages
Major Concepts [Preview]
Characterizing a Language, Problem 1 [Preview]
Characterizing a Language, Problem 2 [Preview]
Context-Free Languages [Preview]
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 [Preview]
RemoveUselessCON [Preview]
RemoveLambdaCON [Preview]
RemoveUnitCON [Preview]
ChomskyCON [Preview]
Sheet 1 [Preview]
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 [Preview]
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 [Preview]
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 [Preview]
Sheet 5 Exercise 1 Grammer Exercise 1 [Preview]
Sheet 5 Exercise 1 Grammer Exercise 2 [Preview]
Sheet 6 [Preview]
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 [Preview]
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 [Preview]
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 [Preview]
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 [Preview]
Sheet 5 Grammer Practice 1 [Preview]
Sheet 5 Grammer Practice 2 [Preview]
Intro Exercises [Preview]
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 [Preview]
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 [Preview]
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 [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]
Sheet 7 Exercise 1 Draw a PDA for a language [Preview]
FA Exercise Practice [Preview]
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 [Preview]
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 [Preview]
schematicRepCON [Preview]
schematicORRepCON [Preview]
schematicConcatRepCON [Preview]
schematicStarRepCON [Preview]
RENFAtoDFACON [Preview]
GTGtoNFACON [Preview]
REtoMinimizedDFACON [Preview]
NFAtoRECON [Preview]
Identifying Non-regular Languages [Preview]
Proof 1 Non-Regular Grammar Slideshow [Preview]
Pumping Lemma Slideshow [Preview]
Regular Pumping Lemmma [Preview]
Turing Machines [Preview]
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]
Graphs
Graphs Chapter Introduction [Preview]
Graph Space Requirements Exercise [Preview]
Graph Terminology Summary Exercise [Preview]
Graph Traversals [Preview]
Depth-First Search Slideshow [Preview]
Breadth-First Search Slideshow [Preview]
Intro to Software Design
Getting Started [Preview]
Micro-Worlds [Preview]
Turning Micro-Worlds into Code [Preview]
Programming Concepts [Preview]
Inheritance and Polymorphism: Subclasses and Methods [Preview]
Working with Jeroos [Preview]
Survey Completed [Preview]
Working class hierarchy and inheritance [Preview]
Developing Algorithms [Preview]
Writing Methods [Preview]
Programming Concepts [Preview]
Conditional and Repeating Actions [Preview]
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 [Preview]
Software Testing Concepts [Preview]
Understanding Method Signatures [Preview]
Methods with Parameters [Preview]
Logical Equivalence [Preview]
Module Review [Preview]
Arrays [Preview]
Iterating with Arrays [Preview]
Arrays Review [Preview]
Static, Main, and Exceptions [Preview]
Main Methods [Preview]
The Static Keyword [Preview]
Throwing Exceptions [Preview]
Try/Catch Blocks [Preview]
Linear Structures
Programming Languages
Variations on how Languages Think about Types [Preview]
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]
Syntax of the Lambda Calculus [Preview]
Slideshow for how to build a parse tree [Preview]
Lambda Calc Syntax 1 [Preview]
Lambda Calc Syntax 2 [Preview]
Derivations and Parse Trees [Preview]
parseTree4 [Preview]
Determine Number of nodes [Preview]
String Generated By a Grammar [Preview]
Characterizing a Language, Problem 1 [Preview]
Characterizing a Language, Problem 2 [Preview]
Ambiguous Grammars [Preview]
parseTree5a [Preview]
parseTree5b [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]
Enforcing Order of Operations [Preview]
parseTree3 [Preview]
parseTree3a [Preview]
Evaluating Expression Based on Grammar [Preview]
Associativity [Preview]
Precedence and associativity [Preview]
Characterizing Language 3 [Preview]
Extended BNF [Preview]
List Construction and Deconstruction [Preview]
Using cons [Preview]
Head, Tail, and Cons 1 [Preview]
Head, Tail, and Cons 2 [Preview]
Using isEq test [Preview]
Developing Basic, Recursive List-processing Functions [Preview]
Illustrate Simple Recursion On List To Return Numeric Value [Preview]
Recursion on Flat lists 1 [Preview]
Illustrate Simple Recursion On List To Define IsMember [Preview]
Recursion on Flat Lists 2 [Preview]
Illustrate Simple Recursion On List To Do Substitution [Preview]
Recursion on Flat Lists 3 [Preview]
Recurring On Lists That Aren't Flat [Preview]
Illustrate Deep Recursion On List To Return Numeric Value [Preview]
Deep Recursion 1 [Preview]
Illustrate Deep Recursion On BST [Preview]
Deep Recursion 2 [Preview]
Deep Recursion 3 [Preview]
Deep Recursion 4 [Preview]
Using Helper Functions with Accumulators [Preview]
Illustrate Use of Accumulator in Developing Reverse Function [Preview]
Illustrate Use of Accumulator in Developing Split Function [Preview]
Split and Join with accumulators [Preview]
Using split to define quick sort [Preview]
Accumulator Pattern Practice [Preview]
Scope, Closures, Higher-order Functions, Static vs. Dynamic Binding [Preview]
Illustrate Scope [Preview]
Illustrate Variable Hoisting [Preview]
Illustrate Nested Scopes [Preview]
Illustrate Static vs Dynamic Binding [Preview]
Illustrate Closures [Preview]
Higher Order Function 1 [Preview]
Higher Order Functions 2 [Preview]
Higher Order Functions 3 [Preview]
Static vs. Dynamic Binding [Preview]
Procedural Abstraction: Map, Curry, and Compose [Preview]
Illustrate Mapping Pattern [Preview]
Mapping Pattern [Preview]
Illustrate Function Composition [Preview]
Function Composition [Preview]
Illustrate Currying [Preview]
Curry and compose 1 [Preview]
Curry and compose 2 [Preview]
Procedural Abstraction: The Filtering and Folding (or Reduce) Patterns [Preview]
Illustrate Filtering Pattern [Preview]
Filtering Pattern [Preview]
Illustrate Reduce/Folding Pattern [Preview]
Illustrate ReduceRight Pattern [Preview]
Reducing 1 [Preview]
Reduce and Map [Preview]
Reducing 3 [Preview]
Continuations and Continuation Passing [Preview]
Tail Recursion [Preview]
Illustrate Continuation Passing [Preview]
Compare CPS with non-tail recursive and accumulation [Preview]
CPS Style 1 [Preview]
CPS Style 2 [Preview]
CPS Style 3 [Preview]
Randomized CPS practice [Preview]
Free and Bound Variables [Preview]
Identifying Free Variables [Preview]
Identifying Bound Variables [Preview]
The Substitution-Based Model of Evaluation [Preview]
Identifying Substitution Subcases of Case 1 [Preview]
Identifying Substitution Subcases of Case 2 [Preview]
Identifying Substitution Case 3 [Preview]
Identifying Substitution Cases [Preview]
Performing the full substitution algorithm [Preview]
Beta-Reduction [Preview]
Identifying Beta Redexes 1 [Preview]
Identifying Beta Redexes 2 [Preview]
Performing Beta Reductions [Preview]
Reduction Strategies [Preview]
LCPractice [Preview]
Beta Reduction Order 1 [Preview]
Beta Reduction Order 2 [Preview]
Applicative-order reduction Proficiency Exercise [Preview]
Normal-order reduction Proficiency Exercise [Preview]
Church Numerals and Booleans [Preview]
Church boolean slideshow [Preview]
If Then Else in Church Encoding [Preview]
Church Encoding for OR [Preview]
Church numeral slideshow [Preview]
Church multiplication slideshow [Preview]
Church Numerals [Preview]
Recursive Functions [Preview]
Identifying Fixed Point Combinators [Preview]
Defining SLang 1 [Preview]
SLang 1 Concrete Syntax [Preview]
Slang1 ConcreteSyntax [Preview]
SLang1 AbstractSyntax [Preview]
SLang1 Curry [Preview]
SLang1 Semantics [Preview]
Environment-based Model of Evaluation [Preview]
Determine values bound to a variable in environment [Preview]
Expression Evaluation within Environment [Preview]
Denoted Values in SLang1 [Preview]
Let Expressions [Preview]
Let As Syntactic Sugar [Preview]
Nested Lets [Preview]
Nested Lets with Closures [Preview]
Parameter-Passing Mechanisms [Preview]
Parameter Passing By Value [Preview]
Pass-by-value Proficiency Exercise [Preview]
Parameter Passing By Reference [Preview]
Pass-by-reference Proficiency Exercise [Preview]
Call By Value Vs Reference [Preview]
Parameter Passing By Copy Restore [Preview]
Copy-restore Proficiency Exercise [Preview]
Call By Value vs Reference vs CR [Preview]
Parameter Passing By Macro [Preview]
Macro Proficiency Exercise [Preview]
Ref vs CR vs Macro [Preview]
Parameter Passing By Name [Preview]
Macro Proficiency Exercise [Preview]
CR vs Macro vs Name [Preview]
RP set #31, question #2 [Preview]
Lazy Lists [Preview]
Illustrate Basic Lazy List Operations [Preview]
Illustrate from operation in is module [Preview]
Illustrate map operation in is module [Preview]
Illustrate filter operation in is module [Preview]
Illustrate drop operation in is module [Preview]
Illustrate iterates operation in is module [Preview]
Illustrate sieve of Erastosthenes with eager evaluation [Preview]
Illustrate sieve of Erastosthenes with lazy evaluation [Preview]
Matching sequence to code that produced it [Preview]
RP set #32, question #2 [Preview]
Matching sequence to code that produced it (2) [Preview]
Matching sequence to code that produced it (3) [Preview]
Recursion
Sorting
Sorting Terminology and Notation [Preview]
Sorting Terminology and Notation Slideshow 1 [Preview]
Sorting Intro Summary [Preview]