Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Problems, Algorithms, and Programs Exercise Question, Battery Battery of self-assessment questions on lower bounds and the relationship of various growth rates. OpenDSA Problem, Algorithm, Program
2 Comparing Growth Rates Exercise Question, Battery Battery of self-assessment questions that lets users pick which growth rate is cheapest from several choices. OpenDSA Problem, Algorithm, Program
3 Faster Computer or Faster Algorithm Exercise Question, Battery Battery of self-assessment questions on the distinction between speeding a computer processor vs. reducing computational complexity of an algorithm OpenDSA Problem, Algorithm, Program
4 Growth Rates Ordering Exercise Question, Battery Battery of self-assessment questions that lets users put several growth rates in order. OpenDSA Problem, Algorithm, Program
5 Asymptotic Analysis and Upper Bounds Exercise Question, Battery Battery of self-assessment questions about asymptotic analysis and upper bounds. OpenDSA Problem, Algorithm, Program
6 Best, Worst, and Average cases slideshow Presentation Slideshow illustrating analysis when there are different inputs of a given size. OpenDSA Problem, Algorithm, Program
7 Simple analysis cases slideshow Presentation Slideshow illustrating analysis when there is only one input of a given size. OpenDSA Problem, Algorithm, Program
8 Lower Bounds Misconceptions Presentation Slideshow illustrating lower bounds analysis and discussing various associated misconceptions. OpenDSA Problem, Algorithm, Program
9 Misunderstanding Examples: Graph Visualization Presentation Slideshow illustrating various growth rate behaviors. OpenDSA Problem, Algorithm, Program
10 Problem, Algorithm, and Program definitions Presentation Slideshow illustrating the differences between problems, algorithms, and programs. OpenDSA Problem, Algorithm, Program
11 Misconceptions Related to Upper Bounds Presentation Slideshow illustrating various misconceptions that can occur related to upper bounds asymptotic analysis. OpenDSA Problem, Algorithm, Program
12 Clique Proficency Exercise Proficiency Exercise User must determine the largest clique in a given graph. OpenDSA Clique Problem
13 3-Satisfiability Proficency Exercise Presentation Exercise User must determine whether a given 3-CNF expression has a satisfying truth assignment or not. OpenDSA Satisfiability Problem
14 Sorting Lower Bound Summary Questions Question, Battery Battery of self-assessment questions related to the lower bounds proof for the general sorting problem. OpenDSA Sorting Problem Lower Bound
15 Introduction to the Clique Problem Presentation Slideshow demonstrating the Clique problem. OpenDSA Clique Problem
16 Introduction to the CNF Satisfiability Problem Presentation Slideshow demonstrating the CNF satisfiability problem. OpenDSA Satisfiability Problem
17 Proof that 3-SAT is NP-Complete Slideshow Proof Visualization Slideshow demonstrating that 3-Satisfiability is NP-Complete by a reduction from Satisfiability. OpenDSA Clique Problem
18 Introduction to the 3-CNF Satisfiability Problem Presentation Slideshow demonstrating the 3-CNF satisfiability problem. OpenDSA Satisfiability Problem
19 Sorting Lower Bound Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the lower bound of the general sorting problem. OpenDSA Sorting Problem Lower Bound
20 Analyzing Problems Practice Questions Question, Battery Battery of self-assessment questions about asymptotic analysis and analyzing problems. OpenDSA Algorithm Analysis, Analyzing Problems
21 Dijkstra's Single-Source Shortest Paths Proficiency Exercise Tracing Exercise Proficiency exercise for Dijkstra's single-source -- OpenDSA Shortest Path Problem
22 Hamiltonian Cycle Proficency Exercise Proficiency Exercise User must determine whether a given graph has a Hamiltonian cycle. OpenDSA Hamiltonian Cycle Problem
23 Independent Set Proficency Exercise Proficiency Exercise User must determine the largest independent set in a given graph. OpenDSA Independent Set Problem
24 Traveling Saleseman Proficency Exercise Proficiency Exercise User must determine the shortest complete cycle in a given graph. OpenDSA Traveling Salesman Problem
25 Vertex Cover Proficency Exercise Proficiency Exercise User must determine the smallest vertex cover in a given graph. OpenDSA Vertex Cover Problem
26 Dijkstra's Single-Source Shortest Paths Algorithm Algorithm Visualization Slideshow demonstrating the Dijkstra's single-source shortest paths algorithm. OpenDSA Shortest Path Problem
27 Introduction to the Circuit Satisfiability Problem Presentation Slideshow demonstrating the circuit satisfiability problem. OpenDSA Circuit Satisfiability Problem
28 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
29 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
30 Introduction to the Hamiltonian Cycle Problem Presentation Slideshow demonstrating the Hamiltonian cycle problem. OpenDSA Hamiltonian Cycle Problem
31 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
32 Introduction to the Independent Set Problem Presentation Slideshow demonstrating the independent set problem. OpenDSA Independent Set Problem
33 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
34 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
35 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
36 Introduction to the Traveling Salesman Problem Presentation Slideshow demonstrating the Traveling Salesman problem. OpenDSA Traveling Salesman Problem
37 Introduction to the Vertex Cover Problem Presentation Slideshow demonstrating the vertex cover problem. OpenDSA Vertex Cover Problem
38 Call Structure for the Chained Matrix Multiplication Problem Algorithm Visualization Slideshow showing the tree structure for calls by a solution to the chained matrix multiplication problem. OpenDSA Dynamic Programming, Chained Matrix Multplication Problem
39 Problem 7 Java PredictingFinalResult for demonstrating Problem 7 QuizJET 2d arrays, arrays
40 Problem 5 Java PredictingFinalResult for demonstrating Problem 5 QuizJET 2d arrays, arrays
41 Problem 6 Java PredictingFinalResult for demonstrating Problem 6 QuizJET 2d arrays, arrays
42 Problem 2 Java PredictingFinalResult for demonstrating Problem 2 QuizJET do-while loop, while loop
43 Problem 3 Java PredictingFinalResult for demonstrating Problem 3 QuizJET do-while loop, while loop
44 Problem 4 Java PredictingFinalResult for demonstrating Problem 4 QuizJET nested loops
45 Problem 1 Java PredictingFinalResult for demonstrating Problem 1 QuizJET loops, while loop
46 Problem Notation Slideshow Presentation Slideshow showing the basic notation for defining a problem, with the example being sorting. OpenDSA Reduction
47 Solving Josephus Problem Construct a program by using Queue structure to solve a Josephus problem. Josephus problem is a counting-out game. N people... PCEX
48 Array-Based Queue Design Problem Slideshow Algorithm Visualization Slideshow presenting the problem that elements in an array-based queue will eventually run out of space. OpenDSA Array-Based Queue
49 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
50 Context-Free Language Membership Problem Frameset Programmed Instruction Programmed Instruction Frameset discussing how to recognize if a given string is derivable from a given Context-Free Grammar. OpenDSA Context-Free Language
51 Construir un problema con ciclos anidados Construye un programa que primero imprima 15, luego 14, luego 12, luego 9 y finalmente 5 en lineas consecutivas. jsParsons loops
52 Quadratic Probing Problems Slideshow Algorithm Visualization Slideshow demonstrating how quadratic probing does not always visit all slots of the hash table during collision resolution. OpenDSA Collision Resolution
53 Call Structure for the Fibonacci Sequence Problem Algorithm Visualization Slideshow showing the tree structure for calls by a recursive implementation of the Fibonacci sequence calculation. OpenDSA Dynamic Programming, Fibonacci Sequence
54 Sorting Terminology and Notation Slideshow Presentation Slideshow introducing the sorting problem. OpenDSA Sorting Notation
55 Construct a function that uses Queue Structure Construct a function that uses Queue Structure to solve a Josephus problem that removes the kth element in a given... jsParsons queue
56 Triangle Classification TestCase Exercise Code Testing Exercise Interactive exercise where user enters input values for a triangle classifier problem with the goal of getting complete code coverage.... OpenDSA Test Case, Code Coverage
57 Tracing Recursive Code: Towers of Hanoi Code Tracing Presentation Slideshow demonstrating code tracing the Towers of Hanoi problem. OpenDSA Recursion, Towers of Hanoi
58 Algorithm Analysis Lower Bounds Practice Exercise Question, Battery Battery of self-assessment questions on the distinction between problems, algorithms, and programs. OpenDSA Growth Rate, Lower Bound
59 Repeat for four numbers. Code Completion Repeat for four numbers. Hint: Use the previous problem. CodeCheck Branches, Branches with Functions
60 Construir una función que use una estructura de cola (Queue) Construye una funcion que use la estructura de Cola para resolver el problema de Josephus que elimina el k-esimo elemento... jsParsons
61 Determining When to Buy a New Phone (Case 2) Construct a program that determines whether it is time to buy a new phone based on the inputs that it... PCEX
62 Determining When to Buy a New Phone (Case 2) Construct a program that determines whether it is time to buy a new phone based on the inputs that it... PCEX
63 Determining When to Buy a New Phone (Case 2) Construct a program that determines whether it is time to buy a new phone based on the inputs that it... PCEX
64 Determining When to Buy a New Phone (Case 2). Construct a program that determines whether it is time to buy a new phone based on the inputs that it... PCEX
65 Determinando Cuando Comprar un Nuevo Telefono (Caso 2) Construir un programa que determine si es el momento de comprar un nuevo teléfono basado en las entradas que recibe... PCEX