Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Algorithm Analysis Chapter Summary Questions: CS2 | Question, Battery | Battery of self-assessment questions on Algorithm Analysis. Suitable for a CS2 course. | OpenDSA | Algorithm Analysis |
| 2 | Algorithm Analysis Chapter Summary Questions: CS3 | Question, Battery | Battery of self-assessment questions on Algorithm Analysis. Suitable for a post-CS2 Data Structures and Algorithms course. | OpenDSA | Algorithm Analysis |
| 3 | Data Types Functions | Python PredictingFinalResult for demonstrating Data Types Functions | QuizPET | algorithm analysis, data types, functions | |
| 4 | Data Types Module | Python PredictingFinalResult for demonstrating Data Types Module | QuizPET | algorithm analysis, data types, functions | |
| 5 | File processing 2 | Python PredictingFinalResult for demonstrating File processing 2 | QuizPET | algorithm analysis, file i/o | |
| 6 | File processing 3 | Python PredictingFinalResult for demonstrating File processing 3 | QuizPET | algorithm analysis, file i/o | |
| 7 | two simple functions | Python PredictingFinalResult for demonstrating two simple functions | QuizPET | algorithm analysis, functions | |
| 8 | Nested for loop | Python PredictingFinalResult for demonstrating Nested for loop | QuizPET | algorithm analysis, for loop, nested loops | |
| 9 | Nested For and While Loop | Python PredictingFinalResult for demonstrating Nested For and While Loop | QuizPET | algorithm analysis, for loop, nested loops | |
| 10 | nested if-elif | Python PredictingFinalResult for demonstrating nested if-elif | QuizPET | algorithm analysis, control flow, if statement, if-else statement | |
| 11 | nested while | Python PredictingFinalResult for demonstrating nested while | QuizPET | algorithm analysis, loops, nested loops, while loop | |
| 12 | account objects | Python PredictingFinalResult for demonstrating account objects | QuizPET | algorithm analysis, classes, data structures, objects, stacks | |
| 13 | Odd or Even | Construct a program that goes through a list of numbers and prints out whether they are odd or even. | jsParsons | algorithm analysis, for loop, loops | |
| 14 | Modulo is Even | Construct a function that will return True if a given number is even, otherwise false. | jsParsons | algorithm analysis, functions, if-else statement | |
| 15 | Nested Calls | First define a calculate function and then define double function (that returns the given value doubled). Then write a program... | jsParsons | algorithm analysis, functions | |
| 16 | Nested ifs | Construct a program that prints out a sentence depending on the time of day. Night is considered to be before... | jsParsons | algorithm analysis, control flow, if statement, if-else statement | |
| 17 | Practicing using nested while and for loops | Construct a program to print a multiplication chart given the chart_size. Assume that chart_size is set to a positive integer. | jsParsons | algorithm analysis, for loop, nested loops | |
| 18 | Nested Loops | Construct a program that first prints out 15, then 14, then 12, then 9 and finally 5 on consecutive lines. | jsParsons | algorithm analysis, nested loops, while loop | |
| 19 | Practicing nested while loops | Construct a program to print an upside-down right triangle. Assume that 'size' is defined, and holds an integer value. | jsParsons | algorithm analysis, nested loops, while loop | |
| 20 | Practicing searching the index of the min and max elements | Construct a program that finds the indexes of both the max and min elements in a list. num_list is a... | jsParsons | algorithm analysis, recursion, search algorithms, sorting algorithms | |
| 21 | Files 1 | Python CodeVisualization for demonstrating Files 1 | JSVEE | algorithm analysis, file i/o | |
| 22 | Files 2 | Python CodeVisualization for demonstrating Files 2 | JSVEE | algorithm analysis, file i/o | |
| 23 | Functions 3 | Python CodeVisualization for demonstrating Functions 3 | JSVEE | algorithm analysis, functions | |
| 24 | If El If Else | Python CodeVisualization for demonstrating If El If Else | JSVEE | algorithm analysis, control flow, if statement, if-else statement | |
| 25 | Nested If | Python CodeVisualization for demonstrating Nested If | JSVEE | algorithm analysis, control flow, if statement, if-else statement | |
| 26 | ae_python_class1 | Python CodeVisualization for demonstrating ae_python_class1 | JSVEE | algorithm analysis, classes, data structures, objects, stacks | |
| 27 | ae_python_class2 | Python CodeVisualization for demonstrating ae_python_class2 | JSVEE | algorithm analysis, classes, data structures, objects, stacks | |
| 28 | Partition | Python CodeVisualization for demonstrating Partition | JSVEE | algorithm analysis, list, nested loops | |
| 29 | Analyzing Problems Practice Questions | Question, Battery | Battery of self-assessment questions about asymptotic analysis and analyzing problems. | OpenDSA | Algorithm Analysis, Analyzing Problems |
| 30 | Program Code Analysis Practice Questions | Question, Battery | Battery of self-assessment questions about asymptotic analysis and analyzing programs. | OpenDSA | Algorithm Analysis, Analyzing Programs |
| 31 | Common Algorithm Analysis Misconceptions Practice Questions | Question, Battery | Battery of self-assessment questions related to misconceptions in asymptoic algorithm analysis. | OpenDSA | Algorithm Analysis, Misconception |
| 32 | Binary Search Algorithm Worst Case Analysis Recurrence Visualization | Algorithm Analysis Presentation | Slideshow illustrating Binary Search worst case analysis through analysis of its recurrence relation. | OpenDSA | Binary Search, Algorithm Analysis, Recurrence Relation |
| 33 | Binary Search Algorithm | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating Binary Search and presenting its analysis. | OpenDSA | Binary Search, Algorithm Analysis |
| 34 | Two-dimensional List 2 | Python PredictingFinalResult for demonstrating Two-dimensional List 2 | QuizPET | 2d list, algorithm analysis, list | |
| 35 | Two-dimensional List 4 | Python PredictingFinalResult for demonstrating Two-dimensional List 4 | QuizPET | 2d list, algorithm analysis, classes, data structures, list, stacks | |
| 36 | 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 |
| 37 | Two-level linear index Slideshow | Algorithm Analysis Presentation | Slideshow showing a two-level linear index for variable length records stored on disk. | OpenDSA | Linear Indexing |
| 38 | Bubble Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Bubble Sort's cost in worst, average, and best cases. | OpenDSA | Bubble Sort, Worst Case, Average Case, Best Case |
| 39 | Exchange Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Echange Sorting cost. | OpenDSA | Bubble Sort, Worst Case, Average Case, Best Case |
| 40 | Selection Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Selection Sort's cost analysis. | OpenDSA | Selection Sort, Worst Case, Average Case, Best Case |
| 41 | Asymptotic Analysis and Upper Bounds Exercise | Question, Battery | Battery of self-assessment questions about asymptotic analysis and upper bounds. | OpenDSA | Problem, Algorithm, Program |
| 42 | Simple analysis cases slideshow | Presentation | Slideshow illustrating analysis when there is only one input of a given size. | OpenDSA | Problem, Algorithm, Program |
| 43 | Insertion Sort Average Case Slideshow | Code Tracing Presentation, Algorithm Analysis Presentation | Slideshow showing an analysis of Insertion Sort's average-case behavior and cost. | OpenDSA | Insertion Sort, Average Case |
| 44 | Insertion Sort Best Case Slideshow | Code Tracing Presentation, Algorithm Analysis Presentation | Slideshow showing an analysis of Insertion Sort's best-case behavior and cost. | OpenDSA | Insertion Sort, Best Case |
| 45 | Insertion Sort Worst Case Analysis | Code Tracing Presentation, Algorithm Analysis Presentation | Slideshow showing an analysis of Insertion Sort's worst-case behavior and cost. | OpenDSA | Insertion Sort, Worst Case |
| 46 | Heapsort Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the cost of Heapsort. | OpenDSA | Heapsort |
| 47 | Mergesort Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual analysis of Mergesort best, average, and worst case performance. | OpenDSA | Mergesort |
| 48 | Quicksort Partition Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the cost of the partition step for Quicksort. | OpenDSA | Quicksort |
| 49 | Radix Sort Analysis | Algorithm Visualization | Slideshow showing a visual analysis for the cost of Radix Sort. | OpenDSA | Radix Sort |
| 50 | Best, Worst, and Average cases slideshow | Presentation | Slideshow illustrating analysis when there are different inputs of a given size. | OpenDSA | Problem, Algorithm, Program |
| 51 | Quicksort Average Case Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the average-case cost of Quicksort. | OpenDSA | Quicksort |
| 52 | Quicksort Best Case Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the best-case cost of Quicksort. | OpenDSA | Quicksort |
| 53 | Quicksort Worst Case Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the worst-case cost of Quicksort. | OpenDSA | Quicksort |
| 54 | 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 |
| 55 | Lower Bounds Misconceptions | Presentation | Slideshow illustrating lower bounds analysis and discussing various associated misconceptions. | OpenDSA | Problem, Algorithm, Program |
| 56 | Misconceptions Related to Upper Bounds | Presentation | Slideshow illustrating various misconceptions that can occur related to upper bounds asymptotic analysis. | OpenDSA | Problem, Algorithm, Program |