Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Best, Worst, and Average cases slideshow Presentation Slideshow illustrating analysis when there are different inputs of a given size. OpenDSA Problem, Algorithm, Program
2 Simple analysis cases slideshow Presentation Slideshow illustrating analysis when there is only one input of a given size. OpenDSA Problem, Algorithm, Program
3 Lower Bounds Misconceptions Presentation Slideshow illustrating lower bounds analysis and discussing various associated misconceptions. OpenDSA Problem, Algorithm, Program
4 Misunderstanding Examples: Graph Visualization Presentation Slideshow illustrating various growth rate behaviors. OpenDSA Problem, Algorithm, Program
5 Problem, Algorithm, and Program definitions Presentation Slideshow illustrating the differences between problems, algorithms, and programs. OpenDSA Problem, Algorithm, Program
6 Misconceptions Related to Upper Bounds Presentation Slideshow illustrating various misconceptions that can occur related to upper bounds asymptotic analysis. OpenDSA Problem, Algorithm, Program
7 Summation of the first N integers visualization Presentation Slideshow showing how to calculate the closed form for the summation of the first N integers. OpenDSA Summation
8 Recursive Operations in a Binary Tree Presentation Slideshow discussing recursive operations on a binary tree. OpenDSA Array-Based Stack
9 Array-based List Introduction Slideshow Presentation Slideshow presenting the array-based list implementation. OpenDSA Array-Based List
10 List ADT Positions Slideshow Presentation Slideshow discussing the concept of current position in a list and its implications for insertion. OpenDSA List
11 Bad Linked List Representation Slideshow Presentation Slideshow demonstrating a bad representation for the current node in a linked list. OpenDSA Linked List
12 Linked List Deletion Problem Slideshow Presentation Slideshow demonstrating why a naive representation for the current node in a linked list leads to problems on deletion. OpenDSA Linked List
13 Introduction to the Circuit Satisfiability Problem Presentation Slideshow demonstrating the circuit satisfiability problem. OpenDSA Circuit Satisfiability Problem
14 Reduction of Circuit SAT to SAT Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Circuit Satisfiability problem to an instance of the CNF Satisfiability problem. OpenDSA Reduction, Satisfiability Problem
15 Introduction to the Clique Problem Presentation Slideshow demonstrating the Clique problem. OpenDSA Clique Problem
16 Reduction of Clique to Independent Set Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Clique problem to an instance of the Independent Set problem. OpenDSA Reduction, Clique Problem, Independent Set Problem
17 Introduction to the Hamiltonian Cycle Problem Presentation Slideshow demonstrating the Hamiltonian cycle problem. OpenDSA Hamiltonian Cycle Problem
18 Reduction of Hamiltonian Cycle to Traveling Salesman Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Hamiltonian Cycle problem to an instance of the Traveling Salesman problem. OpenDSA Reduction, Clique Problem, Independent Set Problem
19 Introduction to the Independent Set Problem Presentation Slideshow demonstrating the independent set problem. OpenDSA Independent Set Problem
20 Reduction of Independent Set to Vertex Cover Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Independent Set problem to an instance of the Vertex Cover problem. OpenDSA Reduction, Independent Set Problem, Vertex Cover Problem
21 Symmetric Matrix Multiplication Reduction Presentation Slideshow showing a reduction of Matrix Multiply to Symmetric Matrix Multiply. This demonstrates that the lower bound for Symmetric Matrix... OpenDSA Reduction
22 Reduction of Pairing to Sorting Presentation Slideshow showing a reduction of Pairing to Sorting. This demonstrates that the upper bound for Pairing is the same as... OpenDSA Reduction
23 Introduction to the CNF Satisfiability Problem Presentation Slideshow demonstrating the CNF satisfiability problem. OpenDSA Satisfiability Problem
24 Problem Notation Slideshow Presentation Slideshow showing the basic notation for defining a problem, with the example being sorting. OpenDSA Reduction
25 Reduction of Sorting to Pairing Presentation Slideshow showing a reduction of Sorting to Pairing. This demonstrates that the lower bound for Pairing is the same as... OpenDSA Reduction
26 Introduction to the 3-CNF Satisfiability Problem Presentation Slideshow demonstrating the 3-CNF satisfiability problem. OpenDSA Satisfiability Problem
27 Reduction of 3-SAT to Clique Slideshow Presentation Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Clique problem. OpenDSA Reduction, Satisfiability Problem, Clique Problem
28 Reduction of 3-SAT to Hamiltonian Cycle Slideshow Presentation Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Hamiltonian Cycle problem. OpenDSA Reduction, Satisfiability Problem, Hamiltonian Cycle Problem
29 Introduction to the Traveling Salesman Problem Presentation Slideshow demonstrating the Traveling Salesman problem. OpenDSA Traveling Salesman Problem
30 Introduction to the Vertex Cover Problem Presentation Slideshow demonstrating the vertex cover problem. OpenDSA Vertex Cover Problem
31 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
32 Consequences of Dereferencing a Null Pointer Presentation Slideshow demonstrating the consequence of dereferencing a null pointer. OpenDSA Pointer, Reference, Object
33 Java Data Types Presentation Slideshow showing primitive data types in Java and the concept of object and reference. OpenDSA Pointer, Reference, Data Type, Object
34 Master Theorem for Recurrence Relations Presentation Slideshow showing how to calculate the closed form for a divide-and-conquer recurrence using the Master Theorem. OpenDSA Recurrence Relation, Master Theorem
35 Discrete Fourier Transform Matrix Presentation Demonstration of multiplying by the FFT symmetry matrix for the 8th power of unity. OpenDSA Polynomial Multiplication, Fast Fourier Transform
36 Symmetries of the FFT Matrix Presentation Demonstration of the symmetries found within the nth powers of unity matrix for the FFT. OpenDSA Polynomial Multiplication, Fast Fourier Transform
37 Even and Odd Polynomials Slideshow Presentation Demonstration of the symmetries between even powers versus odd powers for polynomial evaluation of a value and its negation. OpenDSA Polynomial Multiplication
38 Expanding a Divide and Conquer Recurrence Presentation Slideshow showing how to calculate the closed form for a divide-and-conquer recurrence using the expansion technique. OpenDSA Recurrence Relation
39 Geometric Summation Proof Presentation Slideshow showing how to calculate the closed form for the geometric series. OpenDSA Summation
40 Using Posets for a Lower Bounds Proof Presentation Slideshow showing the use of posets in a proof of the lower bound for search in an unsorted list. OpenDSA Poset, Search in Unsorted Lists
41 Pointer Swap Optimization Slideshow Presentation Slideshow showing that Selection Sort can be sped up for large records with swapping to records. OpenDSA
42 Sorting Terminology and Notation Slideshow Presentation Slideshow introducing the sorting problem. OpenDSA Sorting Notation