Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Programmed Instruction: Non-Deterministic Finite Automata Programmed Instruction Programmed Instruction Frameset introducing the concept of non-determinism and the NFA. OpenDSA Deterministic Finite Automata
2 Regular Grammar Exercise: NFA conversion RegEx Writing Exercise User writes a regular grammar equivalent to a given NFA: Exercise 1. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
3 Regular Grammar Exercise: NFA Conversion 2 Grammar Construction Exercise User writes a regular grammar equivalent to a given NFA: Exercise 2. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
4 Regular Grammar Exercise: NFA Conversion to Right Regular Grammar Grammar Construction Exercise User writes a right regular grammar equivalent to a given NFA: Exercise 2. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
5 NFA Conversion to Regular Expression Example Programmed Instruction Programmed Instruction Frameset presenting an example of converting a NFA to an equivalent Regular Expression. OpenDSA Regular Expression, Non-Deterministic Finite Automata
6 Converting NFAs to Regular Grammars Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a NFA to an equivalent regular grammar. OpenDSA Regular Grammar, Regular Language, Non-Deterministic Finite Automata
7 Regular Expressions Equivalent to NFA: Part 1 Programmed Instruction Programmed Instruction Frameset presenting Part 1 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. OpenDSA Regular Expression, Non-Deterministic Finite Automata
8 Regular Expressions Equivalent to NFA: Part 3: Concatenate Programmed Instruction Programmed Instruction Frameset presenting Part 3 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Concatenating... OpenDSA Regular Expression, Non-Deterministic Finite Automata
9 Regular Expressions Equivalent to NFA: Example Programmed Instruction Programmed Instruction Frameset presenting examples of converting a Regular Expression to an equivalend NFA. OpenDSA Regular Expression, Non-Deterministic Finite Automata
10 Regular Expressions Equivalent to NFA: Part 2: Or Programmed Instruction Programmed Instruction Frameset presenting Part 2 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Or'ing... OpenDSA Regular Expression, Non-Deterministic Finite Automata
11 Regular Expressions Equivalent to NFA: Part 4: Star Programmed Instruction Programmed Instruction Frameset presenting Part 4 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Kleene... OpenDSA Regular Expression, Non-Deterministic Finite Automata
12 Converting Regular Grammars to NFAs Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular grammar to an equivalent NFA. OpenDSA Regular Grammar, Regular Language, Non-Deterministic Finite Automata
13 Regular Expression to Minimized DFA Example Algorithm Visualization Visualization presenting examples of converting a Regular Expression to an equivalend NFA. OpenDSA Regular Expression, Non-Deterministic Finite Automata
14 Deterministic vs Nondeterministic PDAs Programmed Instruction Programmed Instruction Frameset discussing the differences between deterministic and non-deterministic PDAs. OpenDSA Pushdown Automata
15 Closure Properties to Show a Language Non-Regular: Example 1 Programmed Instruction, Proof Visualization Programmed Instruction slideshow demonstrating an example of using closure properties to prove a language non-regular. Language: a^n b^m a^m. OpenDSA Non-Regular Language, Closure Property
16 Closure Properties to Show a Language Non-Regular: Example 2 Programmed Instruction, Proof Visualization Programmed Instruction slideshow demonstrating an example of using closure properties to prove a language non-regular. Example 2. OpenDSA Non-Regular Language, Closure Property
17 Closure Properties to Show a Language Non-Regular Programmed Instruction, Proof Visualization Programmed Instruction slideshow introducing the concept of using closure properties to prove a language non-regular. OpenDSA Non-Regular Language, Closure Property
18 Introduction to the Concept of a Non-Regular Language Programmed Instruction Programmed Instruction slideshow introducing the concept of a non-regular language and ideas for how to recognize one. OpenDSA Non-Regular Language
19 Functional Programming: CPS vs non-tail recursion Algorithm Visualization, Code Tracing Presentation Slideshow comparing continuation passing with non-tail recursion and accumulation. OpenDSA Functional Programming
20 Given a list of integers, return the product of all non-zero elements. Code Completion Given a list of integers, return the product of all non-zero elements. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
21 Introduction to the Concept of the Pumping Lemma Programmed Instruction Programmed Instruction slideshow introducing the concept of a the pumping lemma for regular languages. OpenDSA Non-Regular Language
22 Pumping Lemma Example: Harder Proof Programmed Instruction, Proof Visualization Programmed Instruction slideshow showing the harder pumping lemma proof where there are multiple cases to consider. OpenDSA Non-Regular Language
23 Pumping Lemma Example: a^n b^n Programmed Instruction, Proof Visualization Programmed Instruction slideshow showing the pumping lemma proof that the language a^n b^n is not regular. OpenDSA Non-Regular Language
24 Pumping Lemma Example: wwR Programmed Instruction, Proof Visualization Programmed Instruction slideshow showing the pumping lemma proof that the language consisting of a string w followed by the reverse... OpenDSA Non-Regular Language
25 Introduction to the Pumping Lemma Proof Visualization Introduction to the Pumping Lemma for regular languages. Includes a visualization for how this works. OpenDSA Pumping Lemma, Non-Regular Language
26 Pumping Lemma Slideshow Proof Visualization Simple demonstration of a Pumping Lemma proof to show that a language is not regular. OpenDSA Pumping Lemma, Non-Regular Language
27 List Element Type Slideshow Algorithm Visualization Slideshow illustrating the choice between storing non-homogeneous data types in list nodes and limiting to a homogenous data type. OpenDSA List Element Implementation
28 Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... PCEX
29 Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers. Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... PCEX
30 Calculating the Average of Floating-Point Numbers Construct a program that reads a series of non-negative floating-point numbers from the user, sums them up, and calculate their... PCEX
31 Calculating the Average of Floating-Point Numbers. Construct a program that reads a series of non-negative floating-point numbers from the user, sums them up, and calculate their... PCEX
32 Calculating the Average of Floating-Point Numbers Construct a program that reads a series of non-negative floating-point numbers from the user, sums them up, and calculate their... PCEX
33 Calculating the Average of Floating-Point Numbers Construct a program that reads a series of non-negative floating-point numbers from the user, sums them up, and calculate their... PCEX
34 Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... PCEX
35 Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... PCEX
36 Calculating power Construct a function which takes a base and a non-negative exponent as parameters and calculates the base raised to the... jsParsons
37 Try adding Construct a function that adds two numbers together and handles non-numeric input. jsParsons exception handling, exceptions
38 Power calculation Construct a program which calculates the base raised to the power of the non-negative exponent. jsParsons
39 Calculating power Construct a program that calculates the base raised to the power of the non-negative exponent without using multiplication. jsParsons for loop
40 Unambiguous CFG Parse Tree Example Algorithm Visualization Visualization for the parse tree generated for a mathematical expression from a non-ambiguouse CFG. OpenDSA Context-Free Language, Parse Tree
41 Calculating power Construct a function which calculates the power of a number. The function takes two integers as parameters (the base number... jsParsons
42 Given a two-dimensional array a of integers and row/column positions r, c, return a 3x3 array whose middle element is a[r][c], and whose neighbors are copied from the original. Code Completion Given a two-dimensional array a of integers and row/column positions r, c, return a 3x3 array whose middle element is... CodeCheck Two-Dimensional Arrays, Looping over Neighbors
43 Turing Machine Extensions Frameset Presentation Slideshow presenting various potential extensions to Turing machines, such as two-dimensional tapes, multiple heads, and non-determinism. Includes proofs that these... OpenDSA Turing Machine