Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Alphabetic Order | Alphabetic Order | AnnEx | order by | |
| 2 | Alphabetic Order pt | This is the portuguese version. | AnnEx | order by | |
| 3 | Order-by query execution 1 | Order-by query execution 1 | DBQA | ||
| 4 | Order-by query execution 2 | Order-by query execution 2 | DBQA | ||
| 5 | Order-by query execution 3 | Order-by query execution 3 | DBQA | ||
| 6 | Order-by query execution 4 | Order-by query execution 4 | DBQA | ||
| 7 | Order-By question4 | Order-By question4 | SQL-KnoT | ||
| 8 | Rotating the Array Values to the Left by One Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | arrays | |
| 9 | Rotating the Array Values to the Left by Two Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | arrays | |
| 10 | Rotating the Array Values to the Left by Two Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | arrays | |
| 11 | Selection sort | Ascending-order Selection sort operates by finding the minimum element of an array and moving it to the “beginning” of the... | PCEX | recursion, search algorithms, sorting, sorting algorithms | |
| 12 | Selection sort Challenge | Descending-order Selection sort operates by finding the maximum element of an array and moving it to the “beginning” of the... | PCEX | ||
| 13 | Tree traversal. | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | binary search, trees | |
| 14 | Tree traversal. Challenge | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | trees | |
| 15 | Insertion Sort | Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... | PCEX | recursion, search algorithms, sorting, sorting algorithms | |
| 16 | Insertion Sort Challenge | Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... | PCEX | ||
| 17 | Construct a program with multiple if-elif statements | Construct a program which checks which of the integers in interval from 1 to 50 is divisible by only 2,... | jsParsons | ||
| 18 | Breadth-First Search Graph Traversal Proficiency Exercise | Tracing Exercise | Proficiency exercise for breadth-first search to traverse a graph. User must indicate the order in which nodes are visited by... | OpenDSA | Breadth-First Search |
| 19 | Depth-First Search Graph Traversal Proficiency Exercise | Tracing Exercise | Proficiency exercise for depth-first search to traverse a graph. User just indicate the order in which nodes are visited by... | OpenDSA | Depth-First Search |
| 20 | Kruskal's Minimal-Cost Spanning Tree Proficiency Exercise | Tracing Exercise | Proficiency exercise for Kruskal's minimal-cost spanning tree. User must indicate the order in which nodes are visited by clicking on... | OpenDSA | Minimal-Cost Spanning Tree |
| 21 | Prim's Minimal-Cost Spanning Tree Proficiency Exercise | Tracing Exercise | Proficiency exercise for Prim's minimal-cost spanning tree. User must indicate the order in which nodes are visited by clicking on... | OpenDSA | Minimal-Cost Spanning Tree |
| 22 | Rotating the Array Values | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | arrays | |
| 23 | Rotating the List Values | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | algorithm analysis, classes, data structures, list, stacks | |
| 24 | Rotating the List Values (Case 2) | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | list | |
| 25 | An enum type describing chemical elements | Code Completion | Enumerated types in Java are quite powerful, in that they can contain methods and instance variables. An enum type class... | CodeCheck | Inheritance |
| 26 | Selection sort modification placing even before odd | Code Completion | Implement a modification of the SelectionSorter class that reorders the array to have even elements followed by odd ones. Follow... | CodeCheck | Sorting and Searching |