Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Order-by query execution 1 | Order-by query execution 1 | DBQA | ||
| 2 | Order-by query execution 2 | Order-by query execution 2 | DBQA | ||
| 3 | Order-by query execution 3 | Order-by query execution 3 | DBQA | ||
| 4 | Order-by query execution 4 | Order-by query execution 4 | DBQA | ||
| 5 | Alphabetic Order | Alphabetic Order | AnnEx | order by | |
| 6 | Alphabetic Order pt | This is the portuguese version. | AnnEx | order by | |
| 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 |
| 26 | Applicative-order reduction Proficiency Exercise | Tracing Exercise | Algorithm Proficiency Exercise for determining applicative-order reduction in Lambda Calculus expressions. | OpenDSA | Lambda Calculus |
| 27 | Normal-order reduction Proficiency Exercise | Tracing Exercise | Algorithm Proficiency Exercise for determining normal-order reduction in Lambda Calculus expressions. | OpenDSA | Lambda Calculus |
| 28 | Printing Numbers in Descending Order | Construct a program that accepts a positive integer N and then prints all the positive numbers in the sequence N,... | PCEX | ||
| 29 | Lambda Calculus: Beta Reduction Order 1 | Question, Battery | A collection of self-practice questions related to Beta reduction order in the Lambda Calculus. | OpenDSA | Lambda Calculus |
| 30 | Lambda Calculus: Beta Reduction Order 2 | Question, Battery | A second collection of self-practice questions related to Beta reduction order in the Lambda Calculus. | OpenDSA | Lambda Calculus |
| 31 | Functional Programming: Higher Order Functions 1 | Tracing Exercise | A question related to functional programming languages: higher order functions. | OpenDSA | Functional Programming |
| 32 | Functional Programming: Higher Order Functions 2 | Tracing Exercise | A question related to functional programming languages: higher order functions. | OpenDSA | Functional Programming |
| 33 | Functional Programming: Higher Order Functions 3 | Tracing Exercise | A question related to functional programming languages: higher order functions. | OpenDSA | Functional Programming |
| 34 | Parse Tree Example: Enforcing Order of Operations | Algorithm Visualization | Slideshow visualizing a parse tree from a grammar that enforces the correct order of operations. | OpenDSA | Parse Tree |
| 35 | Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers | Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... | PCEX | ||
| 36 | Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers. | Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... | PCEX | ||
| 37 | Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers | Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... | PCEX | ||
| 38 | Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers | Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in... | PCEX | ||
| 39 | Given three numbers, return true if they are evenly spaced; that is, sorted in ascending or descending order, with the same distance between them. | Code Completion | Given three numbers, return true if they are evenly spaced; that is, sorted in ascending or descending order, with the... | CodeCheck | Branches, Branches with Functions |
| 40 | Given a list of integers, move all negative numbers to the front and all positive numbers to the back, keeping their relative order. | Code Completion | Given a list of integers, move all negative numbers to the front and all positive numbers to the back, keeping... | CodeCheck | Lists - Simple Exercises, Moving or Removing Elements |
| 41 | Given a list of integers, return a list of length 2 containing the first and last element, in sorted order. | Code Completion | Given a list of integers, return a list of length 2 containing the first and last element, in sorted order. | CodeCheck | Lists - Simple Exercises, Two Answers |
| 42 | csedpad.15.ArrayLists.arraylist | For the online order list, this program determines if Seller adds gifts or alcohol risk notes. If the ordered list... | PCEX | ||
| 43 | Executing statements sequentially | In imperative programming the order of the statements matters for the execution of the program. | PCEX | ||
| 44 | The Binning Hash Function | Algorithm Visualization | Slideshow showing basic binning (using high-order digits) as a hash function. | OpenDSA | Hash Function |
| 45 | csedpad.09.WhileLoops.whileloops_1 | Assume you have a list of 1,000 people in alphabetical order and you are assigned to collect from the first... | PCEX | ||
| 46 | csedpad.19.ExceptionHandling.exceptionhandling_1 | This program checks that an input for an order is in the correct format, demonstrating how a NumberFormatException can occur. | PCEX | ||
| 47 | csedpad.21.Sorting.no_topic_1 | Sort a given unsorted array using bubble sort in ascending order. | PCEX | ||
| 48 | (Sorting) Bubble sort - CSEdPad | Sort a given unsorted array using bubble sort in ascending order | AnnEx | sorting algorithms | |
| 49 | Growth Rates Ordering Exercise | Question, Battery | Battery of self-assessment questions that lets users put several growth rates in order. | OpenDSA | Problem, Algorithm, Program |
| 50 | csedpad.05.LogicalOperators.no_topic_1 | Given the age of 3 individuals, this program compares their ages in order to check whether any two individuals are... | PCEX | ||
| 51 | csedpad.11.ForLoops.no_topic_1 | this is a program for a countdown display for launching a rocket in space which must show numbers in decreasing... | PCEX | ||
| 52 | csedpad.21.Sorting.no_topic | Given a list of unsorted game cards, sort them in ascending order using the insertion sort algorithm. | PCEX | ||
| 53 | csedpad.21.Sorting.no_topic_1 | Given a list of unsorted game cards, sort them in ascending order using the quick sort algorithm. | PCEX | ||
| 54 | (While loops) While Loops Ex 1 - CSEdPad | Loop with simple loop variable increment: Assume you have a list of 1,000 people in alphabetical order and you are... | AnnEx | while loop | |
| 55 | Construct a function that traverse a linked list |
Construct a function that prints all elements of a Doubly Linked List in forwards and then reverse order. DoublyLinkedList class implementation... |
jsParsons | doubly linked list, linked list | |
| 56 | List to Dictionary | Construct a program that prints out moo and oink, in that order. | jsParsons | classes, data structures, dictionaries, dictionary, stacks | |
| 57 | Inorder Traversal Exercise | Tracing Exercise | Practice exercise for Inorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Inorder Traversal |
| 58 | Postorder Traversal Exercise | Tracing Exercise | Practice exercise for postorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Postorder Traversal |
| 59 | Preorder Traversal Exercise | Tracing Exercise | Practice exercise for preorder traversal. User clicks on nodes to indicate the proper order of the traversal process. | OpenDSA | Preorder Traversal |
| 60 | 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 |
| 61 | 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 |
| 62 | 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 |
| 63 | Finding Adjacent Consecutive Numbers in a Sequence of Integers | Construct a program that checks whether a sequence of integers, entered one at a time, contains adjacent integers that are... | PCEX | ||
| 64 | Finding Adjacent Consecutive Numbers in a Sequence of Integers. | Construct a program that checks whether a sequence of integers, entered one at a time, contains adjacent integers that are... | PCEX | ||
| 65 | Finding Adjacent Consecutive Numbers in a Sequence of Integers | Construct a program that checks whether a sequence of integers, entered one at a time, contains adjacent integers that are... | PCEX | ||
| 66 | Finding Adjacent Consecutive Numbers in a Sequence of Integers | Construct a program that checks whether a sequence of integers, entered one at a time, contains adjacent integers that are... | PCEX | ||
| 67 | Parsing an Expression | Algorithm Visualization, User Supplied Data | Algorithm Visualization for generating the parse tree of a user-supplied mathematical expression. Demonstrates that the associated grammar enforces the correct... | OpenDSA | Parse Tree |
| 68 | Partial Orders: Review Questions | Question, Battery | Partial orders self-assessment questions. | OpenDSA | Insertion Sort |
| 69 | Practicar el orden de líneas para obtener el número correcto | Construye un programa que imprima el valor 8. | jsParsons | operators, variables | |
| 70 | Practicing Lambda Calculus Reduction | Tracing Exercise | Algorithm Proficiency Exercise for determining reduction orders in Lambda Calculus expressions. | OpenDSA | Lambda Calculus |
| 71 | Construir una función que recorra una lista enlazada |
Construye una funcion que imprima todos los elementos de una Lista Doblemente Enlazada hacia adelante y luego en orden inverso. La... |
jsParsons | ||
| 72 | Convertir una lista de tuplas en un diccionario | Construye un programa que imprima mu y oink, en ese orden. | jsParsons | dictionaries | |
| 73 | Desplazando los Valores de la Lista a la Izquierda Una Posicion | Construye un programa que tenga una función que reciba una lista de valores y devuelva la lista desplazada a la... | PCEX | ||
| 74 | Construir un programa con múltiples sentencias if-elif | Construye un programa que verifique cuales de los enteros en el intervalo del 1 al 50 son divisibles solo por... | jsParsons | ||
| 75 | Desplazando los Valores de la Lista a la Izquierda Dos Posiciones | Construye un programa que tenga una función que reciba una lista de valores y devuelva la lista desplazada a la... | PCEX |