Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Exceptions - Array Error | Question, forced choice | Multiple Choice Question | CodeWorkout | array, primitives, MAX_VALUE, forced choice |
| 2 | Finding the Min/Max Value in a List | Write a program that finds the maximum value in a list. | PCEX | list, value vs reference | |
| 3 | Finding the Min/Max Value in a List | Write a program that finds the minimum value in a list. | PCEX | list, search algorithms | |
| 4 | Heap Max Remove Slideshow | Algorithm Visualization | Slideshow visualizing heap update when removing the max value from a maxheap. | OpenDSA | Heap |
| 5 | Finding the Max/Min Value in an Array | Write a program that finds the maximum value in an array. | PCEX | arrays | |
| 6 | BST Delete Max Slideshow | Algorithm Visualization, Code Tracing Presentation | Slideshow visualizing recursive delete of the maximum value in a BST. | OpenDSA | Binary Search Tree |
| 7 | The Min/Max of Three Integers | Construct a program that determines the smallest of the three integer values entered by the user. | PCEX | control flow, if-else statement | |
| 8 | The Min/Max of Three Integers | Construct a program that determines the smallest of the three integer values entered by the user. | PCEX | algorithm analysis, control flow, if statement, if-else statement, statistics | |
| 9 | The Min/Max of Three Integers | Construct a program that determines the largest of the three integer values entered by the user. | PCEX | if-else statement | |
| 10 | 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 |
| 11 | Using conditions for completion count | Code Completion | We will divide the work of computing the maximum of all values in an array over multiple threads. Each thread... | CodeCheck | Concurrency |