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 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
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
9 Rotating the List Values to the Left by One Position Construct a program that has a function that receives a list of values and returns the list rotated to the... PCEX
10 Rotating the List Values to the Left by One Position Construct a program that has a function that receives a list of values and returns the list rotated to the... PCEX
11 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
12 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
13 Rotating the List Values to the Left by Two Position Construct a program that has a function that receives a list of values and returns the list rotated to the... PCEX
14 Rotating the List Values to the Left by Two Position Construct a program that has a function that receives a list of values and returns the list rotated to the... PCEX
15 Selection sort Ascending-order Selection sort operates by finding the minimum element of an array and moving it to the “beginning” of the... PCEX
16 Selection sort Descending-order Selection sort operates by finding the maximum element of an array and moving it to the “beginning” of the... PCEX
17 Tree traversal. The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX
18 Tree traversal. The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX
19 Insertion Sort Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... PCEX
20 Insertion Sort Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... PCEX
21 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
22 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
23 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
24 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
25 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