Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Heap Build Proficiency Exercise | Tracing Exercise | Practice exercise for heap building. User clicks on nodes to indicate the proper order of the build process. | OpenDSA | Heap |
| 2 | Heap Insert Proficiency Exercise | Tracing Exercise | Practice exercise for heap insertion. User clicks on nodes to indicate the proper order of the insert process. | OpenDSA | Heap |
| 3 | Heap Remove Proficiency Exercise | Tracing Exercise | Practice exercise for heap remove. User clicks on nodes to indicate the proper order of the remove process. | OpenDSA | Heap |
| 4 | Heap Practice Questions | Question, Battery | Self-practice questions about heaps. | OpenDSA | Heap |
| 5 | Heap Inefficient Build Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing a naive heap building algorithm. | OpenDSA | Heap |
| 6 | Heap Build Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing the efficient heap buiding algorithm. | OpenDSA | Heap |
| 7 | Heap Build Proof Slideshow | Code Tracing Presentation, Algorithm Visualization | Slideshow visualizing the cost of the efficient heap buiding algorithm, showing that it is a linear-time algorithm. | OpenDSA | Heap |
| 8 | Heap Insert Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing insert into a heap. | OpenDSA | Heap |
| 9 | Heap Max Remove Slideshow | Algorithm Visualization | Slideshow visualizing heap update when removing the max value from a maxheap. | OpenDSA | Heap |
| 10 | Heap Remove Slideshow | Algorithm Visualization | Slideshow visualizing heap update when removing a specified value from a heap. | OpenDSA | Heap |
| 11 | Heapsort Profiency Exercise | Tracing Exercise | Heapsort proficiency exercise. User must show all of the steps for updating the array during Heapsort. | OpenDSA | Heapsort |
| 12 | Heapsort Remove Max Proficiency Exercise | Tracing Exercise | Proficiency exercise for Heapsort. User must indicate how the array is updated when removing the maximum value during Heapsort. | OpenDSA | Heapsort |
| 13 | Heapsort: Review Questions | Question, Battery | Heapsort battery of self-assessment questions. | OpenDSA | Heapsort |
| 14 | Heapsort Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the cost of Heapsort. | OpenDSA | Heapsort |
| 15 | Heapsort Visualization Slideshow | Algorithm Visualization | Slideshow showing a visualization of the Heapsort algorithm. | OpenDSA | Heapsort |
| 16 | A Heap Example | Code Tracing Presentation | Slideshow demonstrating the memory allocation and deallocation. | OpenDSA | Memory Allocation |
| 17 | Garbage Disposal | Algorithm Visualization, Code Tracing Presentation | Slideshow introducing the concept of garbage collection. | OpenDSA | Garbage Collection, Heap Memory |
| 18 | Binary Tree Chapter Summary Questions | Question, Battery | Self-practice questions for the full Binary Tree chapter. | OpenDSA | Binary Tree, Binary Search Tree, Heap, Huffman Coding Tree |
| 19 | Replacement Selection Proficiency Exercise | Tracing Exercise | Interactive algorithm proficiency exercise for the replacement selection algorithm. User clicks on heap nodes to reproduce the behavior of replacement... | OpenDSA | File Processing, External Sorting, Replacement Selection |
| 20 | Pseudo-Random Probing Effectiveness Slideshow | Algorithm Visualization | Slideshow demonstrating why pseudo-random probing helps with collision resolution. | OpenDSA | Collision Resolution |
| 21 | (Exception Handling) Arithmetic - CSEdPad | Given two numbers, this program checks what happens when a number is divided by zero. | AnnEx | exception handling | |
| 22 | PANDAS Stats 3 | You're provided a dataframe of used cars using pandas. Count how many cars belong to each type using value_counts() and... | jsParsons | pandas, statistics | |
| 23 | 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 |