Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 Hello Construct a program that prints out hello and world on separate lines. jsParsons
2 Imprimir hola mundo Construye un programa que imprima hola y mundo en lineas separadas. jsParsons
3 Two-dimensional List Construct a program that prints out [[0, 1, 2], [3, 4, 5], [6, 7, 99]] jsParsons
4 Construir un programa que trabaje con listas Construye un programa que imprima [[0, 1, 2], [3, 4, 5], [6, 7, 99]] jsParsons
5 Construct a program that creates unique 3 digit combination Construct a program which creates and prints all three-digit combinations from numbers 1-4 such that each number appears at most... jsParsons
6 Construir un programa que genere combinaciones únicas de 3 dígitos Construye un programa que cree e imprima todas las combinaciones de tres digitos de los numeros del 1 al 4... jsParsons
7 Construct a program that creates unique 3 digit combinations Construct a program which creates and prints all three-digit combinations from numbers 1-4 such that each number appears at most... jsParsons
8 Construir un programa que genere combinaciones únicas de 3 dígitos Construye un programa que cree e imprima todas las combinaciones de tres digitos de los numeros del 1 al 4... jsParsons
9 Add to list Construct a function that adds a given amount to all items in a list. jsParsons
10 List values and references. Construct a function that add k values to the given list. The added values is k's increment (increment by 1)... jsParsons
11 Valores y referencias en listas Construye una funcion que agregue valores de k a la lista dada. Los valores agregados son incrementos de k (incrementando... jsParsons
12 Practicar indexación y modificación de listas Construye una funcion que agregue una cantidad dada a todos los elementos de una lista. jsParsons
13 Addition Construct a program that prints the value 8. jsParsons
14 Practicar el orden de líneas para obtener el número correcto Construye un programa que imprima el valor 8. jsParsons
15 Bigger Than Assume that num1 and num2 have been initialized to numbers, so that number1 is bigger. Construct a program that correctly... jsParsons
16 Usar expresiones booleanas como parámetros de una función Asume que num1 y num2 han sido inicializados a numeros, de modo que numero1 es mayor. Construye un programa que... jsParsons
17 Calculate Function Define a function that returns the second value multiplied by two and added by the first value. The program should... jsParsons
18 Crear y llamar a una función Define una funcion que devuelva el segundo valor multiplicado por dos y sumado al primer valor. El programa debe imprimir... jsParsons
19 Dictionary calculations Construct a program that calculates each student’s average score by using `studentdict` dictionary that is already defined as follows: jsParsons
20 Cálculos con diccionarios Construye un programa que calcule el promedio de calificaciones de cada estudiante usando el diccionario `dicc_estudiantes` que ya esta definido... jsParsons
21 Practicing class inheritance Construct a program using inheritance of classes to display a student’s name and score. Consider student as an instance of... jsParsons
22 Practicar herencia de clases Construye un programa que use herencia de clases para mostrar el nombre y la nota de un estudiante. Considera que... jsParsons
23 Clss Person Write a program that will print out "Safiira. Nice to meet you!" jsParsons
24 Crear una clase y utilizarla Escribe un programa que imprima "Safiira. Encantado de conocerte!" jsParsons
25 Class Point Construct a class Point which has a method to tell distance from another instance of Point. jsParsons
26 Crear una clase y usar sus métodos Construye una clase Punto que tenga un metodo para calcular la distancia desde otra instancia de Punto. jsParsons
27 Comparisons Construct a program that prints out whether variable a is bigger than b. jsParsons
28 Practicar el uso de comparaciones Construye un programa que imprima si la variable a es mayor que b. jsParsons
29 Conditionals Temperature Construct a program that prints out 'Cold', when the temperature is 15 degrees celcius or below, 'Moderate' when it is... jsParsons
30 Practicar sentencias if...elif...else Construye un programa que imprima 'Frio' cuando la temperatura sea de 15 grados centigrados o menos, 'Moderado' cuando sea mayor... jsParsons
31 Practicing manipulating variables and checking types Construct a program that calculate two variables' modulus and check the type of the modulus jsParsons
32 Practicar la manipulación de variables y verificar sus tipos Construye un programa que calcule el modulo de dos variables y verifique el tipo del resultado. jsParsons
33 Dictionary Filter Construct a program that prints out all the circles that are larger than 5. jsParsons
34 Iterar sobre elementos (items) de un diccionario Construye un programa que imprima todos los circulos que son mayores que 5. jsParsons
35 Dictionary Keys storage-dictionary stores the amount of certain items in storage. Construct a program that prints out a list of all the... jsParsons
36 Iterar sobre un diccionario El diccionario almacen almacena la cantidad de ciertos articulos en bodega. Construye un programa que imprima una lista de todos... jsParsons
37 Dictionary Values Construct a program that prints out how many items in total are in storage. You can assume that a dictionary... jsParsons
38 Acceder a los valores de un diccionario Construye un programa que imprima cuantos articulos en total hay en bodega. Puedes asumir que un diccionario llamado almacen ya... jsParsons
39 Construct a program with multiple if-elif statements Construct a program which checks whether each of the integers in interval from 1 to 100 is divisible by 2,... jsParsons
40 Construir un programa con múltiples sentencias if-elif Construye un programa que verifique si cada uno de los enteros del intervalo del 1 al 100 es divisible por... jsParsons
41 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
42 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
43 Construct a program with multiple if-elif statements Construct a program which checks whether each of the integers in interval from 1 to 100 is divisible by 2,... jsParsons
44 Construir un programa con múltiples sentencias if-elif Construye un programa que verifique si cada uno de los enteros del intervalo del 1 al 100 es divisible por... jsParsons
45 Power calculation Construct a function which takes the base and the exponent as parameters and returns the base raised to the exponent.... jsParsons
46 Cálculo de potencias Construye una funcion que tome la base y el exponente como parametros y devuelva la base elevada al exponente. Llama... jsParsons
47 Power calculation Construct a program which calculates the base raised to the power of the non-negative exponent. jsParsons
48 Cálculo de potencias Construye un programa que calcule la base elevada al exponente no negativo. jsParsons
49 Reorganize the list Construct a program which partition the original list of integers such that all even numbers come first and all odd... jsParsons
50 Reorganizar la lista Construye un programa que divida la lista original de enteros de manera que todos los numeros pares vengan primero y... jsParsons
51 Reorganize the list Construct a function which partition the original list of integers such that all even numbers come first and all odd... jsParsons
52 Reorganizar la lista Construye una funcion que divida la lista original de enteros de manera que todos los numeros pares vengan primero y... jsParsons
53 Reorganize the list Construct a function which partition the list of integers given as a parameter such that all even numbers come first... jsParsons
54 Reorganizar la lista Construye una funcion que divida la lista de enteros dada como parametro de manera que todos los numeros pares vengan... jsParsons
55 Reorganize the list Construct a program which partition the original list of integers such that all even numbers come first and all odd... jsParsons
56 Reorganizar la lista Construye un programa que divida la lista original de enteros de manera que todos los numeros pares vengan primero y... jsParsons
57 Calculating power Construct a program which calculates the base raised to the power of the exponent. jsParsons
58 Calcular una potencia Construye un programa que calcule la base elevada al exponente. jsParsons
59 Calculating power Construct a function which calculates the power of a number. The function takes two integers as parameters (the base number... jsParsons
60 Calcular una potencia Construye una funcion que calcule la potencia de un numero. La funcion recibe dos enteros como parametros (la base y... jsParsons
61 Practising reading a file and printing the third element in each line of the file Construct a program that opens up a file and prints out the third element in each line of the file jsParsons
62 Practicar la lectura de archivos e imprimir el tercer elemento de cada línea Construye un programa que abra un archivo y muestre el tercer elemento de cada linea del archivo jsParsons
63 Updating elements to the new list Construct a function which finds even numbers from the list given as a parameter, calculates the square of each such... jsParsons
64 Actualizar elementos en una nueva lista Construye una funcion que encuentre los numeros pares en la lista dada como parametro, calcule el cuadrado de cada uno... jsParsons
65 Updating required elements to the new list Construct a program which finds even numbers from the original list, calculates the square of each such number and adds... jsParsons
66 Actualizar elementos necesarios en una nueva lista Construye un programa que encuentre los numeros pares en la lista original, calcule el cuadrado de cada uno de esos... jsParsons
67 Updating the elements to the new list Construct a function which finds even numbers from the list given as a parameter, calculates the square of each such... jsParsons
68 Actualizar los elementos en una nueva lista Construye una funcion que encuentre los numeros pares en la lista dada como parametro, calcule el cuadrado de cada uno... jsParsons
69 Updating the elements to the new list Construct a function which finds even numbers from the list given as a parameter, calculates the square of each such... jsParsons
70 Actualizar los elementos en una nueva lista Construye una funcion que encuentre los numeros pares en la lista dada como parametro, calcule el cuadrado de cada uno... jsParsons
71 Updating required elements to the new list Construct a program which finds even numbers from the original list, calculates the square of each such number and adds... jsParsons
72 Actualizar elementos necesarios en una nueva lista Construye un programa que encuentre los numeros pares en la lista original, calcule el cuadrado de cada uno de esos... jsParsons
73 Updating required elements to the new list Construct a program which finds even numbers from the original list, calculates the square of each such number and adds... jsParsons
74 Actualizar elementos necesarios en una nueva lista Construye un programa que encuentre los numeros pares en la lista original, calcule el cuadrado de cada uno de esos... jsParsons
75 Odd or Even Construct a program that goes through a list of numbers and prints out whether they are odd or even. jsParsons
76 Practicar iterar sobre una lista y usar módulo Construye un programa que recorra una lista de numeros e imprima si son pares o impares. jsParsons
77 Letter frequency Construct a function which counts the frequency of each character in the string given as a parameter and returns a... jsParsons
78 Frecuencia de letras Construye una funcion que cuente la frecuencia de cada caracter en la cadena dada como parametro y devuelva un diccionario... jsParsons
79 Letter frequency Construct a program which counts the frequency of each character in string 'Summer' and stores it in a dictionary. Finally,... jsParsons
80 Frecuencia de letras Construye un programa que cuente la frecuencia de cada caracter en la cadena 'Summer' y la almacene en un diccionario.... jsParsons
81 Iteration with Addition Construct a program that prints the value 8. jsParsons
82 Crear un programa con un ciclo while Construye un programa que imprima el valor 8. jsParsons
83 Iteration with Multiplication Construct a program that prints values 1,2,4,8 and finally prints "The end!". jsParsons
84 Crear un programa que compare un valor en un ciclo Construye un programa que imprima los valores 1,2,4,8 y finalmente imprima "El fin!". jsParsons
85 Iteration Multiplication For Construct a program that prints values 1,2,4,8 and finally prints "The end!". jsParsons
86 JSON Aggregate 1 You're provided a list of used cars in json list format. Find the the car by minimizing the cost. jsParsons
87 JSON Aggregate 2 You're provided a list of laptops in JSON list format. Find the best laptop by minimizing the price and maximizing... jsParsons
88 JSON Aggregate 3 Compute and display the average (mean) age jsParsons
89 JSON Aggregate 4 You're provided a list of aircrafts and helicopter, with manufacturer information, date of manufacture and other information. Count the flights... jsParsons
90 JSON Aggregate 5 You're provided a list of aircrafts and helicopter, with manufacturer information, date of manufacture and other information. Find the minimum... jsParsons
91 JSON Conditions 1 you're provided information for a list of flights that go to and from New York, Pittsburgh and Miami. You have... jsParsons
92 JSON Conditions 2 You're provided a list of aircrafts and helicopter. Shortlist the flights used in military. jsParsons
93 JSON Iterate 1 Using JSON structure list all flights and their destinations jsParsons
94 JSON Iterate 2 Using JSON structure list codes for first three flights jsParsons
95 Construct a function that checks the size of a linked list Construct a function that calculates the number of elements in a singly linked list.
LinkedList class implementation is given below. 		jsParsons
96 Construir una función que verifique el tamaño de una lista enlazada Construye una funcion que calcule el numero de elementos en una lista simplemente enlazada.
La implementacion de la clase ListaEnlazada se... 		jsParsons
97 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
98 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
99 List Iteration Zoo Construct a program that prints out all the animals in the zoo-variable. jsParsons
100 Iterar sobre una lista Construye un programa que imprima todos los animales en la variable zoologico. jsParsons
101 Construct a function that returns a list of remainders from the input. Construct a function which calculates the remainder of each element of the first list and the element with the same... jsParsons
102 Construir una función que devuelva una lista de restos (módulos) del valor de entrada Construye una funcion que calcule el residuo de cada elemento de la primera lista con el elemento del mismo indice... jsParsons
103 Construct a function that returns a list of remainders from the input. Construct a program which calculates the remainder of each element of the first list and the element with the same... jsParsons
104 Construir una función que devuelva una lista de restos (módulos) del valor de entrada Construye un programa que calcule el residuo de cada elemento de la primera lista con el elemento del mismo indice... jsParsons
105 Reverse the list Construct a program which creates a new list that is reverse of list [1, 2, 3, 4, 5]. jsParsons
106 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista [1, 2, 3, 4, 5]. jsParsons
107 Reverse the list Construct a program which creates a new list that is the reverse of the orginal list. jsParsons
108 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista original. jsParsons
109 Reverse the list Construct a program which creates a new list that is reverse of list [1, 2, 3, 4, 5]. jsParsons
110 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista [1, 2, 3, 4, 5]. jsParsons
111 Reverse the list Construct a program which creates a new list that is the reverse of the orginal list. jsParsons
112 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista original. jsParsons
113 Reverse the list Construct a program which creates a new list that is reverse of list [1, 2, 3, 4, 5]. jsParsons
114 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista [1, 2, 3, 4, 5]. jsParsons
115 Reverse the list Construct a program which creates a new list that is the reverse of the orginal list. jsParsons
116 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista original. jsParsons
117 Reverse the list Construct a program which creates a new list that is reverse of list [1, 2, 3, 4, 5]. jsParsons
118 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista [1, 2, 3, 4, 5]. jsParsons
119 Reverse the list Construct a program which creates a new list that is the reverse of the orginal list. jsParsons
120 Invertir la lista Construye un programa que cree una nueva lista que sea la inversa de la lista original. jsParsons
121 List to Dictionary Construct a program that prints out moo and oink, in that order. jsParsons
122 Convertir una lista de tuplas en un diccionario Construye un programa que imprima mu y oink, en ese orden. jsParsons
123 Practicing using math library and check a variable's type Construct a program that accesses math.pi and check its type jsParsons
124 Practicar el uso de la biblioteca math y comprobar el tipo de una variable Construye un programa que acceda a math.pi y verifique su tipo. jsParsons
125 Construct a function that sorts a numeric array using Merge Sort. Construct a merge function that recursively splits a numeric array and takes a list as a parameter called data.
Consider that... 		jsParsons
126 Construir una función que ordene un arreglo numérico usando Merge Sort Construye una funcion de mezcla que divida recursivamente un arreglo numerico y tome una lista como parametro llamada datos.
Considera que... 		jsParsons
127 Modulo is Even Construct a function that will return True if a given number is even, otherwise false. jsParsons
128 Crear una función y usar el operador módulo Construye una funcion que devuelva True si un numero dado es par, de lo contrario False. jsParsons
129 Nested Calls First define a calculate function and then define double function (that returns the given value doubled). Then write a program... jsParsons
130 Crear múltiples funciones y llamadas de función anidadas Primero define una funcion calcular y luego define una funcion doble (que devuelva el valor dado multiplicado por dos). Luego... jsParsons
131 Nested ifs Construct a program that prints out a sentence depending on the time of day. Night is considered to be before... jsParsons
132 Practicar sentencias if anidadas Construye un programa que imprima una oracion dependiendo de la hora del dia. Noche se considera antes de las 7... jsParsons
133 Nested List Indexing Construct a program that first prints out [[1, 2, 3], [4, 5, 6]], then [4, 5, 6], and finally 6. jsParsons
134 Practicar indexación de listas Construye un programa que primero imprima [[1, 2, 3], [4, 5, 6]], luego [4, 5, 6], y finalmente 6. jsParsons
135 Practicing using nested while and for loops Construct a program to print a multiplication chart given the chart_size. Assume that chart_size is set to a positive integer. jsParsons
136 Practicar el uso de ciclos while y for anidados Construye un programa que imprima una tabla de multiplicar segun el valor de tabla_tamano. Supone que tabla_tamano es un entero... jsParsons
137 Nested Loops Construct a program that first prints out 15, then 14, then 12, then 9 and finally 5 on consecutive lines. jsParsons
138 Construir un problema con ciclos anidados Construye un programa que primero imprima 15, luego 14, luego 12, luego 9 y finalmente 5 en lineas consecutivas. jsParsons
139 Nested Loops For 1 Construct a program that first prints out 15, then 14, then 12, then 9 and finally 5 on consecutive lines. jsParsons
140 Nested Loops For 2 Construct a program to print a multiplication chart given the chart_size. Assume that chart_size is set to a positive integer. jsParsons
141 Practicing nested while loops Construct a program to print an upside-down right triangle. Assume that 'size' is defined, and holds an integer value. jsParsons
142 Practicar ciclos while anidados Construye un programa que imprima un triangulo rectangulo invertido. Supone que 'tamano' esta definido y contiene un valor entero. jsParsons
143 Creating a function that checks if the string is a palindrome or not. Construct a function which determines whether the string given as a paramter is a palindrome. The function should be case... jsParsons
144 Crear una función que verifique si una cadena es un palíndromo o no Construye una funcion que determine si la cadena dada como parametro es un palindromo. La funcion debe ser insensible a... jsParsons
145 Creating a function that checks if the string is a palindrome or not. Construct a program which determines whether the original string is a palindrome. The function should be case insensitive i.e. upper... jsParsons
146 Crear una función que verifique si una cadena es un palíndromo o no Construye un programa que determine si la cadena original es un palindromo. La funcion debe ser insensible a mayusculas y... jsParsons
147 Creating a function that checks if the string is a palindrome or not. Construct a function which determines whether the string given as a paramter is a palindrome. The function should be case... jsParsons
148 Crear una función que verifique si una cadena es un palíndromo o no Construye una funcion que determine si la cadena dada como parametro es un palindromo. La funcion debe ser insensible a... jsParsons
149 Construct a function which determines whether the string given as a paramter is a palindrome. Construct a function that checks if the string is a palindrome or not. The function should be case insensitive i.e.... jsParsons
150 Construir una función que determine si una cadena dada como parámetro es un palíndromo Construye una funcion que verifique si la cadena es un palindromo o no. La funcion debe ser insensible a mayusculas... jsParsons
151 PANDAS GroupBy 1 You're provided a dataframe of used cars using pandas. Group the data by 'type' and calculate the average mileage for... jsParsons
152 PANDAS GroupBy 2 You're provided a dataframe of used cars using pandas. Group the data by 'type' and count the number of cars... jsParsons
153 PANDAS GroupBy 3 You're provided a dataframe of used cars using pandas. Group the data by 'type' and find the maximum mileage for... jsParsons
154 PANDAS Select 1 You're provided a dataframe of used cars using pandas. Select the columns with their type, mileage and name jsParsons
155 PANDAS Select 2 You're provided a dataframe of used cars using pandas. Select the columns with their type, mileage and name. filter those... jsParsons
156 PANDAS Stats 1 You're provided a dataframe of used cars using pandas. Display the first 5 rows and calculate the average mileage of... jsParsons
157 PANDAS Stats 2 You're provided a dataframe of used cars using pandas. Select the 'type' and 'mileage' columns and use describe() to display... jsParsons
158 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
159 Calculating power Construct a function which takes a base and a non-negative exponent as parameters and calculates the base raised to the... jsParsons
160 Calcular una potencia Construye una funcion que tome una base y un exponente no negativo como parametros y calcule la base elevada al... jsParsons
161 Calculating power Construct a program that calculates the base raised to the power of the non-negative exponent without using multiplication. jsParsons
162 Calcular una potencia Construye un programa que calcule la base elevada al exponente no negativo sin usar multiplicacion. jsParsons
163 Dictionary manipulation. Construct a program that prints a blue Toyota car. jsParsons
164 Manipulación de diccionarios Construye un programa que imprima un coche Toyota azul. jsParsons
165 Printing file contents Construct a program that opens up a file and prints out each line of the file jsParsons
166 Practicar leer un archivo e imprimir su contenido Construye un programa que abra un archivo e imprima cada linea del archivo jsParsons
167 Construct a function that uses Queue Structure Construct a function that uses Queue Structure to solve a Josephus problem that removes the kth element in a given... jsParsons
168 Construir una función que use una estructura de cola (Queue) Construye una funcion que use la estructura de Cola para resolver el problema de Josephus que elimina el k-esimo elemento... jsParsons
169 Practicing quick sort algorithm Construct a function that implements quick sort algorithm. The partition() function has been pre defined and displayed below.
Consider data is... 		jsParsons
170 Practicar el algoritmo de ordenación rápida (Quick Sort) Construye una funcion que implemente el algoritmo de ordenamiento rapido. La funcion de particion() ha sido predefinida y se muestra... jsParsons
171 Recursive Factorial Define a function that returns the factorial of a given positive integer. jsParsons
172 Crear una función recursiva Define una funcion que devuelva el factorial de un entero positivo dado. jsParsons
173 Remove dublicates from the list Construct a function which creates a new list where it stores all elements except the duplicates from the list given... jsParsons
174 Eliminar duplicados de una lista Construye una funcion que cree una nueva lista donde se almacenen todos los elementos excepto los duplicados de la lista... jsParsons
175 Remove dublicates from the list Construct a program which creates a new list where it stores all elements except the duplicates from the original list.... jsParsons
176 Eliminar duplicados de una lista Construye un programa que cree una nueva lista donde se almacenen todos los elementos excepto los duplicados de la lista... jsParsons
177 Practicing searching the index of the min element Construct a program that finds the index of the minimum element in a list. num_list is a test case where... jsParsons
178 Practicar la búsqueda del índice del elemento mínimo Construye un programa que encuentre el indice del elemento minimo en una lista. num_lista es el caso de prueba donde... jsParsons
179 Practicing searching the index of the min and max elements Construct a program that finds the indexes of both the max and min elements in a list. num_list is a... jsParsons
180 Practicar la búsqueda del índice de los elementos mínimo y máximo Construye un programa que encuentre los indices tanto del elemento maximo como del minimo en una lista. num_lista es el... jsParsons
181 Construct a program that creates a Stack Structure Construct a program that creates two functions in a Stack Structure. The first one is "push" function and the second... jsParsons
182 Construir un programa que cree una estructura de pila (Stack) Construye un programa que cree dos funciones en una estructura de Pila. La primera es la funcion "apilar" y la... jsParsons
183 String Indexing Construct a program that first prints out strings "Py", "th", "o", and "n" jsParsons
184 Practicar el corte de cadenas (slicing) Construye un programa que primero imprima las cadenas "Py", "th", "o" y "n" jsParsons
185 String join Construct a program that prints out a sentence from a given list of words. jsParsons
186 Practicar métodos de cadenas Construye un programa que imprima una oracion a partir de una lista dada de palabras. jsParsons
187 Checks whether the sum of two integers are equal as the third integer Construct a function which determines whether one of the paraters is the sum of the two other parameters. jsParsons
188 Verificar si la suma de dos enteros es igual al tercer entero Construye una funcion que determine si uno de los parametros es la suma de los otros dos parametros. jsParsons
189 Checks whether the sum of two integers are equal as the third integer Construct a program which determines whether the value of one of variables x, y, and z is the sum of... jsParsons
190 Verificar si la suma de dos enteros es igual al tercer entero Construye un programa que determine si el valor de una de las variables x, y o z es la suma... jsParsons
191 Swap Construct a program that swaps the values of x and y variables. jsParsons
192 Practicar la asignación de variables Construye un programa que intercambie los valores de las variables x e y. jsParsons
193 Construct an inorder traversal function Construct an inorder traversal function that recursively traverse a tree from left node, root node and right node. We store... jsParsons
194 Construir una función de recorrido inorder (inorden) Construye una funcion de recorrido inorder que recorra recursivamente un arbol desde el nodo izquierdo, nodo raiz y nodo derecho.... jsParsons
195 Construct a preorder traversal function Construct a preorder traversal function that recursively traverse a tree from root node, left node and right node. We store... jsParsons
196 Try adding Construct a function that adds two numbers together and handles non-numeric input. jsParsons
197 Practicar el manejo de excepciones Construye una funcion que sume dos numeros y maneje entradas no numericas. jsParsons
198 Try Except Construct a program that prints out various Celcius temperatures in Fahrenheit. jsParsons
199 Practicar el manejo de excepciones Construye un programa que imprima varias temperaturas en Celsius convertidas a Fahrenheit. jsParsons
200 XOR Construct a program that mimics a XOR gate (exclusive or). When input_a and input_b are the same, it should print... jsParsons
201 Crear una compuerta XOR usando sentencias if...elif Construye un programa que imite una compuerta XOR (o exclusivo). Cuando input_a y input_b sean iguales, debe imprimir 0 y... jsParsons
202 Return Bigger or None Construct a function that returns the bigger value of the given arguments. If a and b are equal, it should... jsParsons
203 Crear una función que devuelva el mayor de dos números Construye una funcion que devuelva el valor mayor de los argumentos dados. Si a y b son iguales, debe devolver... jsParsons
204 Simple Function Construct a program that prints out Hello functions. jsParsons
205 Crear una función que imprima hola mundo Construye un programa que imprima Hola funciones. jsParsons
206 Simple Params Construct a program that prints out 3 jsParsons
207 Crear una función que reciba un número, le sume dos y lo devuelva Construye un programa que imprima 3 jsParsons
208 Given a two-dimensional array of integers, return the average of the four corner elements. Code Completion Given a two-dimensional array of integers, return the average of the four corner elements. CodeCheck Two-Dimensional Arrays, No Loops
209 Given a two-dimensional array of integers, return the middle element if both the row and column lenghts are odd, or the average of the two or four middle elements of one or both is even. Code Completion Given a two-dimensional array of integers, return the middle element if both the row and column lenghts are odd, or... CodeCheck Two-Dimensional Arrays, No Loops
210 Given a two-dimensional array of integers and a string N, E, S, W, give the middle element along the border in the given compass direction, or the average of the two middle ones if the border length is even. Code Completion Given a two-dimensional array of integers and a string N, E, S, W, give the middle element along the border... CodeCheck Two-Dimensional Arrays, No Loops
211 Given a two-dimensional array of integers and a string NW, NW, SW, SE, return the sum of the four elements in the given compass direction. Code Completion Given a two-dimensional array of integers and a string NW, NW, SW, SE, return the sum of the four elements... CodeCheck Two-Dimensional Arrays, No Loops
212 Given a two-dimensional array of integers, row/column indexes r, c, and a string N E S W, return the neighbor in that direction, or 0 if it doesn't exist. Code Completion Given a two-dimensional array of integers, row/column indexes r, c, and a string N E S W, return the neighbor... CodeCheck Two-Dimensional Arrays, No Loops
213 Repeat with NW NE SW SE. Code Completion Repeat with NW NE SW SE. CodeCheck Two-Dimensional Arrays, No Loops
214 Given a two-dimensional array of integers and row/column indexes r, c, return the number of neighbors (not counting the element itself). Code Completion Given a two-dimensional array of integers and row/column indexes r, c, return the number of neighbors (not counting the element... CodeCheck Two-Dimensional Arrays, No Loops
215 On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. Code Completion On a chessboard, positions are marked with a letter between a and h for the column and a number between... CodeCheck Two-Dimensional Arrays, No Loops
216 Given a list of integers of length ≥ 4, return the average of the first two and last two elements. Code Completion Given a list of integers of length ≥ 4, return the average of the first two and last two elements. CodeCheck Lists - Simple Exercises, No loops
217 Given a list of integers of length ≥ 3, return the average of the first, last, and middle element (or the two middle elements if the length is even). Code Completion Given a list of integers of length ≥ 3, return the average of the first, last, and middle element (or... CodeCheck Lists - Simple Exercises, No loops
218 Given a list of integers, swap the first and last elements. Code Completion Given a list of integers, swap the first and last elements. CodeCheck Lists - Simple Exercises, No loops
219 Given a list of integers, swap the first two and the last two elements. Code Completion Given a list of integers, swap the first two and the last two elements. CodeCheck Lists - Simple Exercises, No loops
220 Given an input string, print the string with the first and last letter removed if they were equal, or the original string if they were not. Code Completion Given an input string, print the string with the first and last letter removed if they were equal, or the... CodeCheck Branches, Branches Without Functions
221 Given an actual time and an alarm clock time, both in “military” format (such as 0730 for 7:30am), print how many more minutes before the alarm rings. Code Completion Given an actual time and an alarm clock time, both in “military” format (such as 0730 for 7:30am), print how... CodeCheck Branches, Branches Without Functions
222 Repeat the preceding exercise for U. Code Completion Repeat the preceding exercise for U.S. time (e.g. 7:30am). CodeCheck Branches, Branches Without Functions
223 Given a point with integer coordinates (x, y) and a compass direction N, E, S, W, print the neigboring lattice point. Code Completion Given a point with integer coordinates (x, y) and a compass direction N, E, S, W, print the neigboring lattice... CodeCheck Branches, Branches Without Functions
224 Repeat with compass directions NW, NE, SW, SE. Code Completion Repeat with compass directions NW, NE, SW, SE. CodeCheck Branches, Branches Without Functions
225 On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. Code Completion On a chessboard, positions are marked with a letter between a and h for the column and a number between... CodeCheck Branches, Branches Without Functions
226 On a chessboard, fields are marked with a letter between a and h for the column and a number between 1 and 8 for the row. Code Completion On a chessboard, fields are marked with a letter between a and h for the column and a number between... CodeCheck Branches, Branches Without Functions
227 Given the x- and y-coordinates of a point, print whether the point lies in the first, second, third, or fourth quadrant plane, or on the x-axis, or on the y-axis, or the origin. Code Completion Given the x- and y-coordinates of a point, print whether the point lies in the first, second, third, or fourth... CodeCheck Branches, Branches Without Functions
228 Given three numbers x, y, z, determine if one of them is the sum of the two others, and then print out the equation. Code Completion Given three numbers x, y, z, determine if one of them is the sum of the two others, and then... CodeCheck Branches, Branches Without Functions
229 Given three numbers x, y, z, print out how whether they are all distinct, two are the same, or all three are the same. Code Completion Given three numbers x, y, z, print out how whether they are all distinct, two are the same, or all... CodeCheck Branches, Branches Without Functions
230 Given two integers x and y, print their sum, but if it is more than 100 or less than 0, print "out of range". Code Completion Given two integers x and y, print their sum, but if it is more than 100 or less than 0,... CodeCheck Branches, Branches Without Functions
231 Given three integers x, y, z, print the sum of the odd integers. Code Completion Given three integers x, y, z, print the sum of the odd integers. CodeCheck Branches, Branches Without Functions
232 Given three input strings, print all but the shortest one. Code Completion Given three input strings, print all but the shortest one. CodeCheck Branches, Branches Without Functions
233 Given a two-dimensional array of integers, return the number of distinct elements. Code Completion Given a two-dimensional array of integers, return the number of distinct elements. CodeCheck Two-Dimensional Arrays, Complex Loops
234 Given a two-dimensional array of integers, remove any adjacent duplicate rows by filling the duplicates with zeroes. Code Completion Given a two-dimensional array of integers, remove any adjacent duplicate rows by filling the duplicates with zeroes. CodeCheck Two-Dimensional Arrays, Complex Loops
235 Given a two-dimensional array of integers, return the index of the first row that is entirely filled with zeroes. Code Completion Given a two-dimensional array of integers, return the index of the first row that is entirely filled with zeroes. CodeCheck Two-Dimensional Arrays, Complex Loops
236 Given a two-dimensional array of integers, return the top left corner of the first subarray of the form <pre>0 0 0 0</pre> Code Completion Given a two-dimensional array of integers, return the top left corner of the first subarray of the form 
0 0...
CodeCheck Two-Dimensional Arrays, Complex Loops
237 Given a two-dimensional array of integers, return the position of the largest square subarray filled with zeroes, as a list of length 2. Code Completion Given a two-dimensional array of integers, return the position of the largest square subarray filled with zeroes, as a list... CodeCheck Two-Dimensional Arrays, Complex Loops
238 Repeat the previous exercise with subarrays that are not necessarily square. Code Completion Repeat the previous exercise with subarrays that are not necessarily square. CodeCheck Two-Dimensional Arrays, Complex Loops
239 Given a list of integers, count how many elements are negative. Code Completion Given a list of integers, count how many elements are negative. CodeCheck Lists - Simple Exercises, Counting Elements
240 Given a list a, count how many times the ith element from the front equals the ith element from the back. Code Completion Given a list a, count how many times the ith element from the front equals the ith element from the... CodeCheck Lists - Simple Exercises, Counting Elements
241 Given a list of integers and two values a and b, count how many elements are at least a and at most b. Code Completion Given a list of integers and two values a and b, count how many elements are at least a and... CodeCheck Lists - Simple Exercises, Counting Elements
242 Given a list of integers, return the most frequent element. Code Completion Given a list of integers, return the most frequent element. If there is more than one element with maximum frequency,... CodeCheck Lists - Simple Exercises, Counting Elements
243 Given a list of integers, return a list of all elements that occur with maximum frequency. Code Completion Given a list of integers, return a list of all elements that occur with maximum frequency. CodeCheck Lists - Simple Exercises, Counting Elements
244 Given a list of integers, return the position of the first element that occurs more than once, or -1 if all elements occur exactly once. Code Completion Given a list of integers, return the position of the first element that occurs more than once, or -1 if... CodeCheck Lists - Simple Exercises, Counting Elements
245 Given a list of integers, return a list of all elements that occur exactly once. Code Completion Given a list of integers, return a list of all elements that occur exactly once. CodeCheck Lists - Simple Exercises, Counting Elements
246 Given a list of integers, remove all elements that occur more than once, leaving the first occurrence. Code Completion Given a list of integers, remove all elements that occur more than once, leaving the first occurrence. CodeCheck Lists - Simple Exercises, Counting Elements
247 Given two lists of integers a and b of the same length, count the number of positions where the lists have the same elements. Code Completion Given two lists of integers a and b of the same length, count the number of positions where the lists... CodeCheck Lists - Simple Exercises, Counting Elements
248 Given two lists of integers a and b of the same length, count the number of positions where the list elements differ by at least 2. Code Completion Given two lists of integers a and b of the same length, count the number of positions where the list... CodeCheck Lists - Simple Exercises, Counting Elements
249 Given two lists a and b, remove all elements of b from a. Code Completion Given two lists a and b, remove all elements of b from a. CodeCheck Lists - Simple Exercises, Double Loops
250 Given two lists a and b, return a list that contains all elements occurring in a but not in b. Code Completion Given two lists a and b, return a list that contains all elements occurring in a but not in b. CodeCheck Lists - Simple Exercises, Double Loops
251 Given a list a, return the longest n so that the first n elements equal the last n elements. Code Completion Given a list a, return the longest n so that the first n elements equal the last n elements. CodeCheck Lists - Simple Exercises, Double Loops
252 Given a list of integers, return the largest sum of consecutive elements. Code Completion Given a list of integers, return the largest sum of consecutive elements. CodeCheck Lists - Simple Exercises, Double Loops
253 Given a list of integers, return the largest sequence whose reverse also occurs somewhere in the list. Code Completion Given a list of integers, return the largest sequence whose reverse also occurs somewhere in the list. CodeCheck Lists - Simple Exercises, Double Loops
254 Given a list a of integers, return a list of all elements of a that occur exactly once. Code Completion Given a list a of integers, return a list of all elements of a that occur exactly once. CodeCheck Lists - Simple Exercises, Double Loops
255 Given a list of integers, return a list of lists of length 2, containing each unique element together with its frequency. Code Completion Given a list of integers, return a list of lists of length 2, containing each unique element together with its... CodeCheck Lists - Simple Exercises, Double Loops
256 Given a list of integers, return the position of the longest subsequence of consecutive integers a, a + 1, a + 2, . Code Completion Given a list of integers, return the position of the longest subsequence of consecutive integers a, a + 1, a... CodeCheck Lists - Simple Exercises, Double Loops
257 Given an integer n, return a list of length n containing 1 -1 1 -1 . Code Completion Given an integer n, return a list of length n containing 1 -1 1 -1 ... CodeCheck Lists - Simple Exercises, Filling
258 Given integers n and k, return a list of length n containing 0 1 2 . Code Completion Given integers n and k, return a list of length n containing 0 1 2 ... k-1 0 1 2... CodeCheck Lists - Simple Exercises, Filling
259 Given integers a and b, return a list containing a, a + 1, a + 2, . Code Completion Given integers a and b, return a list containing a, a + 1, a + 2, ..., b. CodeCheck Lists - Simple Exercises, Filling
260 Given integers a and b, return a list containing all even numbers that are at least a and at most b. Code Completion Given integers a and b, return a list containing all even numbers that are at least a and at most... CodeCheck Lists - Simple Exercises, Filling
261 Given an integer n, return a list containing 1 2 2 3 3 3 4 4 4 4 . Code Completion Given an integer n, return a list containing 1 2 2 3 3 3 4 4 4 4 ... and... CodeCheck Lists - Simple Exercises, Filling
262 Given a list of integers and a value, return the position of the last occurrence of the value in the list, or -1 if the value does not exist. Code Completion Given a list of integers and a value, return the position of the last occurrence of the value in the... CodeCheck Lists - Simple Exercises, Finding Elements
263 Given a list of integers and a value, return the difference between the last and first position of the value in the list, or -1 if the value does not exist. Code Completion Given a list of integers and a value, return the difference between the last and first position of the value... CodeCheck Lists - Simple Exercises, Finding Elements
264 Given a list of integers and a value, return a list of all positions of the value in the list. Code Completion Given a list of integers and a value, return a list of all positions of the value in the list. CodeCheck Lists - Simple Exercises, Finding Elements
265 Given a list of integers and a value, return the position of the element that is closest to the value. Code Completion Given a list of integers and a value, return the position of the element that is closest to the value.... CodeCheck Lists - Simple Exercises, Finding Elements
266 Given two lists of integers of the same length, return the first position where their elements are the same. Code Completion Given two lists of integers of the same length, return the first position where their elements are the same. CodeCheck Lists - Simple Exercises, Finding Elements
267 Given two lists of integers of the same length, return the first position where their elements differ. Code Completion Given two lists of integers of the same length, return the first position where their elements differ. CodeCheck Lists - Simple Exercises, Finding Elements
268 Given two numbers, return true if they both have the same sign. Code Completion Given two numbers, return true if they both have the same sign. CodeCheck Branches, Branches with Functions
269 Write a function that checks whether two points with coordinates x1, y1 and x2, y2 are in the same quadrant. Code Completion Write a function that checks whether two points with coordinates x1, y1 and x2, y2 are in the same quadrant. CodeCheck Branches, Branches with Functions
270 Given two numbers, return their distance if it less than 10, or 10 otherwise. Code Completion Given two numbers, return their distance if it less than 10, or 10 otherwise. CodeCheck Branches, Branches with Functions
271 On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. Code Completion On a chessboard, positions are marked with a letter between a and h for the column and a number between... CodeCheck Branches, Branches with Functions
272 Given three numbers x, y, z and a Boolean variable <code>strict</code>, return <code>true</code> if <code>strict</code> is false and x ≤ y ≤ z, or <code>strict</code> is true and x &lt; y &lt; z. Code Completion Given three numbers x, y, z and a Boolean variable strict, return true if strict is false and x ≤... CodeCheck Branches, Branches with Functions
273 Given four numbers a, b, c, d, return true if exactly two of them are the same. Code Completion Given four numbers a, b, c, d, return true if exactly two of them are the same. CodeCheck Branches, Branches with Functions
274 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
275 Repeat for four numbers. Code Completion Repeat for four numbers. Hint: Use the previous problem. CodeCheck Branches, Branches with Functions
276 Given numbers x, y, and target, return whichever of x and y is closer to the target. Code Completion Given numbers x, y, and target, return whichever of x and y is closer to the target. If they have... CodeCheck Branches, Branches with Functions
277 Given a two-dimensional array of integers and row/column positions r, c, return the largest neighbor in the compass directions N E S W. Code Completion Given a two-dimensional array of integers and row/column positions r, c, return the largest neighbor in the compass directions N... CodeCheck Two-Dimensional Arrays, Looping over Neighbors
278 Given a two-dimensional array of integers and row/column positions r, c, return the largest neighbor in the compass directions N E S W NE NW SE SW. Code Completion Given a two-dimensional array of integers and row/column positions r, c, return the largest neighbor in the compass directions N... CodeCheck Two-Dimensional Arrays, Looping over Neighbors
279 Given a two-dimensional array of integers and row/column positions r, c, return the compass direction of the largest neighbor as a string N E S W NE NW SE SW. Code Completion Given a two-dimensional array of integers and row/column positions r, c, return the compass direction of the largest neighbor as... CodeCheck Two-Dimensional Arrays, Looping over Neighbors
280 Given a two-dimensional array of integers, row/column positions r, c, and a value x, fill the given element and its neighbors in the compass directions N E S W NE NW SE SW with x. Code Completion Given a two-dimensional array of integers, row/column positions r, c, and a value x, fill the given element and its... CodeCheck Two-Dimensional Arrays, Looping over Neighbors
281 Given a two-dimensional array a of integers and row/column positions r, c, return a 3x3 array whose middle element is a[r][c], and whose neighbors are copied from the original. Code Completion Given a two-dimensional array a of integers and row/column positions r, c, return a 3x3 array whose middle element is... CodeCheck Two-Dimensional Arrays, Looping over Neighbors
282 Given a two-dimensional array of integers, compute the sum of all positive elements. Code Completion Given a two-dimensional array of integers, compute the sum of all positive elements. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
283 Given a two-dimensional array of integers, return the largest element in the array. Code Completion Given a two-dimensional array of integers, return the largest element in the array. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
284 Given a two-dimensional array of integers, return the position of the smallest element in the array as a list of length 2. Code Completion Given a two-dimensional array of integers, return the position of the smallest element in the array as a list of... CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
285 Given a two-dimensional array of integers and a value x, return the position of the first match as a list of length 2. Code Completion Given a two-dimensional array of integers and a value x, return the position of the first match as a list... CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
286 Given a two-dimensional array of integers and a value x, return the positions of all matching elements, as a list of arrays of length 2. Code Completion Given a two-dimensional array of integers and a value x, return the positions of all matching elements, as a list... CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
287 Given a two-dimensional array of integers, compute the sum of all elements that are not one of the borders. Code Completion Given a two-dimensional array of integers, compute the sum of all elements that are not one of the borders. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
288 Given a two-dimensional square array of integers, compute the sum of all elements that are not on one of the diagonals. Code Completion Given a two-dimensional square array of integers, compute the sum of all elements that are not on one of the... CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
289 Given a two-dimensional array of integers, replace all negative elements with zero. Code Completion Given a two-dimensional array of integers, replace all negative elements with zero. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
290 Given a two-dimensional array of integers, reverse all rows. Code Completion Given a two-dimensional array of integers, reverse all rows. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
291 Given a two-dimensional array of integers, shift each row by one to the right and put a 0 at the leftmost column. Code Completion Given a two-dimensional array of integers, shift each row by one to the right and put a 0 at the... CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
292 Given an r x c array of integers, return an (r + 2) x (c + 2) array whose borders are zero and whose interior is the original array. Code Completion Given an r x c array of integers, return an (r + 2) x (c + 2) array whose borders... CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
293 Given a two-dimensional array of integers, return a list of the largest element in each row. Code Completion Given a two-dimensional array of integers, return a list of the largest element in each row. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
294 Given a two-dimensional array of integers, return a list of the number of negative elements in each row. Code Completion Given a two-dimensional array of integers, return a list of the number of negative elements in each row. CodeCheck Two-Dimensional Arrays, Looping Over the Entire Array
295 Given a two-dimensional array of integers and a row index, return the largest element in that row. Code Completion Given a two-dimensional array of integers and a row index, return the largest element in that row. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
296 Given a two-dimensional array of integers and a row index r, reverse the given row. Code Completion Given a two-dimensional array of integers and a row index r, reverse the given row. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
297 Given a two-dimensional square array of integers, reverse both diagonals. Code Completion Given a two-dimensional square array of integers, reverse both diagonals. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
298 Given a two-dimensional array of integers and a column index, return the smallest element in that column. Code Completion Given a two-dimensional array of integers and a column index, return the smallest element in that column. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
299 Given a two-dimensional array of integers, an index, and a string R or C, return the sum of the elements in that row or column. Code Completion Given a two-dimensional array of integers, an index, and a string R or C, return the sum of the elements... CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
300 Given a two-dimensional array of integers, a row index r, and a column index c, return the sum of all elements in the given row and column. Code Completion Given a two-dimensional array of integers, a row index r, and a column index c, return the sum of all... CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
301 Given a two-dimensional array of integers and a string N, E, S, W, return the sum of all elements of the border in the given compass direction. Code Completion Given a two-dimensional array of integers and a string N, E, S, W, return the sum of all elements of... CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
302 Given a two-dimensional array of integers, return the sum of all elements along the north and south border. Code Completion Given a two-dimensional array of integers, return the sum of all elements along the north and south border. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
303 Given a two-dimensional array of integers, return the sum of all elements along all borders but not the corners. Code Completion Given a two-dimensional array of integers, return the sum of all elements along all borders but not the corners. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
304 Given a two-dimensional array of integers, return the sum of all elements along all borders including the corners. Code Completion Given a two-dimensional array of integers, return the sum of all elements along all borders including the corners. CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
305 Given a two-dimensional square array of integers, return the sum of the elements along both diagonals. Code Completion Given a two-dimensional square array of integers, return the sum of the elements along both diagonals. Make sure not to... CodeCheck Two-Dimensional Arrays, Loops Along a Row or Column
306 Given a list of integers, return the position of the first occurrence of the largest element. Code Completion Given a list of integers, return the position of the first occurrence of the largest element. CodeCheck Lists - Simple Exercises, Maximum and Minimum
307 Given a list of integers, return the position of the last occurrence of the largest element. Code Completion Given a list of integers, return the position of the last occurrence of the largest element. CodeCheck Lists - Simple Exercises, Maximum and Minimum
308 Given a list of integers, return the difference of the positions of the first and the last occurrence of the largest element. Code Completion Given a list of integers, return the difference of the positions of the first and the last occurrence of the... CodeCheck Lists - Simple Exercises, Maximum and Minimum
309 Given a list of integers, return the difference between the maximum and minimum. Code Completion Given a list of integers, return the difference between the maximum and minimum. CodeCheck Lists - Simple Exercises, Maximum and Minimum
310 Given a list of integers, swap the the maximum and minimum. Code Completion Given a list of integers, swap the the maximum and minimum. CodeCheck Lists - Simple Exercises, Maximum and Minimum
311 Given a list of integers, return the second-largest element. Code Completion Given a list of integers, return the second-largest element. CodeCheck Lists - Simple Exercises, Maximum and Minimum
312 Given a list of elements, find the shortest distance between two consecutive elements. Code Completion Given a list of elements, find the shortest distance between two consecutive elements. CodeCheck Lists - Simple Exercises, Maximum and Minimum
313 Given a list of integers and an integer n, remove all elementts &gt; n or &lt; -n. Code Completion Given a list of integers and an integer n, remove all elementts > n or < -n. Shift all remaining... CodeCheck Lists - Simple Exercises, Moving or Removing Elements
314 Given a list of integers, move all zeroes to the back. Code Completion Given a list of integers, move all zeroes to the back. CodeCheck Lists - Simple Exercises, Moving or Removing Elements
315 Given a list of integers, move all zeroes to the front. Code Completion Given a list of integers, move all zeroes to the front. CodeCheck Lists - Simple Exercises, Moving or Removing Elements
316 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
317 Given a list of integers, remove all even elements that occur exactly twice. Code Completion Given a list of integers, remove all even elements that occur exactly twice. CodeCheck Lists - Simple Exercises, Moving or Removing Elements
318 Given a list of integers, remove all adjacent duplicates. Code Completion Given a list of integers, remove all adjacent duplicates. CodeCheck Lists - Simple Exercises, Moving or Removing Elements
319 Given a string s and an integer n, return a string in which each of the characters in s is repeated n times. Code Completion Given a string s and an integer n, return a string in which each of the characters in s is... CodeCheck Strings, Other String Operations
320 Given a string s, return the first vowel that is doubled in the string. Code Completion Given a string s, return the first vowel that is doubled in the string. CodeCheck Strings, Other String Operations
321 Given a string s, return the string with adjacent duplicates removed. Code Completion Given a string s, return the string with adjacent duplicates removed. For example, Mississippi yields Misisipi. CodeCheck Strings, Other String Operations
322 Given a string s and a string t, return a string in which all the characters of s that occur in t have been replaced by a _ character. Code Completion Given a string s and a string t, return a string in which all the characters of s that occur... CodeCheck Strings, Other String Operations
323 Given a string, return a string composed first of all characters at even positions and then of all characters at odd positions. Code Completion Given a string, return a string composed first of all characters at even positions and then of all characters at... CodeCheck Strings, Other String Operations
324 Write a method that undoes the effect of the preceding exercise. Code Completion Write a method that undoes the effect of the preceding exercise. CodeCheck Strings, Other String Operations
325 Given a string and two characters x and y (as strings of length 1), interchange all occurrences of x and y. Code Completion Given a string and two characters x and y (as strings of length 1), interchange all occurrences of x and... CodeCheck Strings, Other String Operations
326 Given a string s and a character c (as string of length 1), return a string with the characters surrounding the first occurrence of c reversed. Code Completion Given a string s and a character c (as string of length 1), return a string with the characters surrounding... CodeCheck Strings, Other String Operations
327 Given a string s and a character c (as string of length 1), return a string with the characters surrounding any occurrence of c reversed. Code Completion Given a string s and a character c (as string of length 1), return a string with the characters surrounding... CodeCheck Strings, Other String Operations
328 Given an integer n, produce the array <pre>0 1 2 3 . Code Completion Given an integer n, produce the array 
0 1 2 3 ... n 1 2 3 4 ... 0 ......
CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
329 Given two two-dimensional arrays a and b of integers with the same number of rows and columns, return a list of the same size where each element is the greater of the corresponding elements in the two arrays. Code Completion Given two two-dimensional arrays a and b of integers with the same number of rows and columns, return a list... CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
330 Repeat the preceding exercise where the array dimensions need not match, filling positions that exist in neither array with 0. Code Completion Repeat the preceding exercise where the array dimensions need not match, filling positions that exist in neither array with 0. CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
331 Given two two-dimensional arrays of integers with the same number of rows and columns, return the first position where they do not match, as a list of length 2. Code Completion Given two two-dimensional arrays of integers with the same number of rows and columns, return the first position where they... CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
332 Given two two-dimensional arrays with the same number of rows, return a list that places them side by side. Code Completion Given two two-dimensional arrays with the same number of rows, return a list that places them side by side. CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
333 Repeat where the row lengths don't have to match. Code Completion Repeat where the row lengths don't have to match. Fill the shorter array with zeroes. CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
334 Given a two-dimensional array a, return a list whose [i][j] element is the average of the neighbors of a[i][j] in the N, E, S, W direction. Code Completion Given a two-dimensional array a, return a list whose [i][j] element is the average of the neighbors of a[i][j] in... CodeCheck Two-Dimensional Arrays, Producing 2D Arrays
335 Given two strings s and t, return the first position where their characters differ, or -1 if they are identical. Code Completion Given two strings s and t, return the first position where their characters differ, or -1 if they are identical. CodeCheck Strings, Comparing Strings
336 Given two strings s and t, return the first position where their characters are the same, or -1 if there is no such position. Code Completion Given two strings s and t, return the first position where their characters are the same, or -1 if there... CodeCheck Strings, Comparing Strings
337 Given a string s, count how many times the ith character from the front equals the ith character from the back. Code Completion Given a string s, count how many times the ith character from the front equals the ith character from the... CodeCheck Strings, Comparing Strings
338 Given strings s and t, return a list of all positions in which t occurs in s. Code Completion Given strings s and t, return a list of all positions in which t occurs in s. CodeCheck Strings, Finding Substrings
339 Given strings s and t, return a string in which all occurrences of t are removed from s. Code Completion Given strings s and t, return a string in which all occurrences of t are removed from s. CodeCheck Strings, Finding Substrings
340 Given strings s and t, return a string in which all characters in t are removed from s. Code Completion Given strings s and t, return a string in which all characters in t are removed from s. CodeCheck Strings, Finding Substrings
341 Given a string s, return the longest prefix that is repeated somewhere else in the string. Code Completion Given a string s, return the longest prefix that is repeated somewhere else in the string. CodeCheck Strings, Finding Substrings
342 Given a string s, find the longest prefix that also occurs at the end (so that s = p + t + p), and return t, the string without the beginning and the end. Code Completion Given a string s, find the longest prefix that also occurs at the end (so that s = p +... CodeCheck Strings, Finding Substrings
343 Given a string, return the string with the first and last characters swapped. Code Completion Given a string, return the string with the first and last characters swapped. CodeCheck Strings, No Loops
344 Given a string, return the string with the middle two characters removed if it has even length, and the middle character removed if it has odd length. Code Completion Given a string, return the string with the middle two characters removed if it has even length, and the middle... CodeCheck Strings, No Loops
345 Given a string, return the string with the middle two characters swapped if it has even length, and the middle three characters swapped if it has odd length. Code Completion Given a string, return the string with the middle two characters swapped if it has even length, and the middle... CodeCheck Strings, No Loops
346 Given a string, return the string with the first and second half swapped. Code Completion Given a string, return the string with the first and second half swapped. If the string has odd length, leave... CodeCheck Strings, No Loops
347 Given a string, return the string with the first half and the second half doubled. Code Completion Given a string, return the string with the first half and the second half doubled. For example, Java becomes JaJavava... CodeCheck Strings, No Loops
348 Given a string, find the first integer inside and return its value as an integer. Code Completion Given a string, find the first integer inside and return its value as an integer. Return 0 if there is... CodeCheck Strings, Numbers in Strings
349 Given a string, find the sum of all integers inside. Code Completion Given a string, find the sum of all integers inside. Return 0 if there is no integer inside. CodeCheck Strings, Numbers in Strings
350 Given a string, find all integers inside and return a string that separates them by commas. Code Completion Given a string, find all integers inside and return a string that separates them by commas. CodeCheck Strings, Numbers in Strings
351 Given a string in which words are separated by spaces, return the longest word. Code Completion Given a string in which words are separated by spaces, return the longest word. CodeCheck Strings, Words
352 Given a string in which words are separated by spaces, return the first word that is duplicated (such as an accidental “this this”. Code Completion Given a string in which words are separated by spaces, return the first word that is duplicated (such as an... CodeCheck Strings, Words
353 Given a string in which words are separated by spaces, return the first word that is repeated somewhere in the string. Code Completion Given a string in which words are separated by spaces, return the first word that is repeated somewhere in the... CodeCheck Strings, Words
354 Given a string in which words are separated by spaces, and two words a and b, interchange all occurrences of a and b. Code Completion Given a string in which words are separated by spaces, and two words a and b, interchange all occurrences of... CodeCheck Strings, Words
355 Given a list of integers, return the sum of all positive elements. Code Completion Given a list of integers, return the sum of all positive elements. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
356 Given a list of integers, find the largest sum of two different elements in the list. Code Completion Given a list of integers, find the largest sum of two different elements in the list. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
357 Given a list of floating-point numbers, return a list of the averages of consecutive element pairs of the original list. Code Completion Given a list of floating-point numbers, return a list of the averages of consecutive element pairs of the original list. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
358 Given a list of integers and an integer n, return a list of the averages of n consecutive elements of the original list. Code Completion Given a list of integers and an integer n, return a list of the averages of n consecutive elements of... CodeCheck Lists - Simple Exercises, Sums, Averages, Products
359 Given a list of integers, return the average of all elements that are not the maximum or minimum. Code Completion Given a list of integers, return the average of all elements that are not the maximum or minimum. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
360 Given a list of integers, replace each element with the average of its neighbors. Code Completion Given a list of integers, replace each element with the average of its neighbors. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
361 Given a list of integers, return the sum of all odd elements. Code Completion Given a list of integers, return the sum of all odd elements. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
362 Given a list of integers and two values a and b, return the sum of all elements that are at least a and at most b. Code Completion Given a list of integers and two values a and b, return the sum of all elements that are at... CodeCheck Lists - Simple Exercises, Sums, Averages, Products
363 Given a list of integers, return the average of all positive elements. Code Completion Given a list of integers, return the average of all positive elements. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
364 Given a list of strings and a string s, return the average length of all strings containing s. Code Completion Given a list of strings and a string s, return the average length of all strings containing s. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
365 Given a list of integers, return the product of all non-zero elements. Code Completion Given a list of integers, return the product of all non-zero elements. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
366 Given a list of integers, give the largest n so that the sum of the first n elements equals the sum of the remaining elements. Code Completion Given a list of integers, give the largest n so that the sum of the first n elements equals the... CodeCheck Lists - Simple Exercises, Sums, Averages, Products
367 Given a list of integers, give the largest n ≤ length / 2 so that the sum of the first n elements equals the sum of the last n elements. Code Completion Given a list of integers, give the largest n ≤ length / 2 so that the sum of the first... CodeCheck Lists - Simple Exercises, Sums, Averages, Products
368 Given a list of integers, give the largest sum of n consecutive elements. Code Completion Given a list of integers, give the largest sum of n consecutive elements. CodeCheck Lists - Simple Exercises, Sums, Averages, Products
369 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
370 Given a list of integers, return a list of length 2 containing the minimum and the maximum. Code Completion Given a list of integers, return a list of length 2 containing the minimum and the maximum. CodeCheck Lists - Simple Exercises, Two Answers
371 Given a list of integers, return a list of length 2, with the number of positive and the number of negative elements in the list. Code Completion Given a list of integers, return a list of length 2, with the number of positive and the number of... CodeCheck Lists - Simple Exercises, Two Answers
372 Given a list of integers, return a list of length 2, each being a list. Code Completion Given a list of integers, return a list of length 2, each being a list. The first one holds the... CodeCheck Lists - Simple Exercises, Two Answers
373 Given a list of integers, return a list of length 2, each being a list. Code Completion Given a list of integers, return a list of length 2, each being a list. The first one holds the... CodeCheck Lists - Simple Exercises, Two Answers
374 Binary Search Tree Insert Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST insert. OpenDSA Binary Search Tree
375 Binary Search Tree Remove Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST remove. OpenDSA Binary Search Tree
376 Binary Search Tree Search Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST search. OpenDSA Binary Search Tree
377 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
378 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
379 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
380 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
381 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
382 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
383 Huffman Coding Tree Build Visualization Algorithm Visualization, User Supplied Data Visualization for building a Huffman Coding Tree from a set of weights supplied by the user. OpenDSA Huffman Coding Tree
384 Add Command Proficiency Exercise Proficiency Exercise Add command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
385 Git Branch Command Proficiency Exercise Proficiency Exercise Git branch command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
386 Cd Command Proficiency Exercise 2 Proficiency Exercise Second cd command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
387 Cd Command Proficiency Exercise 3 Proficiency Exercise Third cd command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
388 cd Command Proficiency Exercise Proficiency Exercise Cd command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
389 Command Line Proficiency Exercise: Challenge 1 Proficiency Exercise Command line proficency exercise: User provides the appropriate command to achieve some goal. Challenge 1. OpenDSA Command Line
390 Command line proficiency exercise: Challenge 2 Proficiency Exercise Command line proficency exercise: User provides the appropriate command to achieve some goal. Challeng 2. OpenDSA Command Line
391 Command Line Proficiency Exercise: Challenge 3 Proficiency Exercise Command line proficency exercise: User provides the appropriate command to achieve some goal. Challenge 3. OpenDSA Command Line
392 Clone Command Proficiency Exercise Proficiency Exercise clone command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
393 Commit -a Command Proficiency Exercise Proficiency Exercise Commit -a command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
394 Commit Path Command Proficiency Exercise Proficiency Exercise Commit Path command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
395 Git Commit Command Proficiency Exercise Proficiency Exercise Commit command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
396 cp command proficiency exercise Proficiency Exercise cp command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
397 Git Command Proficiency Exercise: Challenge 1 Proficiency Exercise Git command proficency exercise: User provides the appropriate command to achieve some goal. Challenge 1. OpenDSA Git
398 Git Command Proficiency Exercise: Challenge 2 Proficiency Exercise Git command proficency exercise: User provides the appropriate command to achieve some goal. Challenge 2. OpenDSA Git
399 Git Command Proficiency Exercise: Challenge 3 Proficiency Exercise Git command proficency exercise: User provides the appropriate command to achieve some goal. Challenge 3. OpenDSA Git
400 Git Command Proficiency Exercise: rm Proficiency Exercise Git command proficency exercise: User provides the appropriate command to achieve some goal. rm command. OpenDSA Git
401 ls command proficiency exercise Proficiency Exercise ls command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
402 mkdir command proficiency exercise Proficiency Exercise mkdir command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
403 mv command proficiency exercise Proficiency Exercise mv command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
404 Git Pull Command Proficiency Exercise Proficiency Exercise Git pull command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
405 Git Push Command Proficiency Exercise Proficiency Exercise push command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
406 pwd Command Proficiency Exercise 2 Proficiency Exercise Second pwd command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
407 pwd Command Proficiency Exercise 3 Proficiency Exercise Third pwd command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
408 pwd Command Proficiency Exercise Proficiency Exercise pwd command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
409 Git Restore Staged Command Proficiency Exercise Proficiency Exercise Git Restore staged command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
410 Git Restore Command Proficiency Exercise Proficiency Exercise restore command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
411 rm -r Command Proficiency Exercise Proficiency Exercise rm -r command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
412 rm Command Proficiency Exercise Proficiency Exercise rm command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
413 rmdir command proficiency exercise Proficiency Exercise rmdir command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
414 Status Command Proficiency Exercise Proficiency Exercise status command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
415 Git Switch -c Command Proficiency Exercise Proficiency Exercise Git switch -c command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
416 Git Switch Diverged Command Proficiency Exercise Proficiency Exercise Git switch diverged command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
417 Git Switch Command Proficiency Exercise Proficiency Exercise Git switch command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Git
418 touch command proficiency exercise Proficiency Exercise touch command proficency exercise: User provides the appropriate command to achieve some goal. OpenDSA Command Line
419 Buffer Pool Visualization Algorithm Visualization, User Supplied Data Algorithm Visualization for buffer pools. User can selectreplacement heuristic, pool size, and input data for the visualization. OpenDSA Buffer Pool
420 Multiway Merge Proficiency Exercise Tracing Exercise Interactive algorithm proficiency exercise for multiway merge. User clicks on positions in the array to reproduce the behavior of multiway... OpenDSA File Processing, External Sorting, Multiway Merge
421 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
422 Union/Find Proficiency Exercise Tracing Exercise Proficiency exercise for the Union/Find algorithm to maintain a collection of disjoint sets. User must show the complete sequence of... OpenDSA Union/Find Algorithm
423 Breadth-First Search Graph Traversal Visualization Algorithm Visualization Visualization for breadth-first search to traverse a graph. OpenDSA Breadth-First Search
424 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
425 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
426 Dijkstra's Single-Source Shortest Paths Proficiency Exercise Tracing Exercise Proficiency exercise for Dijkstra's single-source -- OpenDSA Shortest Path Problem
427 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
428 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
429 Birthday Calculator Calculation, User Supplied Data Simple calculator for computing the probability of a collision occuring given a specified number of inserts into a specified table... OpenDSA Hashing, Collision Resolution
430 Hash Table Deletion Proficiency Exercise Tracing Exercise Proficiency exercise for hash table deletion. User must show the complete sequence of steps for removing an element from the... OpenDSA Hashing
431 Mid-square Method Calculator Calculation Exercise Calculator for computing value of the middle digits of a squared number. OpenDSA Hash Function
432 String Folding Method activity Calculation, User Supplied Data Calculator for computing value of hashing a string by 'folding'. A better method than character value summing. OpenDSA Hash Function
433 Simple String Hash Calculator Calculation, User Supplied Data Calculator for computing value of hashing a string by simple summation of its characters' ASCII values. OpenDSA Hash Function
434 B+ Tree Insertion Proficiency Exercise Tracing Exercise Interactive proficiency exercise for insertion into a B+ Tree. User clicks on tree nodes to indicate how the insert process... OpenDSA B-Tree, Tree-Based Indexing
435 Linear Indexing Proficiency Exercise Tracing Exercise Interactive proficiency exercise for linear indexing. User clicks on array elements to indicate how the search process progresses from through... OpenDSA Linear Indexing
436 Buddy Method Memory Manager Visualization Algorithm Visualization, User Supplied Data Algorithm Visualization for the buddy method memory manager. User can select data for the visualization. OpenDSA Buddy Method Memory Manager
437 First Fit Memory Manager Visualization Algorithm Visualization, User Supplied Data Algorithm Visualization for various sequential memory manager schemes. User can select data for the visualization. Multiple versions are available: First... OpenDSA Sequential Fit Memory Manager
438 First Fit Memory Manager Proficiency Exercise Tracing Exercise Proficiency exercise for first fit memory manager. User must show the complete sequence of steps for allocating memory blocks. OpenDSA First Fit Memory Manager
439 CFG Exercise: a^mb^ia^n, i=m+n Grammar Construction Exercise User creates a CFG that generates strings in the language a^mb^ia^n, i=m+n. OpenDSA Context-Free Grammar
440 CFG Exercise: a^mb^ic^n, i less than 3 Grammar Construction Exercise User creates a CFG that generates strings in the language a^mb^ic^n, i < 3. OpenDSA Context-Free Grammar
441 CFG Exercise: Odd length Grammar Construction Exercise User creates a CFG that generates strings in the language a^nb^m where m - n is positive, odd. OpenDSA Context-Free Grammar
442 CFG Exercise: a's and b's are equal Grammar Construction Exercise User creates a CFG that generates strings in the language where the number of a's and b's is equal. OpenDSA Context-Free Grammar
443 CFG Transformation Exercise 1 Grammar Construction Exercise User creates an equivalent CFG with no usless, lambda, or unit productions: Exercise 1. OpenDSA Context-Free Grammar
444 CFG Transformation Exercise 2 Grammar Construction Exercise User creates an equivalent CFG with no usless, lambda, or unit productions: Exercise 2. OpenDSA Context-Free Grammar
445 CFG Transformation: Chomsky Normal Form Grammar Construction Exercise User creates an equivalent CFG in Chomsky Normal Form. OpenDSA Context-Free Grammar
446 DFA Exercise: Length a Multiple of 3 with No aab Automata Construction Exercise User creates a DFA that recognizes strings with length a multiple of 3 and containing no instance of aab. OpenDSA Context-Free Grammar
447 DFA Exercise: Both Even or Odd Automata Construction Exercise User creates a DFA that accepts the langugage of strings with both even a's and b's, or both odd a's... OpenDSA Deterministic Finite Automata
448 DFA Exercise: b Surrounds a Automata Construction Exercise User creates a DFA that accepts the langugage of strings where every a is surrounded by b's. OpenDSA Deterministic Finite Automata
449 DFA Exercise: Complement Even a, 3 b's Automata Construction Exercise User creates a DFA that accepts the complement of the langugage of strings with an even number of a's and... OpenDSA Deterministic Finite Automata
450 DFA Exercise: Compliment of No 3 a's Automata Construction Exercise User creates a DFA that accepts the langugage of strings of a's and b's that have 3 consecutive a's. OpenDSA Deterministic Finite Automata
451 DFA Exercise: Complement No ba Automata Construction Exercise User creates a DFA that accepts the complement of the langugage of strings with a's and b's that does not... OpenDSA Deterministic Finite Automata
452 DFA Exercise: Divisible by 4 Automata Construction Exercise User creates a DFA that accepts the langugage of strings of binary numbers divisible by 4. OpenDSA Deterministic Finite Automata
453 DFA Exercise: Even a's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an even number of a's. OpenDSA Deterministic Finite Automata
454 DFA Exercise: Even a's, b's, odd a's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an even number of a's, followed by at least... OpenDSA Deterministic Finite Automata
455 DFA Exercise: Even a, 3 b's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an even number of a's and at least 3... OpenDSA Deterministic Finite Automata
456 DFA Exercise: Even a's Odd b's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an even number of a's and an odd number... OpenDSA Deterministic Finite Automata
457 DFA Exercise: Even Binary Numbers Automata Construction Exercise User creates a DFA that accepts the langugage of even binary numbers. OpenDSA Deterministic Finite Automata
458 DFA Exercise: Minimize the Number of State Exercise 1 Automata Construction Exercise User shows the steps in the algorithm to minimize the states in a given DFA. Exercise 1. OpenDSA Deterministic Finite Automata
459 DFA Exercise: Minimize the Number of State Exercise 2 Automata Construction Exercise User shows the steps in the algorithm to minimize the states in a given DFA. Exercise 2. OpenDSA Deterministic Finite Automata
460 DFA Exercise: No 3 a's Automata Construction Exercise User creates a DFA that accepts the langugage of strings of a's and b's without 3 consecutive a's. OpenDSA Deterministic Finite Automata
461 DFA Exercise: No ba Automata Construction Exercise User creates a DFA that accepts the langugage of strings with a's and b's that does not end in ba. OpenDSA Deterministic Finite Automata
462 DFA Exercise: Odd a's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an odd number of a's. OpenDSA Deterministic Finite Automata
463 DFA Exercise: Odd a's, 3 b's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an odd number of a's and at most 3... OpenDSA Deterministic Finite Automata
464 DFA Exercise: Odd a's, Even b's Automata Construction Exercise User creates a DFA that accepts the langugage of strings with an odd number of a's and an even number... OpenDSA Deterministic Finite Automata
465 NFA Construction Exercise 1 Automata Construction Exercise Construct an NFA: Exercise 1 OpenDSA Deterministic Finite Automata
466 Convert NFA to DFA Exercise 1 Automata Construction Exercise User shows the steps to convert a given NFA to an equivalent DFA: Exercise 1 OpenDSA Deterministic Finite Automata
467 Grammar Construction Exercise: Three Strings Grammar Construction Exercise Exercise where user must write the grammar for a given language. This language has three strings. OpenDSA Language, Grammar
468 Grammar Construction Exercise: abb Grammar Construction Exercise Exercise where user must write the grammar for a given language. This language has some a's followed by twice as... OpenDSA Language, Grammar
469 Grammar Construction Exercise: a's and b's Grammar Construction Exercise Exercise where user must write the grammar for a given language. This language has some a's followed by some b's. OpenDSA Language, Grammar
470 Grammar Construction Exercise: Palendrome Grammar Construction Exercise Exercise where user must write the grammar for a given language. This language is palendromes on a's and b's. OpenDSA Language, Grammar
471 Grammar Construction Exercise: Balanced Parentheses Grammar Construction Exercise Exercise where user must write the grammar for a given language. This language has balanced and properly nested parentheses. OpenDSA Language, Grammar
472 PDA Exercise: Twice as many a's as b's Automata Construction Exercise User creates a Pushdowns Automata that accepts the langugage of strings that have twice as many a's as b's. OpenDSA Pushdown Automata
473 PDA Exercise: Equal a's to b's or c's Automata Construction Exercise User creates a Pushdowns Automata that accepts the langugage of a's b's and c's with as many a's as either... OpenDSA Pushdown Automata
474 PDA Exercise: Equal a's and b's Automata Construction Exercise User creates a Pushdowns Automata that accepts the langugage a^ic^jb^i. OpenDSA Pushdown Automata
475 PDA Exercise: String and Reverse Automata Construction Exercise User creates a Pushdowns Automata that accepts the langugage WcW^R. OpenDSA Pushdown Automata
476 Regular Expression Exercise: Strings Containing aba RegEx Writing Exercise User writes an regular expression for the language of strings containing aba. OpenDSA Regular Expression
477 Regular Expression Exercise: Strings of Multiples of 3 a's RegEx Writing Exercise User writes an regular expression for the language of strings that contain a multiple of 3 a's. OpenDSA Regular Expression
478 Regular Expression Exercise: Strings of a's Preceded or Followed by b RegEx Writing Exercise User writes an regular expression for the language of strings where every a is either proceeded or followed by b. OpenDSA Regular Expression
479 Regular Expression Exercise: Strings Containing bba in an Even Position RegEx Writing Exercise User writes an regular expression for the langugae of strings containing bba in an even position. OpenDSA Regular Expression
480 Regular Expression Exercise: Strings of 2 b's and c's RegEx Writing Exercise User writes an regular expression for the language of strings where the number of b's and c's sums to 2. OpenDSA Regular Expression
481 Regular Expression Exercise: Strings of Even Binary Numbers RegEx Writing Exercise User writes an regular expression for the language of strings that are even binary numbers. OpenDSA Regular Expression
482 Regular Expression Exercise: Strings Containing No aa RegEx Writing Exercise User writes an regular expression for the langugae of strings containing no occurance of aa. OpenDSA Regular Expression
483 Regular Expression Exercise: Strings Containing One bbb RegEx Writing Exercise User writes an regular expression for the langugae of strings containing exactly one instance of bbb. OpenDSA Regular Expression
484 Regular Grammar Exercise: aaab*ba Grammar Construction Exercise User writes an regular grammar for the language of strings matching the regular expression (aaab*ba)*. OpenDSA Regular Expression, Regular Grammar
485 Regular Grammar Exercise: a's a Multiple of 3 Grammar Construction Exercise User writes an regular grammar for the language of strings with the number of a's being divisible by 3. OpenDSA Regular Grammar
486 Regular Grammar Exercise: Number of a's and b's is Odd Grammar Construction Exercise User writes an regular grammar for the language of strings with an odd length. OpenDSA Regular Expression, Regular Grammar
487 Regular Grammar Exercise: bb*aaa* Grammar Construction Exercise User writes an regular grammar for the language of strings that meet this regular expression: bb*aaa* OpenDSA Regular Expression, Regular Grammar
488 Regular Grammar Exercise: NFA conversion RegEx Writing Exercise User writes a regular grammar equivalent to a given NFA: Exercise 1. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
489 Regular Grammar Exercise: NFA Conversion 2 Grammar Construction Exercise User writes a regular grammar equivalent to a given NFA: Exercise 2. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
490 Regular Grammar Exercise: NFA Conversion to Right Regular Grammar Grammar Construction Exercise User writes a right regular grammar equivalent to a given NFA: Exercise 2. OpenDSA Non-Deterministic Finite Automata, Regular Grammar
491 Turing Machine Exercise: More a's Automata Construction Exercise User creates a Turing machine that recognizes the language with more a's than b's or c's. OpenDSA Turing Machine
492 Turing Machine Exercise: Reverse a String Automata Construction Exercise User creates a Turing machine that, given string W, outputs WW^R. OpenDSA Turing Machine
493 Turing Machine Exercise: Palindromes Automata Construction Exercise User creates a Turing machine that recognizes the language of palindromes on strings of a's and b's. OpenDSA Turing Machine
494 Turing Machine Exercise: Add an a Automata Construction Exercise User creates a Turing machine that adds an a to a string of a's. OpenDSA Turing Machine
495 Turing Machine Exercise: Accept Powers of 2 Automata Construction Exercise User creates a Turing machine that accepts strings of a's with the number of characters being a power of 2. OpenDSA Turing Machine
496 Turing Machine Exercise: Erase abc Automata Construction Exercise User creates a Turing machine that erases a string of a's, b's, and c's. OpenDSA Turing Machine
497 Turing Machine Exercise: Decide Powers of 2 Automata Construction Exercise User creates a Turing machine that decides if strings of a's have a length that is a power of 2. OpenDSA Turing Machine
498 Turing Machine Exercise: Keep abc Automata Construction Exercise User creates a Turing machine that moves over a string of a's, b's, and c's. OpenDSA Turing Machine
499 Turing Machine Exercise: Replace aba with aca Automata Construction Exercise User creates a Turing machine that replaces every substring aba with aca. OpenDSA Turing Machine
500 Applicative-order reduction Proficiency Exercise Tracing Exercise Algorithm Proficiency Exercise for determining applicative-order reduction in Lambda Calculus expressions. OpenDSA Lambda Calculus
501 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
502 Practicing Lambda Calculus Reduction Tracing Exercise Algorithm Proficiency Exercise for determining reduction orders in Lambda Calculus expressions. OpenDSA Lambda Calculus
503 Parameter Passing by Name Visualization Code Tracing Presentation Visualization of parameter passing by name in SLang2. OpenDSA Parameter Passing
504 Parameter Passing by Name Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with parameter passing by name. OpenDSA Parameter Passing
505 Parameter Passing by Reference Visualization Code Tracing Presentation Visualization of parameter passing by reference in SLang2. OpenDSA Parameter Passing
506 Parameter Passing by Reference Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with parameter passing by reference. OpenDSA Parameter Passing
507 Parameter Passing by Value Visualization Code Tracing Presentation Visualization of parameter passing by value in SLang2. OpenDSA Parameter Passing
508 Parameter Passing by Value Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with parameter passing by value. OpenDSA Parameter Passing
509 Parameter Passing by Copy-Restore Visualization Code Tracing Presentation Visualization of parameter passing by copy-restore in SLang2. OpenDSA Parameter Passing
510 Parameter Passing by Copy-Restore Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with parameter passing by copy-restore. OpenDSA Parameter Passing
511 Parameter Passing by Macro Visualization Tracing Visualization Visualization of parameter passing by macro in SLang2. OpenDSA Parameter Passing
512 Parameter Passing by Macro Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with parameter passing by macro. OpenDSA Parameter Passing
513 Normal-order reduction Proficiency Exercise Tracing Exercise Algorithm Proficiency Exercise for determining normal-order reduction in Lambda Calculus expressions. OpenDSA Lambda Calculus
514 Binary Search Proficency Exercise Tracing Exercise Interactive exercise where users indicate which elements of the array should be searched to reproduce the binary search algorithm's behavior. OpenDSA Binary Search
515 Bubble Sort Visualization Algorithm Visualization, Code Tracing Presentation, User Supplied Data Algorithm Visualization for Bubble Sort. Includes code visualization. User can select data for the visualization. OpenDSA Bubble Sort
516 Heapsort Profiency Exercise Tracing Exercise Heapsort proficiency exercise. User must show all of the steps for updating the array during Heapsort. OpenDSA Heapsort
517 Insertion Sort Visualization Algorithm Visualization, User Supplied Data Algorithm Visualization for Insertion Sort. Includes code visualization. User can select data for the visualization. OpenDSA Insertion Sort
518 Insertion Sort Optimized with Shifting Proficiency Exercise Tracing Exercise Interactive algorithm proficiency exercise for optimized Insertion Sort. User clicks on array elements to reproduce the behavior of Insertion Sort... OpenDSA Insertion Sort, Code Tuning
519 Mergesort Visualization Algorithm Visualization, User Supplied Data Algorithm Visualization for Mergesort. User can select data for the visualization. OpenDSA Mergesort
520 Mergesort Profiency Exercise Tracing Exercise Mergesort proficiency exercise. User must show all of the merge steps for all values in the array. OpenDSA Mergesort
521 Quicksort Visualization Algorithm Visualization, User Supplied Data Algorithm Visualization for Quicksort. User can select data for the visualization. OpenDSA Quicksort
522 Quicksort Proficiency Exercise Tracing Exercise Proficiency exercise for Quicksort. User must show the complete sequence of steps for sorting an array. OpenDSA Quicksort
523 Radix Sort Visualization: Array Implementation Algorithm Visualization, User Supplied Data Algorithm Visualization for Radix Sort, implemented using arrays. User can select data for the visualization. OpenDSA Radix Sort
524 Radix Sort Visualization: Linked List Implementation Algorithm Visualization, User Supplied Data Algorithm Visualization for Radix Sort, implemented using linked lists. User can select data for the visualization. OpenDSA Radix Sort
525 Selection Sort Visualization Algorithm Visualization, Code Tracing Presentation, User Supplied Data Algorithm Visualization for Selection Sort. Includes code visualization. User can select data for the visualization. OpenDSA Selection Sort
526 Shellsort Visualization Algorithm Visualization, Code Tracing Presentation, User Supplied Data Algorithm Visualization for Shellsort. User can select data for the visualization. OpenDSA Shellsort
527 Shellsort Performance Proficiency Exercise Calculation Exercise Interactive proficiency exercise for Shellsort that focuses on the best performing diminishing increments. User selects an increment series and is... OpenDSA Shellsort
528 Shellsort Proficiency Exercise Tracing Exercise Interactive proficiency exercise for Shellsort. User clicks on array cells to indicate the behavior of Shellsort. OpenDSA Shellsort
529 Bintree Visualization Algorithm Visualization Algorithm Visualization for the Bintree data structure. OpenDSA PR Quadtree
530 Bintree Interactive Visualization Algorithm Visualization, User Supplied Data Interactive Algorithm Visualization for the Bintree data structure. User can click to indicate where a point should be inserted or... OpenDSA Bintree
531 KD Tree Visualization Algorithm Visualization Algorithm Visualization illustrating the KD Tree. OpenDSA KD Tree
532 PR Quadtree Two Points Visualization Algorithm Visualization Algorithm Visualization for the PR Quadtree with up to two points per node. OpenDSA PR Quadtree
533 PR Quadtree Visualization Algorithm Visualization Algorithm Visualization for the PR Quadtree with one point per node. OpenDSA PR Quadtree
534 PR Quadtree Interactive Visualization Algorithm Visualization, User Supplied Data PR Quadtree Visualization that allows the user to click on locations to insert points to be inserted into or deleted... OpenDSA PR Quadtree
535 Bowling Score TestCase Exercise Code Testing Exercise Interactive exercise where user enters input values for a bowling game scoring function with the goal of getting complete code... OpenDSA Test Case, Code Coverage
536 Triangle Classification TestCase Exercise Code Testing Exercise Interactive exercise where user enters input values for a triangle classifier problem with the goal of getting complete code coverage.... OpenDSA Test Case, Code Coverage
537 Pumping Lemma Game Proficiency Exercise Demonstration of an adversary argument for the Pumping Lemma, in the form of an adversary game. OpenDSA Pumping Lemma, Regular Language, Adversary Argument
538 Algorithm Analysis Chapter Summary Questions: CS2 Question, Battery Battery of self-assessment questions on Algorithm Analysis. Suitable for a CS2 course. OpenDSA Algorithm Analysis
539 Algorithm Analysis Chapter Summary Questions: CS3 Question, Battery Battery of self-assessment questions on Algorithm Analysis. Suitable for a post-CS2 Data Structures and Algorithms course. OpenDSA Algorithm Analysis
540 Problems, Algorithms, and Programs Exercise Question, Battery Battery of self-assessment questions on lower bounds and the relationship of various growth rates. OpenDSA Problem, Algorithm, Program
541 Analyzing Problems Practice Questions Question, Battery Battery of self-assessment questions about asymptotic analysis and analyzing problems. OpenDSA Algorithm Analysis, Analyzing Problems
542 Program Code Analysis Practice Questions Question, Battery Battery of self-assessment questions about asymptotic analysis and analyzing programs. OpenDSA Algorithm Analysis, Analyzing Programs
543 Comparing Growth Rates Exercise Question, Battery Battery of self-assessment questions that lets users pick which growth rate is cheapest from several choices. OpenDSA Problem, Algorithm, Program
544 Faster Computer or Faster Algorithm Exercise Question, Battery Battery of self-assessment questions on the distinction between speeding a computer processor vs. reducing computational complexity of an algorithm OpenDSA Problem, Algorithm, Program
545 Growth Rates Ordering Exercise Question, Battery Battery of self-assessment questions that lets users put several growth rates in order. OpenDSA Problem, Algorithm, Program
546 Algorithm Analysis Lower Bounds Practice Exercise Question, Battery Battery of self-assessment questions on the distinction between problems, algorithms, and programs. OpenDSA Growth Rate, Lower Bound
547 Common Algorithm Analysis Misconceptions Practice Questions Question, Battery Battery of self-assessment questions related to misconceptions in asymptoic algorithm analysis. OpenDSA Algorithm Analysis, Misconception
548 Asymptotic Analysis and Upper Bounds Exercise Question, Battery Battery of self-assessment questions about asymptotic analysis and upper bounds. OpenDSA Problem, Algorithm, Program
549 Introduction to Data Structures and Algorithms Review Questions Question, Battery Data Structures introduction battery of self-assessment questions. OpenDSA Data Structures
550 Equivalence Relations: Review Questions Question, Battery Equivalence relations self-assessment questions. OpenDSA Insertion Sort
551 Partial Orders: Review Questions Question, Battery Partial orders self-assessment questions. OpenDSA Insertion Sort
552 Set Relations: Review Questions Question, Battery Set relations self-assessment questions. OpenDSA Insertion Sort
553 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
554 Binary Search Tree Summary Questions Question, Battery Self-practice questions about Binary Search Trees. OpenDSA Binary Search Tree
555 Complete Binary Tree Calculation Questions Calculation Exercise, Battery Self-practice questions requiring user to calcuate node positions and values in an array representation for a complete binary tree. OpenDSA Linked List
556 Binary Tree Definition Calculation Questions Question, Battery, Calculation Exercise Self-practice questions about binary tree terminology that require calculation of quantities such as node counts and tree heights. OpenDSA Binary Tree
557 Heap Practice Questions Question, Battery Self-practice questions about heaps. OpenDSA Heap
558 Huffman Coding Proficiency Exercise Tracing Exercise Practice profiency exercise for Huffman Coding Trees. User must do actions like show the codes for a string, or vice... OpenDSA Huffman Coding Tree
559 Binary Tree Traversal Summary Questions Question, Battery Self-practice questions about binary tree traversals. OpenDSA Binary Tree Traversal
560 Tree Implementation Overhead Exercise Calculation Exercise, Battery Self-practice questions that require the user to calculate overhead fractions for various binary tree node implementations. OpenDSA Binary Tree, Overhead
561 Binary Tree Terminology Practice Questions Question, Battery Self-practice questions about binary tree terminology that require calculation of quantities such as descendants and tree heights. OpenDSA Binary Tree
562 Data types concept map: Review Questions Question, Battery, Concept Map Self-assessment question battery about the data types concept map. OpenDSA Data Type, Abstract Data Type
563 Graph Concept Practice Questions Question, Battery, Concept Map Self-assessment question battery about graphs, using a concept map. OpenDSA Graph
564 Object-oriented programming concept map: Review Questions Question, Battery, Concept Map Self-assessment question battery about the object-oriented programming concept map. OpenDSA Object-Oriented Programming
565 Pointers concept map: Review Questions Question, Battery, Concept Map Self-assessment question battery about the pointers concept map. OpenDSA Pointer
566 Comparison Review Questions Question, Battery A battery of self-assessment questions on comparators and design issues related to comparing records. OpenDSA Record Comparison, Comparator
567 Dictionary ADT Review Questions Question, Battery A battery of self-assessment questions on the Dictionary ADT. OpenDSA Dictionary, Abstract Data Type
568 Design Patterns Review Questions Question, Battery A battery of self-assessment questions on design patterns. OpenDSA Design Pattern
569 ADT Introduction Review Questions Question, Battery Self-assessment question battery about data types. OpenDSA Data Type, Abstract Data Type
570 CFG Associativity Exercise: Alternate Question, Battery A collection of self-practice questions where users evaluate a mathematical expression and deterimine if the grammar enforces correct associativity. Alternate... OpenDSA Context-Free Grammar, Ambiguity
571 Characterizing Languages Exercise 1: Alternate Question Exercise on how to characterize the strings in the language for a given grammar on a's and b's. Alternate version. OpenDSA Language, Grammar
572 Characterizing Languages Exercise 2: Alternate Question Users characterize the strings in the language for a given grammar on palindromes. OpenDSA Language, Grammar
573 Language from CFG Exercise: Alternate Question, Battery A collection of self-practice questions where users select a language description for a given CFG. Alternate version. OpenDSA Context-Free Grammar
574 CFG Determining Ambiguity Exercise: Alternate Question, Battery A collection of self-practice questions where users determine whether a given CFG is ambiguous or not. Alternate version. OpenDSA Context-Free Grammar, Ambiguity
575 CFG Expression Evaluation Exercise: Alternate Question, Battery A collection of self-practice questions where users evaluate a mathematical expression under the definition of a given CFG. Alternate version. OpenDSA Context-Free Grammar, Ambiguity
576 Extended BNF Exercise: Alternate Question, Battery A collection of self-practice questions where users select extended BNF statements matching a normal set of BNF statements. Alternate version. OpenDSA Context-Free Grammar
577 Determining Number of Parse Tree Nodes Exercise: Alternate Calculation Exercise, Battery User determines the number of nodes in a parse tree generated by a given string on a given grammar. Alternative... OpenDSA Context-Free Grammar, Parse Tree
578 CFG Ambiguity 1 Exercise: Alternate Question, Battery A collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. OpenDSA Context-Free Grammar, Ambiguity
579 CFG Ambiguity 2 Exercise: Alternate Question, Battery A second collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. OpenDSA Context-Free Grammar, Ambiguity
580 CFG Ambiguity 3 Exercise: Alternate Question, Battery A third collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. OpenDSA Context-Free Grammar, Ambiguity
581 CFG Precedence and Associativity Exercise: Alternate Question, Battery A collection of self-practice questions where users evaluate a mathematical expression and deterimine if the grammar enforces correct precedence and... OpenDSA Context-Free Grammar, Ambiguity
582 Determining Whether a Given String is Derivable from Given Grammar Exercise: Alternate Calculation Exercise, Battery A collection of self-practice questions where users determine which strings can or cannot be derived from a given grammar: Alternate. OpenDSA Context-Free Grammar, Parse Tree
583 Alternative Binary Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given binary tree. This representation marks internal nodes. OpenDSA Sequential Representation, Binary Tree
584 Full Binary Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given full binary tree. The representation uses a bit vector to deduce... OpenDSA Sequential Representation, Full Binary Tree
585 General Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given general tree. OpenDSA Sequential Representation, General Tree
586 Binary Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given binary tree. OpenDSA Sequential Representation, Binary Tree
587 Graph Introductory Practice Questions Question, Battery Self-practice questions related to graph terminology and representation. OpenDSA Graph Representation
588 Space Requirements for Graph Representations Exercise Calculation Exercise User must calculate the space requirements for a specified graph representation scenario. OpenDSA Graph Representation
589 Birthday Calculator Exercises Calculation Exercise User must use the birthday calculator to determine the smallest number of inserts into a hash table of a specified... OpenDSA Hashing, Collision Resolution
590 Hash Cost Analysis Summary Practice Questions Question, Battery A collection of self-practice questions on hashing cost analysis. OpenDSA Hashing Cost Analysis
591 Alternate Form Bucket Hashing Proficiency Exercise Tracing Exercise User must give the result from a series of inserts using bucket hashing. This version uses a variation on bucket... OpenDSA Bucket Hashing
592 Bucket Hashing Proficiency Exercise Tracing Exercise User must give the result from a series of inserts using bucket hashing. The user clicks on an array to... OpenDSA Bucket Hashing
593 Hashing Chapter Summary Practice Questions Question, Battery A collection of self-practice questions for the entire Hashing chapter. OpenDSA Hashing
594 Hash Deletion Summary Practice Questions Question, Battery A collection of self-practice questions on hash table deletion. OpenDSA Hashing
595 Double Hashing Proficiency Exercise Tracing Exercise User must show the result of doing a series of inserts using double hashing. The user indicates which position in... OpenDSA Collision Resolution
596 Hash Functions Exercises Calculation Exercise User must give the result of a specified hash function on a specified input. Where appropriate, user is expected to... OpenDSA Hash Function
597 Hash Functions Summary Practice Questions Question, Battery A collection of self-practice questions on hash functions. OpenDSA Hash Function
598 Linear Probing Proficiency Exercise Tracing Exercise User must give the result from a series of inserts using linear probing collision resolution. The user clicks on an... OpenDSA Linear Probing
599 Linear Hashing with Steps Proficiency Exercise Tracing Exercise User must show the result of doing a series of inserts using linear probing with steps. The user indicates which... OpenDSA Collision Resolution
600 Pseudo-Random Probing Proficiency Exercise Tracing Exercise User must show the result of doing a series of inserts -- OpenDSA Collision Resolution
601 Quadratic Probing Proficiency Exercise Tracing Exercise User must show the result of doing a series of inserts using quadratic probing. The user indicates which position in... OpenDSA Collision Resolution
602 Open Hashing Proficiency Exercise Tracing Exercise User must show the result of doing a series of inserts using open hashing. The user indicates which position in... OpenDSA Open Hashing
603 Choosing the Best Indexing Method Question, Battery Self-test question battery on which is the best indexing choice for a given scenario. OpenDSA Tree-Based Indexing
604 Tree Indexing Proficiency Exercise Question, Battery Tree-based indexing proficiency exercise. User indicates the number of disk pages visited for a given tree. OpenDSA Tree-Based Indexing
605 Inheritance and Polymorphism: Course Grading Policy Question, Battery Intro to Software Design (CS1) course grading policy review questions OpenDSA Software Design
606 Arrays Introduction Review Questions Question, Battery CS1-level introduction to arrays review questions. OpenDSA Array
607 Iterating with Arrays Review Questions Question, Battery CS1-level iterating over arrays review questions. OpenDSA Array, For-Each Loop
608 Arrays Module Review Questions Question, Battery CS1-level introduction to arrays module review questions. OpenDSA Array, For-Each Loop
609 2D Arrays Review Questions Question, Battery CS1-level introduction to 2D arrays review questions. OpenDSA Array
610 Iterating with 2D Arrays Review Questions Question, Battery CS1-level interating with 2D arrays review questions. OpenDSA Array
611 Modulus Review Questions Question, Battery CS1-level introduction to modulus review questions. OpenDSA Modulus
612 Java Output Review Questions Question, Battery CS1-level introduction to output in Java review questions. OpenDSA File Processing
613 Java Input Review Questions Question, Battery CS1-level introduction to Java input review questions. OpenDSA File Processing, Scanner
614 Java Testing Review Questions Question, Battery CS1-level review questions on file I/O testing in Java. OpenDSA Testing
615 Variable Scope Review Questions Question, Battery CS1-level introduction to variable scope review questions. OpenDSA Variable Scope
616 Java Sets Review Questions Question, Battery CS1-level review questions on sets in Java. OpenDSA Set
617 Java Maps Review Questions Question, Battery CS1-level review questions on maps in Java. OpenDSA Map
618 Main Method Review Questions Question, Battery CS1-level review questions on the main method in Java. OpenDSA Main Method
619 Static Keyword Review Questions Question, Battery CS1-level review questions on the static keyword in Java. OpenDSA Static
620 Throwing Exceptions Review Questions Question, Battery CS1-level review questions on exception handling in Java. OpenDSA Exception
621 Try/Catch Blocks Review Questions Question, Battery CS1-level review questions on try/catch blocks in Java. OpenDSA Exception
622 Introduction Chapter for CS1: Review Questions 1 Question, Battery Intro to Software Design Week 1 battery of self-assessment questions: Micro-Worlds OpenDSA Software Design
623 Introduction Chapter for CS1: Review Questions 2 Question, Battery Intro to Software Design Week 1 battery of self-assessment questions: Turning micro-worlds into code. OpenDSA Software Design
624 Introduction Chapter for CS1: Week 1 Reading Quiz Question, Battery Intro to Software Design Week 1 battery of self-assessment questions: Programming Concepts. OpenDSA Software Design
625 Inheritance and Polymorphism: Review Questions 1 Question, Battery Inheritance and Polymorphism battery of self-assessment questions: Working with Jeroos. OpenDSA Subclass
626 Inheritance and Polymorphism: Review Questions 2 Question, Battery Inheritance and Polymorphism battery of self-assessment questions: Working class hierarchy and inheritance OpenDSA Class Hierarchy, Inheritance
627 Inheritance and Polymorphism: Review Questions 3 Question, Battery Inheritance and Polymorphism battery of self-assessment questions: Developing algorithms. OpenDSA Class Hierarchy, Inheritance
628 Inheritance and Polymorphism: Review Questions 4 Question, Battery Inheritance and Polymorphism battery of self-assessment questions: Writing methods. OpenDSA Method
629 Inheritance and Polymorphism: Chapter Summary Review Question, Battery Inheritance and Polymorphism battery of self-assessment questions: Chapter review summary. OpenDSA Inheritance, Polymorphism
630 Conditional statements: Working with If-Then-Else Statements Question, Battery Conditional Statement self-assessment questions: Working with if-then-else statements. OpenDSA Conditional Statement
631 Conditional statements: Working with If-Then Statements 2 Question, Battery Conditional Statement self-assessment questions: Working with if-then-else statements second quiz. OpenDSA Conditional Statement
632 Conditional statements: Using the Right Conditional Statement Question, Battery Conditional Statement self-assessment questions: Deciding when to use each type of conditional structure. OpenDSA Conditional Statement
633 Boolean Operators: AND, OR, NOT Question, Battery Boolean Operator self-assessment questions: AND, OR, NOT. OpenDSA Boolean Operator, Conditional Statement
634 Working with While Loops Review Questions Question, Battery While Loops self-assessment questions. OpenDSA While Loop
635 Conditional Statements and While Loops: Chapter Review Question, Battery Chapter review questions for conditional statements and while loops. OpenDSA While Loop, Conditional Statement
636 Software Testing Concepts Review Questions Question, Battery Software Testing self-assessment questions. OpenDSA Software Testing
637 Understanding Method Signatures Review Questions Question, Battery Understanding method signatures self-assessment questions. OpenDSA Method, Signature
638 Methods with Parameters Review Questions Question, Battery Understanding methods with parameters self-assessment questions. OpenDSA Method, Parameter
639 Logical Equivalence Review Questions Question, Battery Logical equivalence self-assessment questions. OpenDSA Boolean Operator, Boolean Expression
640 Chapter Review Questions: Software Testing Question, Battery Software testing for CS1 self-assessment questions. OpenDSA Boolean Operator, Boolean Expression
641 Variables Review Quiz Question, Battery Variables for CS1 self-assessment questions. OpenDSA Variable
642 Scope Review Quiz Question, Battery Scope for CS1 self-assessment questions. OpenDSA Scope
643 Getters and Setters Review Quiz Question, Battery Getters and Setters for CS1 self-assessment questions. OpenDSA Getters, Setters
644 Methods and Return Statements Review Quiz Question, Battery Methods and return statement for CS1 self-assessment questions. OpenDSA Method, Return Statement
645 For-each Loop Statement Module Review Quiz Question, Battery For-each statement module review questions for CS1. OpenDSA For-Each Loop
646 For-each Loop Statement Review Quiz Question, Battery For-each statement for CS1 self-assessment questions. OpenDSA For-Each Loop
647 Strings Review Quiz Question, Battery Strings introduction for CS1 review questions. OpenDSA String
648 Counter Controlled Loops Review Quiz Question, Battery Counter controlled loops for CS1 review questions. OpenDSA Loop
649 Random Numbers Review Quiz Question, Battery Random Numbers for CS1 review questions. OpenDSA Random Number
650 Method Overriding Review Quiz Question, Battery CS1 review questions: Method overriding. OpenDSA Method
651 Lists and ArrayList Class Review Quiz Question, Battery Introduction to lists and the ArrayList class for CS1 review questions. OpenDSA ArrayList Class
652 Nested For Loops Review Quiz Question, Battery Introduction to using nested for loops for CS1 review questions. OpenDSA For Loop
653 Interfaces Review Quiz Question, Battery Introduction to interfaces for CS1 review questions. OpenDSA Interface
654 Introduction to Lists Module Review Quiz Question, Battery Introduction to lists and nested for loops for CS1 review questions. OpenDSA List, For Loop
655 Generics Review Questions Question, Battery CS1-level review questions about generics. OpenDSA Generics
656 Loop Idioms Review Questions Question, Battery CS1 review questions about loop idioms. OpenDSA Loop
657 Null Keyword Review Questions Question, Battery CS1-level review questions about the Null keyword OpenDSA Null
658 Array-Based List Insertion Proficiency Exercise Tracing Exercise Array-based list interactive proficiency exercise. Users click on values in an array to show how insertion takes place. OpenDSA Array-Based List
659 Array-Based List Remove Proficiency Exercise Tracing Exercise Array-based list interactive proficiency exercise. Users click on values in an array to show how remove takes place. OpenDSA Array-Based List
660 Array-Based List Review Questions Question, Battery Array-based list battery of self-assessment questions. OpenDSA Array-Based List
661 Circular Array-Based Queue Dequeue Proficiency Exercise Tracing Exercise Array-based queue dequeue proficiency exercise. Users click on values in a circular array display to show how dequeue takes place. OpenDSA Array-Based Queue
662 Circular Array-Based Queue Enqueue Proficiency Exercise Tracing Exercise Array-based queue enqueue proficiency exercise. Users click on values in a circular array display to show how enqueue takes place. OpenDSA Array-Based Queue
663 Array-Based Stacks Pop Proficiency Exercise Tracing Exercise Array-based stack pop proficiency exercise. Users click on values in a linked list display to show how pop takes place. OpenDSA Array-Based Stack
664 Array-Based Stack Push Proficiency Exercise Tracing Exercise Array-based stack push proficiency exercise. Users click on values in a linked list display to show how push takes place. OpenDSA Array-Based Stack
665 Linear Structures Chapter Summary Questions Question, Battery Self-practice questions related to all aspects of lists, stacks, and queues. OpenDSA List, Stack, Queue
666 Linear Data Structures Summary Questions Question, Battery Self-practice questions comparing uses of linear structures. OpenDSA List, Stack, Queue
667 List Implementation Overhead Exercise Calculation Exercise, Battery User provides overhead computations for specified implementations. OpenDSA Linked List, Array-Based List, Overhead, List Implementation Comparison
668 General List Summary Questions Question, Battery Summary self-practice questions on lists. OpenDSA List
669 Linked List Insertion Proficiency Exercise Tracing Exercise Linked list insert interactive proficiency exercise. Users click on values in a linked list display to show how insertion takes... OpenDSA Linked List
670 Linked List Remove Proficiency Exercise Tracing Exercise Linked list remove interactive proficiency exercise. Users click on values in a linked list display to show how remove takes... OpenDSA Linked List
671 Linked List Summary Questions Question, Battery Self-practice questions about linked list costs. OpenDSA Linked List
672 Linked Queue Dequeue Proficiency Exercise Tracing Exercise Linked queue dequeue proficiency exercise. Users click on values in a linked queue display to show how dequeue takes place. OpenDSA Linked Queue
673 Linked Queue Enqueue Proficiency Exercise Tracing Exercise Linked queue enqueue proficiency exercise. Users click on values in a linked queue display to show how enqueue takes place. OpenDSA Linked Queue
674 Linked Stack Pop Proficiency Exercise Tracing Exercise Linked stack pop proficiency exercise. Users click on values in a linked list display to show how pop takes place. OpenDSA Linked Stack
675 Linked Stack Push Proficiency Exercise Tracing Exercise Linked stack push proficiency exercise. Users click on values in a linked list display to show how push takes place. OpenDSA Linked Stack
676 Stack and Queue Summary Questions Question, Battery Self-practice questions about stacks and queues. OpenDSA Stack, Queue
677 Clique Proficency Exercise Proficiency Exercise User must determine the largest clique in a given graph. OpenDSA Clique Problem
678 Hamiltonian Cycle Proficency Exercise Proficiency Exercise User must determine whether a given graph has a Hamiltonian cycle. OpenDSA Hamiltonian Cycle Problem
679 Independent Set Proficency Exercise Proficiency Exercise User must determine the largest independent set in a given graph. OpenDSA Independent Set Problem
680 3-Satisfiability Proficency Exercise Presentation Exercise User must determine whether a given 3-CNF expression has a satisfying truth assignment or not. OpenDSA Satisfiability Problem
681 Traveling Saleseman Proficency Exercise Proficiency Exercise User must determine the shortest complete cycle in a given graph. OpenDSA Traveling Salesman Problem
682 Vertex Cover Proficency Exercise Proficiency Exercise User must determine the smallest vertex cover in a given graph. OpenDSA Vertex Cover Problem
683 Abstract Syntax of SLang1 Question Question related to the abstract syntax of functional programming language SLang1. OpenDSA Functional Programming
684 Functional Programming: Accumulator Pattern Tracing Exercise, Battery A collection of self-practice questions related to the accumulator pattern. OpenDSA Functional Programming
685 Lambda Calculus: Alpha Conversion Calculation Exercise, Battery A collection of self-practice questions related to alpha conversion in the Lambda Calculus expression. OpenDSA Lambda Calculus
686 Annotating Jison Exercise Tracing Exercise A question where users determine the results of parsing a given collection of strings. OpenDSA Parser Generator
687 CFG Associativity Exercise Question A question where users evaluate a mathematical expression and deterimine if the grammar enforces correct associativity. OpenDSA Context-Free Grammar, Ambiguity
688 Lambda Calculus: Beta-Redex Question, Battery A collection of self-practice questions related to Beta-redexes in the Lambda Calculus. OpenDSA Lambda Calculus
689 Lambda Calculus: Beta-Redex and Alpha Conversion Question, Battery A collection of self-practice questions related to Beta-redexes with Alpha conversion in the Lambda Calculus. OpenDSA Lambda Calculus
690 Lambda Calculus: Performing Beta Reductions Question, Battery A collection of self-practice questions related to performing Beta-reduction in the Lambda Calculus. OpenDSA Lambda Calculus
691 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
692 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
693 Parameter Passing by Copy-Restore vs Macro vs Name Tracing Exercise A collection of self-practice questions to compare parameter passing by copy-restore vs macro vs name in language SLang2. OpenDSA Parameter Passing
694 Parameter Passing Comparison of Five Methods Tracing Exercise A collection of self-practice questions to compare parameter passing by five methods. OpenDSA Parameter Passing
695 Parameter Passing by Reference vs Copy-Restore vs Macro Tracing Exercise A collection of self-practice questions to compare parameter passing by reference vs copy-restore vs macro in language SLang2. OpenDSA Parameter Passing
696 Parameter Passing by Value vs Reference Exercise Tracing Exercise A collection of self-practice questions to compare parameter passing by value vs passing by reference in language SLang2. OpenDSA Parameter Passing
697 Parameter Passing by Value vs Reference Exercise vs Copy-Restore Tracing Exercise A collection of self-practice questions to compare parameter passing by value vs passing by reference vs copy-restore in language SLang2. OpenDSA Parameter Passing
698 Characterizing Languages Exercise 1 Question Exercise on how to characterize the strings in the language for a given grammar on a's and b's. OpenDSA Language, Grammar
699 Characterizing Languages Exercise 2 Question Exercise on how to characterize the strings in the language for a given grammar on palindromes. OpenDSA Language, Grammar
700 Language from CFG Exercise Question Users select a language description for a given CFG. OpenDSA Context-Free Grammar
701 Lambda Calculus: If-Then-Else in Church Encoding Question Question related to if-then-else in Church encoding in the Lambda Calculus. OpenDSA Lambda Calculus
702 Lambda Calculus: Church Numerals Tracing Exercise A collection of self-practice questions related to Church numerals in the Lambda Calculus. OpenDSA Lambda Calculus
703 Lambda Calculus: OR in Church Encoding Question Question related to OR in Church encoding in the Lambda Calculus. OpenDSA Lambda Calculus
704 Functional Programming Exercise: Functional Composition Tracing Exercise A question related to functional programming languages: functional composition. OpenDSA Functional Programming
705 Concrete Syntax of SLang1 Question, Battery A collection of self-practice questions related to the syntax of functional programming language SLang1. OpenDSA Functional Programming
706 Concrete Syntax of SLang1: 2 Question, Battery A second collection of self-practice questions related to the syntax of functional programming language SLang1. OpenDSA Functional Programming
707 Functional Programming: Continuation Passing Style 1 Question A question related to functional programming languages: Continuation Passing Style. OpenDSA Functional Programming
708 Functional Programming: Continuation Passing Style 2 Question A question related to functional programming languages: Continuation Passing Style. OpenDSA Functional Programming
709 Functional Programming: Continuation Passing Style 3 Question A third question related to functional programming languages: Continuation Passing Style. OpenDSA Functional Programming
710 Functional Programming: Continuation Passing Style 4 Question A fourth question related to functional programming languages: Continuation Passing Style. OpenDSA Functional Programming
711 Functional Programming: Curry 1 Question A question related to functional programming languages: curry 1. OpenDSA Functional Programming
712 Functional Programming: Curry 2 Question, Battery A collection of self-practice questions related to functional programming languages: curry 2. OpenDSA Functional Programming
713 Curry in SLang1 Question Question related to curry in the functional programming language SLang1. OpenDSA Functional Programming
714 Recursive Tree Processing: Value Summation Tracing Exercise A question related to tree processing in a functional programming language: Value summation. OpenDSA Functional Programming
715 Recursive Tree Processing: Substitution Question A question related to tree processing in a functional programming language: Substitution. OpenDSA Functional Programming
716 Recursive Tree Processing: Substitution 2 Question A question related to tree processing in a functional programming language: Substitution 2. OpenDSA Functional Programming
717 Recursive Tree Processing: Mystery Function Tracing Exercise, Battery A collection of self-practice questions related to tree processing in a functional programming language: Mystery Function. OpenDSA Functional Programming
718 CFG Determining Ambiguity Exercise Question A question where users determine whether a given CFG is ambiguous or not. OpenDSA Context-Free Grammar, Ambiguity
719 Determine Values Bound to a Variable in Environment Calculation Exercise, Battery A collection of self-practice questions related to determining values bound to a variable in environment of the functional programming language... OpenDSA Functional Programming
720 Expression Evaluation for SLang1 Calculation Exercise, Battery A collection of self-practice questions related to expression evaluation for the functional programming language SLang1. OpenDSA Functional Programming
721 Denoted Values in SLang1 Question, Battery A collection of self-practice questions related to denoted values in the functional programming language SLang1. OpenDSA Functional Programming
722 CFG Expression Evaluation Exercise Calculation Exercise, Battery A collection of self-practice questions where users evaluate a mathematical expression under the definition of a given CFG. OpenDSA Context-Free Grammar, Ambiguity
723 Extended BNF Exercise Question A question where users select extended BNF statements matching a normal set of BNF statements. OpenDSA Context-Free Grammar
724 Functional Programming: Filter Question A question related to functional programming languages: filter pattern. OpenDSA Functional Programming
725 Identifying Fixed Point Combinators Question, Battery A collection of self-practice questions related to identifying fixed point combinators in the Lambda Calculus. OpenDSA Lambda Calculus
726 Functional Programming: Cons Operator Tracing Exercise A question related to the cons operator. OpenDSA Functional Programming
727 Functional Programming: Cons, Hd, and Tl Tracing Exercise, Battery A collection of self-practice questions related to the cons, hd, and tl operators. OpenDSA Functional Programming
728 Functional Programming: Cons, Hd, and Tl, Exercise 2 Question A question related to the cons, hd, and tl operators. OpenDSA Functional Programming
729 Functional Programming: isEq Tracing Exercise A question related to the isEq operator. OpenDSA Functional Programming
730 Functional Programming: Higher Order Functions 1 Tracing Exercise A question related to functional programming languages: higher order functions. OpenDSA Functional Programming
731 Functional Programming: Higher Order Functions 2 Tracing Exercise A question related to functional programming languages: higher order functions. OpenDSA Functional Programming
732 Functional Programming: Higher Order Functions 3 Tracing Exercise A question related to functional programming languages: higher order functions. OpenDSA Functional Programming
733 Lambda Calculus: Bound Variables Calculation Exercise, Battery A collection of self-practice questions related to identifying bound variables in a Lambda Calculus expression. OpenDSA Lambda Calculus
734 Lambda Calculus: Free Variables Calculation Exercise, Battery A collection of self-practice questions related to identifying free variables in a Lambda Calculus expression. OpenDSA Lambda Calculus
735 Matching Sequence to Code Tracing Exercise User matches code to an output sequence. OpenDSA Parameter Passing
736 Writing Infinite Sequence Tracing Exercise User writes code to generate a given sequence. OpenDSA Parameter Passing
737 Sequences Code Output Exercise Tracing Exercise User shows the sequence generated by a given piece of code. OpenDSA Parameter Passing
738 Match Code to Output Exercise Tracing Exercise User shows the output generated by a given piece of code. OpenDSA Parameter Passing
739 Jison Grammar Exercise 1 Calculation Exercise A collection of self-practice questions where users calculate the number of strings parsed successfully by a given grammar. OpenDSA Parser Generator
740 Jison Grammar Exercise 2 Calculation Exercise A question where users calculate the number of strings parsed successfully by a given grammar. OpenDSA Parser Generator
741 Lambda Calculus: Semantics Question A collection of self-practice questions related to semantics of the Lambda Calculus. OpenDSA Lambda Calculus
742 Lambda Calculus: Syntax 1 Question, Battery A collection of self-practice questions related to syntax of the Lambda Calculus. OpenDSA Lambda Calculus
743 Lambda Calculus: Syntax 2 Question, Battery A second collection of self-practice questions related to syntax of the Lambda Calculus. OpenDSA Lambda Calculus
744 Nested Lets Tracing Exercise Code trace exercise for a program in imperative language SLang2. OpenDSA Functional Programming
745 Nested Lets with Closures Tracing Exercise Code trace exercise for a program in imperative language SLang2. OpenDSA Functional Programming
746 Nested Lets Syntax-Only Tracing Exercise Code trace exercise for a program in imperative language SLang2. OpenDSA Functional Programming
747 Functional Programming Exercise: Mapping Pattern Tracing Exercise A question related to functional programming languages: mapping pattern. OpenDSA Functional Programming
748 Functional Programming: Map Reduce Question A question related to functional programming languages: map reduce. OpenDSA Functional Programming
749 Determining Number of Parse Tree Nodes Exercise Calculation Exercise User determines the number of nodes in a parse tree generated by a given string on a given grammar. OpenDSA Context-Free Grammar, Parse Tree
750 CFG Ambiguity 1 Exercise Question A question where users determine whether a given string is parsed ambiguously or not. OpenDSA Context-Free Grammar, Parse Tree
751 CFG Ambiguity 2 Exercise Question A question where users determine whether a given string is parsed ambiguously or not. OpenDSA Context-Free Grammar, Ambiguity
752 CFG Ambiguity 3 Exercise Question A question where users determine whether a given string is parsed ambiguously or not. OpenDSA Context-Free Grammar, Ambiguity
753 Output of an SLang2 Program Tracing Exercise Code trace for a recursive program in imperative language SLang2. OpenDSA Functional Programming
754 CFG Precedence and Associativity Exercise Question A question where users evaluate a mathematical expression and deterimine if the grammar enforces correct precedence and associativity. OpenDSA Context-Free Grammar, Ambiguity
755 Functional Programming: Quicksort Tracing Exercise A question related to using split and join to implement Quicksort. OpenDSA Functional Programming
756 Recursive List Processing 1 Question A question related to list processing in a functional programming language. OpenDSA Functional Programming
757 Recursive List Processing 2 Question A question related to list processing in a functional programming language. OpenDSA Functional Programming
758 Recursive List Processing 3 Question A question related to list processing in a functional programming language. OpenDSA Functional Programming
759 Functional Programming: Reduce 1 Question A question related to functional programming languages: reduce pattern. OpenDSA Functional Programming
760 Functional Programming: Reduce and Map Question A question related to functional programming languages: reduce and map pattern. OpenDSA Functional Programming
761 Functional Programming: Reduce 2 Question, Battery A collection of self-practice questions related to functional programming languages: reduce pattern. OpenDSA Functional Programming
762 Semantics of SLang1 Question Question related to the semantics of the functional programming language SLang1. OpenDSA Functional Programming
763 Split anad Join with Accumulators Tracing Exercise A question related to split and join operations with accumulators in a functional programming language. OpenDSA Functional Programming
764 Functional Programming Exercise: Static vs Dynamic Binding Tracing Exercise A question related to functional programming languages: static vs. dynamic binding. OpenDSA Functional Programming
765 Determining Whether a Given String is Derivable from Given Grammar Exercise Question A question where users determine which strings can or cannot be derived from a given grammar. OpenDSA Context-Free Grammar, Parse Tree
766 Lambda Calculus: Substitution 1 Tracing Exercise, Battery A collection of self-practice questions related to substitution in the Lambda Calculus expression. OpenDSA Lambda Calculus
767 Lambda Calculus: Substitution 2 Tracing Exercise, Battery A second collection of self-practice questions related to substitution in the Lambda Calculus expression. OpenDSA Lambda Calculus
768 Lambda Calculus: Substitution Subcases 1 Question, Battery A collection of self-practice questions related to substitution subcases in the Lambda Calculus expression. OpenDSA Lambda Calculus
769 Lambda Calculus: Substitution Subcases 2 Question, Battery A second collection of self-practice questions related to substitution subcases in the Lambda Calculus expression. OpenDSA Lambda Calculus
770 Lambda Calculus: Substitution Subcases 3 Question, Battery A third collection of self-practice questions related to substitution subcases in the Lambda Calculus expression. OpenDSA Lambda Calculus
771 Functional Programming: Tail Recursion Question Question related to functional programming languages: tail recursion. OpenDSA Functional Programming
772 Efficient Recursion in SLang2 Tracing Exercise Code trace for a recursive program in imperative language SLang2. OpenDSA Functional Programming
773 ML Type Inferencing 1 Tracing Exercise A self-practice question where user matches a ML type inference with its code. OpenDSA Type
774 ML Type Inferencing 2 Tracing Exercise A self-practice question where user matches a ML type inference with its code. OpenDSA Type
775 ML Type Inferencing 3 Tracing Exercise A self-practice question where user matches a ML type inference with its code. OpenDSA Type
776 ML Type Inferencing 4 Tracing Exercise A self-practice question where user matches a ML type inference with its code. OpenDSA Type
777 ML Type Inferencing 5 Tracing Exercise A self-practice question where user matches a ML type inference with its code. OpenDSA Type
778 ML Type Inferencing 6 Tracing Exercise A self-practice question where user matches a ML type inference with its code. OpenDSA Type
779 Practicing Pointers 1 Tracing Exercise Pointer assignment proficiency exercise. Users click on objects to show how pointers should be updated. OpenDSA Pointer, Object
780 Practicing Pointers 2 Tracing Exercise Second pointer assignment proficiency exercise. Users click on objects to show how pointers should be updated. OpenDSA Pointer, Object
781 Practicing Pointers: Links Tracing Exercise Third pointer assignment proficiency exercise. Users click on objects to show how pointers link nodes together into a linked list. OpenDSA Pointer, Object
782 Recursion Tutor: Chapter Summary Question, Battery Recursion tutorial chapter summary practice question set. OpenDSA Recursion
783 Recursive Code Tracing Exercise: Backward Flow Tracing Exercise Recursive Code Tracing Exercise collection focusing on backward flow of information. OpenDSA Recursion
784 Recursive Code Tracing Exercise: Function Errors Tracing Exercise Recursive Code Tracing Exercise collection focusing on recognizing errors. OpenDSA Recursion
785 Recursive Code Tracing Exercise: Forward Flow Tracing Exercise Recursive Code Tracing Exercise collection focusing on foward flow of information. OpenDSA Recursion
786 Recursive Code Tracing Exercise: Harder Exercises Tracing Exercise Recursive Code Tracing Exercise collection with some harder tracing exercises. OpenDSA Recursion
787 Recursive Code Tracing Exercise: Call Count Tracing Exercise Recursive Code Tracing Exercise collection focusing on counting the number of function calls made. OpenDSA Recursion
788 Recursive Code Tracing Exercise: Two Recursive Calls Tracing Exercise Recursive Code Tracing Exercise collection focusing on functions with two recursive calls. OpenDSA Recursion
789 FFT Algorithm Proficiency Exercise Tracing Exercise Proficiency exercise for the Fast Fourier Transform algorithm. OpenDSA Polynomial Multiplication, Fast Fourier Transform
790 Nth Root of Unity Review Questions Question, Battery Battery of self-assessment questions on the concept of the nth root of unity. OpenDSA Polynomial Multiplication, Fast Fourier Transform
791 Polynomial Multiplication and Evaluation Review Questions Question, Battery Polynomial multiplication concepts battery of self-assessment questions. OpenDSA Transform, Polynomial Multiplication, Polynomial Evaluation
792 Bubble Sort Proficiency Exercise Tracing Exercise Bubble Sort interactive proficiency exercise. Users click on values in an array to move them around as Bubble Sort would. OpenDSA Bubble Sort
793 Bubble Sort: Review Questions Question, Battery Bubble Sort battery of self-assessment questions. OpenDSA Bubble Sort
794 Exchange Sorts: Review Questions Question, Battery Exchange Sorting battery of self-assessment multiple choice questions. OpenDSA Insertion Sort
795 Count Inversions Proficiency Exercise Calculation Exercise Proficiency exercise to count the number of inversions in an array. OpenDSA Exchange Sort, Inversion
796 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
797 Heapsort: Review Questions Question, Battery Heapsort battery of self-assessment questions. OpenDSA Heapsort
798 Insertion Sort proficiency exercise Tracing Exercise Insertion Sort interactive proficiency exercise. Users click on values in an array to move them around as Insertion Sort would. OpenDSA Insertion Sort
799 Insertion Sort: Review Questions Question, Battery Insertion Sort battery of self-assessment questions. OpenDSA Insertion Sort
800 Megesort Merging Proficiency Exercise Tracing Exercise Proficiency exercise for the Mergesort merge step. User must indicate what values are merged into the results array. OpenDSA Mergesort
801 Mergesort: Review Questions Question, Battery Mergesort battery of self-assessment questions. OpenDSA Mergesort
802 Quicksort Partition Proficiency Exercise Tracing Exercise Proficiency exercise for the Quicksort partition step. User must reproduce the series of steps taken during the Quicksort partition operation.. OpenDSA Quicksort
803 Quicksort Pivot Proficiency Exercise Tracing Exercise Proficiency exercise for the Quicksort pivot. User must indicate which value in the array is used as the pivot. OpenDSA Quicksort
804 Quicksort: Review Questions Question, Battery Quicksort battery of self-assessment questions. OpenDSA Quicksort
805 Radix Sort Profiency Exercise Tracing Exercise Proficiency exercise for a pass of the Radix Sort algorithm. User must indicate how values in one array are moved... OpenDSA Quicksort
806 Radix Sort: Review Questions Question, Battery Radix Sort battery of self-assessment questions. OpenDSA Radix Sort
807 Selection Sort Sort Proficiency Exercise Tracing Exercise Selection Sort interactive proficiency exercise. Users click on values in an array to move them around as Selection Sort would. OpenDSA Selection Sort
808 Selection Sort: Review Questions Question, Battery Selection Sort battery of self-assessment questions. OpenDSA Selection Sort
809 Shellsort: Legal Series Questions Question, Battery Shellsort battery of self-assessment questions about whether a given diminishing increment series is legal for Shellsort. OpenDSA Shellsort
810 Shellsort Proficiency Exercises Tracing Exercise Shellsort proficiency exercises. User clicks on array cells to reproduce the behavior of Shellsort. OpenDSA Shellsort
811 Shellsort: Review Questions Question, Battery Shellsort battery of self-assessment questions. OpenDSA Shellsort
812 Sort Comparison Summary Exercise Question, Battery Battery of self-assessment questions where user selects which sort is the best to use in a particular situation. OpenDSA Radix Sort
813 Sorting Lower Bound Summary Questions Question, Battery Battery of self-assessment questions related to the lower bounds proof for the general sorting problem. OpenDSA Sorting Problem Lower Bound
814 Sorting Chapter Summary Questions Question, Battery Battery of self-assessment questions for the entire Sorting chapter. OpenDSA Sorting
815 Sorting Introduction: Summary Questions Question, Battery Sorting introduction battery of self-assessment multiple choice questions. OpenDSA Sorting Notation
816 Best, Worst, and Average cases slideshow Presentation Slideshow illustrating analysis when there are different inputs of a given size. OpenDSA Problem, Algorithm, Program
817 Simple analysis cases slideshow Presentation Slideshow illustrating analysis when there is only one input of a given size. OpenDSA Problem, Algorithm, Program
818 Binary Search Algorithm Worst Case Analysis Recurrence Visualization Algorithm Analysis Presentation Slideshow illustrating Binary Search worst case analysis through analysis of its recurrence relation. OpenDSA Binary Search, Algorithm Analysis, Recurrence Relation
819 Lower Bounds Misconceptions Presentation Slideshow illustrating lower bounds analysis and discussing various associated misconceptions. OpenDSA Problem, Algorithm, Program
820 Misunderstanding Examples: Graph Visualization Presentation Slideshow illustrating various growth rate behaviors. OpenDSA Problem, Algorithm, Program
821 Problem, Algorithm, and Program definitions Presentation Slideshow illustrating the differences between problems, algorithms, and programs. OpenDSA Problem, Algorithm, Program
822 Misconceptions Related to Upper Bounds Presentation Slideshow illustrating various misconceptions that can occur related to upper bounds asymptotic analysis. OpenDSA Problem, Algorithm, Program
823 Summation of the first N integers visualization Presentation Slideshow showing how to calculate the closed form for the summation of the first N integers. OpenDSA Summation
824 Typical Mistakes During Tree Traversal Code Tracing Presentation Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. OpenDSA Preorder Traversal
825 BST Delete Max Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive delete of the maximum value in a BST. OpenDSA Binary Search Tree
826 BST Insert Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive insert in a BST. OpenDSA Binary Search Tree
827 BST Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive remove value in a BST. OpenDSA Binary Search Tree
828 BST Search Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive search in a BST. OpenDSA Binary Search Tree
829 Traverse an expression tree Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating traversal of an expression tree. The primary point is to highlight the node implementation for a full binary... OpenDSA Expression Tree, Binary Tree Traversal, Full Binary Tree
830 Heap Inefficient Build Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing a naive heap building algorithm. OpenDSA Heap
831 Heap Build Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing the efficient heap buiding algorithm. OpenDSA Heap
832 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
833 Heap Insert Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing insert into a heap. OpenDSA Heap
834 Heap Max Remove Slideshow Algorithm Visualization Slideshow visualizing heap update when removing the max value from a maxheap. OpenDSA Heap
835 Heap Remove Slideshow Algorithm Visualization Slideshow visualizing heap update when removing a specified value from a heap. OpenDSA Heap
836 Huffman Coding Tree Slideshow: Build Algorithm Visualization Slideshow visualizing the Huffman Coding Tree construction algorithm: Building the tree from a collection of weighted elements. OpenDSA Huffman Coding Tree
837 Huffman Coding Tree Slideshow: Setting Codes Algorithm Visualization Slideshow visualizing the Huffman Coding Tree code setting step. OpenDSA Huffman Coding Tree
838 Huffman Coding Tree Slideshow: Decoding Algorithm Visualization Slideshow visualizing the process of decoding a string of Huffman Codes. OpenDSA Huffman Coding Tree
839 Huffman Coding Tree Slideshow: Label Edges Algorithm Visualization Slideshow visualizing the Huffman Coding Tree edge labeling step. OpenDSA Huffman Coding Tree
840 Inorder Traversal Shown in Detail Algorithm Visualization, Code Tracing Presentation Slideshow presenting a detailed visualization of inorder traversal of a binary tree and how the recursion works. OpenDSA Inorder Traversal
841 Postorder Traversal Shown in Detail Algorithm Visualization, Code Tracing Presentation Slideshow presenting a detailed visualization of postorder traversal of a binary tree and how the recursion works. OpenDSA Postorder Traversal
842 Preorder Traversal Shown in Detail Algorithm Visualization, Code Tracing Presentation Slideshow presenting a detailed visualization of preorder traversal of a binary tree and how the recursion works. OpenDSA Preorder Traversal
843 Recursive Operations in a Binary Tree Presentation Slideshow discussing recursive operations on a binary tree. OpenDSA Array-Based Stack
844 Tree Timeline Slideshow Algorithm Visualization Slideshow showing the concept of marking a timeline for the values stored in a BST. This will be contrasted with... OpenDSA Trie
845 Trie Timeline Slideshow Algorithm Visualization Slideshow showing the concept of marking a timeline for the values stored in a Trie decomposition version of a BST. OpenDSA Trie
846 Binary Insertion Sort Slideshow Algorithm Visualization Slideshow introducing the concept of using binary search to find the insert location of the next record during Insertion Sort.... OpenDSA Binary Insertion Sort
847 Merge Insertion Sort Slideshow Algorithm Visualization Slideshow sketching the Merge Insertion Sort, or Ford and Johnson sort. OpenDSA Merge Insertion Sort, Ford, Johnson Sort
848 Inefficient Range Query in a BST Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing a range query implementation in a BST, contrasting an inefficient and an efficient implementation. OpenDSA Binary Search Tree
849 Buffer Pool Introduction Slideshow Algorithm Visualization Slideshow showing an introduction to buffer pools. OpenDSA Buffer Pool
850 Motivation for External Sorting Slideshow Algorithm Visualization Slideshow illustrating standard Mergesort does not make for an optimal external sorting algorithm. OpenDSA File Processing, External Sorting
851 Mergesort Modified for External Sorting Algorithm Visualization Slideshow illustrating simple modifications to Mergesort to make a better external sorting algorithm. OpenDSA File Processing, External Sorting, Mergesort
852 Multiway Merge Slideshow Algorithm Visualization Slideshow illustrating multiway merge in an external sorting algorithm. OpenDSA File Processing, External Sorting, Mergesort, Multiway Merge
853 External Replacement Selection Slideshow Algorithm Visualization Slideshow illustrating the replacement selection algorithm, used for external sorting. OpenDSA File Processing, External Sorting, Replacement Selection
854 LRU Introduction Slideshow Algorithm Visualization Slideshow illustrating the Least Recently Used replacement heuristic. OpenDSA Buffer Pool, Least Recently Used
855 LRU Replacement with Write Slideshow Algorithm Visualization Slideshow illustrating optimizing the Least Recently Used replacement heuristic by use of a dirty bit to minimize unnecessary writes. OpenDSA Buffer Pool, Least Recently Used, Dirty Bit
856 General Tree Postorder Traversal Slideshow Algorithm Visualization Slideshow showing postorder traveral of a general tree, and demonstrates the general tree ADT. OpenDSA General Tree
857 General Tree Preorder Traversal Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow showing preorder traveral of a general tree, and demonstrates the general tree ADT. OpenDSA General Tree
858 Union/Find with Path Compression Examaple Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating the path compression optimization for Union/Find. Shows the parent pointer representation used to maintain the set information. OpenDSA Union/Find Algorithm, Disjoint Set
859 General Tree Serialization Slideshow Algorithm Visualization Slideshow how to reconstruct a general tree from a serialized representation of its node values. OpenDSA Serialization, Binary Tree
860 Binary Tree Serialization Slideshow: Internal Node Mark Bits Algorithm Visualization Slideshow how to reconstruct a binary tree from a serialized representation of its node values. Alternative representation using mark bits... OpenDSA Serialization, Binary Tree
861 Full Binary Tree Serialization Slideshow: Mark Bits Algorithm Visualization Slideshow how to reconstruct a full binary tree from a serialized representation of its node values. All that is needed... OpenDSA Serialization, Binary Tree
862 Binary Tree Serialization Slideshow Algorithm Visualization Slideshow how to reconstruct a binary tree from a serialized representation of its node values. OpenDSA Serialization, Binary Tree
863 Union/Find Examaple Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating processing of a series of union operations on a collection of disjoint sets. Shows the parent pointer representation... OpenDSA Union/Find Algorithm, Disjoint Set
864 Breadth-first graph traversal slideshow Algorithm Visualization Slideshow demonstrating the breadth-first search algorithm for traversing a graph. OpenDSA Breadth-First Search
865 Depth-first graph traversal slideshow Algorithm Visualization Slideshow demonstrating the depth-first search algorithm for traversing a graph. OpenDSA Depth-First Search
866 Dijkstra's Single-Source Shortest Paths Algorithm Algorithm Visualization Slideshow demonstrating the Dijkstra's single-source shortest paths algorithm. OpenDSA Shortest Path Problem
867 Kruskal's Minimal-Cost Spanning Tree Algorithm slideshow Algorithm Visualization Slideshow demonstrating Kruskal's algorithm for constructing the minimal cost spanning tree for a graph. OpenDSA Minimal-Cost Spanning Tree
868 Prim's Minimal-Cost Spanning Tree Algorithm slideshow Algorithm Visualization Slideshow demonstrating Prim's algorithm for constructing the minimal cost spanning tree for a graph. OpenDSA Minimal-Cost Spanning Tree
869 Depth-First Topological Sort Slideshow Algorithm Visualization Slideshow demonstrating the depth-first topological sort algorithm. OpenDSA Topological Sort
870 Queue-Based Topological Sort Slideshow Algorithm Visualization Slideshow demonstrating the queue-based topological sort algorithm. OpenDSA Topological Sort
871 Bucket Hashing Slideshow Algorithm Visualization Slideshow showing the basic hash method of hashing to any free position within a computed bucket. OpenDSA Bucket Hashing
872 Alternate Bucket Hashing Slideshow Algorithm Visualization Slideshow showing a variation on bucket hashing where the key hashes to a slot in the table, and overflows to... OpenDSA Bucket Hashing
873 Linear Probing With Steps Slideshow Algorithm Visualization Slideshow showing linear probing with steps collision resolution. OpenDSA Collision Resolution
874 Improved Linear Probing With Steps Slideshow Algorithm Visualization Slideshow showing how the table size and step size affects linear probing with steps collision resolution. OpenDSA Collision Resolution
875 Pseudo-Random Probing Slideshow Algorithm Visualization Slideshow demonstrating pseudo-random probing collision resolution. OpenDSA Collision Resolution
876 Pseudo-Random Probing Effectiveness Slideshow Algorithm Visualization Slideshow demonstrating why pseudo-random probing helps with collision resolution. OpenDSA Collision Resolution
877 Quadratic Probing Slideshow Algorithm Visualization Slideshow demonstrating quadratic probing collision resolution. OpenDSA Collision Resolution
878 Quadratic Probing Problems Slideshow Algorithm Visualization Slideshow demonstrating how quadratic probing does not always visit all slots of the hash table during collision resolution. OpenDSA Collision Resolution
879 Double Hashing Introduction Slideshow Algorithm Visualization Slideshow demonstrating double hashing collision resolution. OpenDSA Collision Resolution
880 Alternate Double Hashing Slideshow Algorithm Visualization Slideshow demonstrating an alternate version of double hashing collision resolution. OpenDSA Collision Resolution
881 Hash Table Deletion Slideshow Algorithm Visualization Slideshow showing deletion from a hash table. OpenDSA Hashing
882 The mod Hash Function Algorithm Visualization Slideshow showing the basic mod function as a hash function. OpenDSA Hash Function
883 The Binning Hash Function Algorithm Visualization Slideshow showing basic binning (using high-order digits) as a hash function. OpenDSA Hash Function
884 Introduction to Hashing Slideshow Algorithm Visualization Slideshow showing the simplest of hashing approaches: Just put a key into that array position. OpenDSA Hashing
885 Linear Probing Introduction Slideshow Algorithm Visualization Slideshow showing a basic linear probing collision resolution. OpenDSA Collision Resolution
886 Linear Probing Bad Performance Slideshow Algorithm Visualization Slideshow showing why linear probing is a poor method of collision resolution. OpenDSA Collision Resolution
887 Building a B+ Tree of Degree 5 Algorithm Visualization Slideshow showing a series of insert operations in a B+ Tree of degree 5. OpenDSA Tree-Based Indexing, B-Tree
888 Building a B+ Tree of Degree 4 Algorithm Visualization Slideshow showing a series of insert operations in a B+ Tree of degree 4. OpenDSA Tree-Based Indexing, B-Tree
889 Deletion from a B+ Tree of Degree 4 Algorithm Visualization Slideshow showing a series of delete operations in a B+ Tree of degree 4. OpenDSA Tree-Based Indexing, B-Tree
890 Search in a B+ Tree of Degree 4 Algorithm Visualization Slideshow showing a series of search operations in a B+ Tree of degree 4. OpenDSA Tree-Based Indexing, B-Tree
891 Two-level linear index Slideshow Algorithm Analysis Presentation Slideshow showing a two-level linear index for variable length records stored on disk. OpenDSA Linear Indexing
892 Paged BST Slideshow Algorithm Visualization Slideshow showing the use of paging with a BST-based index. Updating the BST to require it to remain a complete... OpenDSA Tree-Based Indexing
893 Promote Key on Insertion into a 2-3 tree. Algorithm Visualization Slideshow showing how keys can be promoted on insertion into a 2-3 tree. OpenDSA Tree-Based Indexing, 2-3 Tree
894 Paged BST with Page Rebalancing For Use on Disk Slideshow Algorithm Visualization Slideshow showing the use of paging with a BST-based index. Reorganizing the nodes to be on optimal disk pages reduces... OpenDSA Tree-Based Indexing
895 Simple Insertion into a 2-3 tree. Algorithm Visualization Slideshow showing simple insertion into a 2-3 tree. OpenDSA Tree-Based Indexing, 2-3 Tree
896 Split on Insertion into a 2-3 tree. Algorithm Visualization Slideshow showing how node split on insertion is handled by a 2-3 tree. OpenDSA Tree-Based Indexing, 2-3 Tree
897 Building a 2-3+ Tree Slideshow Algorithm Visualization Slideshow showing a series of insertions into a 2-3+ tree. OpenDSA Tree-Based Indexing, 2-3 Tree
898 Deletion from a 2-3+ Tree Algorithm Visualization Slideshow showing a series of delete operations in a 2-3+ tree. OpenDSA Tree-Based Indexing, 2-3 Tree
899 Search in a 2-3+ Tree Algorithm Visualization Slideshow showing a series of search operations in a 2-3+ tree. OpenDSA Tree-Based Indexing, 2-3 Tree
900 Simple linear index Slideshow Algorithm Visualization Slideshow showing a simple linear index for variable length records stored on disk. OpenDSA Linear Indexing, File Processing
901 Turing Machine to Copy a String Algorithm Visualization, Code Tracing Presentation Slideshow presenting the execution of a Turing machine that copies a string. OpenDSA Turing Machine
902 Array-based List Append Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating the array-based list append operation. OpenDSA Array-Based List
903 Array-based List Insertion Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating array-based list insertion. OpenDSA Array-Based List
904 Array-based List Introduction Slideshow Presentation Slideshow presenting the array-based list implementation. OpenDSA Array-Based List
905 Array-based List Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating array-based list remove. OpenDSA Array-Based List
906 Array-based List Private Data Members Code Tracing Presentation Slideshow presenting the private data members from an array-based list implementation. OpenDSA Array-Based List
907 Array-Based Queue Design Problem Slideshow Algorithm Visualization Slideshow presenting the problem that elements in an array-based queue will eventually run out of space. OpenDSA Array-Based Queue
908 Circular Array-Based Queue Design Slideshow: Concepts Algorithm Visualization Slideshow presenting the concept of a circular array-based queue. OpenDSA Array-Based Queue
909 Array-Based Queue Drift Slideshow Algorithm Visualization Slideshow presenting the a design that allows elements in an array-based queue to drift. OpenDSA Array-Based Queue
910 Circular Array-Based Queue Empty Representation Slideshow Algorithm Visualization Slideshow presenting design options for recognizing when an array-based queue is empty or full. OpenDSA Array-Based Queue
911 Array-Based Queue Positions Slideshow Algorithm Visualization Slideshow presenting an initial design for storing a queue in an array. OpenDSA Array-Based Queue
912 Circular Array-Based Queue Design Slideshow: Data Members Code Tracing Presentation Slideshow presenting the data members for a circular array-based queue implementation. OpenDSA Array-Based Queue
913 Array-Based Stack Pop Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the pop operation in an array-based stack. OpenDSA Array-Based Stack
914 Array-Based Stack Push Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the push operation in an array-based stack. OpenDSA Array-Based Stack
915 Array-Based Stack Top Slideshow Code Tracing Presentation Slideshow discussing the implementation for the top position in an array-based stack. OpenDSA Array-Based Stack
916 Array-Based Stack Data Members Slideshow Code Tracing Presentation Slideshow presenting the data members for an array-based stack implementation. OpenDSA Array-Based Stack
917 Doubly Linked List Append Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting appending to a doubly linked list. OpenDSA Doubly Linked List
918 Doubly Linked List Insert Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting insertion into a doubly linked list. OpenDSA Doubly Linked List
919 Doubly Linked List Prev Method Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow showing how to move to the previous element in a doubly linked list. OpenDSA Doubly Linked List
920 Doubly Linked List Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting removing from a doubly linked list. OpenDSA Doubly Linked List
921 List ADT Positions Slideshow Presentation Slideshow discussing the concept of current position in a list and its implications for insertion. OpenDSA List
922 List Element Data Slideshow Algorithm Visualization Slideshow discussing the tradeoffs for storing element values in link nodes vs. references to element values. OpenDSA List Element Implementation
923 List Element Deletion Slideshow Algorithm Visualization Slideshow discussing the design choices on what to do when a list element is deleted. OpenDSA List Element Implementation
924 List Element Type Slideshow Algorithm Visualization Slideshow illustrating the choice between storing non-homogeneous data types in list nodes and limiting to a homogenous data type. OpenDSA List Element Implementation
925 Freelist Slideshow Algorithm Visualization Slideshow presenting the concept of using a freelist instead of a system memory manager. OpenDSA Linked List
926 Bad Linked List Representation Slideshow Presentation Slideshow demonstrating a bad representation for the current node in a linked list. OpenDSA Linked List
927 Linked List Deletion Problem Slideshow Presentation Slideshow demonstrating why a naive representation for the current node in a linked list leads to problems on deletion. OpenDSA Linked List
928 Linked List Constructors Slideshow Code Tracing Presentation Slideshow presenting the constructors for a linked list implementation. OpenDSA Linked List
929 Linked List Insertion Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating insertion into a linked list. OpenDSA Linked List
930 Linked List Miscillaneous Methods Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating some miscillaneous methods for a linked list implementation. OpenDSA Linked List
931 Linked List Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating removing from a linked list. OpenDSA Linked List
932 Linked List Insertion Special Case Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating some special cases related to insertion into a linked list. OpenDSA Linked List
933 Linked List Data Members Slideshow Code Tracing Presentation Slideshow presenting the data members for a linked list implementation. OpenDSA Linked List
934 Linked Queue Dequeue Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting an implementation for linked queue dequeue. OpenDSA Linked Queue
935 Linked Queue Enqueue Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting an implementation for linked queue enqueue. OpenDSA Linked Queue
936 Linked Queue Data Members Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting data members and constructors for a linked queue implementation. OpenDSA Linked Queue
937 Linked Stack Pop Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the pop operation in a linked stack. OpenDSA Linked Stack
938 Linked Stack Push Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the push operation in a linked stack. OpenDSA Linked Stack
939 Introduction to the Circuit Satisfiability Problem Presentation Slideshow demonstrating the circuit satisfiability problem. OpenDSA Circuit Satisfiability Problem
940 Reduction of Circuit SAT to SAT Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Circuit Satisfiability problem to an instance of the CNF Satisfiability problem. OpenDSA Reduction, Satisfiability Problem
941 Introduction to the Clique Problem Presentation Slideshow demonstrating the Clique problem. OpenDSA Clique Problem
942 Reduction of Clique to Independent Set Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Clique problem to an instance of the Independent Set problem. OpenDSA Reduction, Clique Problem, Independent Set Problem
943 Introduction to the Hamiltonian Cycle Problem Presentation Slideshow demonstrating the Hamiltonian cycle problem. OpenDSA Hamiltonian Cycle Problem
944 Reduction of Hamiltonian Cycle to Traveling Salesman Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Hamiltonian Cycle problem to an instance of the Traveling Salesman problem. OpenDSA Reduction, Clique Problem, Independent Set Problem
945 Introduction to the Independent Set Problem Presentation Slideshow demonstrating the independent set problem. OpenDSA Independent Set Problem
946 Reduction of Independent Set to Vertex Cover Slideshow Presentation Slideshow demonstrating a reduction from an instance of the Independent Set problem to an instance of the Vertex Cover problem. OpenDSA Reduction, Independent Set Problem, Vertex Cover Problem
947 Symmetric Matrix Multiplication Reduction Presentation Slideshow showing a reduction of Matrix Multiply to Symmetric Matrix Multiply. This demonstrates that the lower bound for Symmetric Matrix... OpenDSA Reduction
948 Reduction of Pairing to Sorting Presentation Slideshow showing a reduction of Pairing to Sorting. This demonstrates that the upper bound for Pairing is the same as... OpenDSA Reduction
949 Introduction to the CNF Satisfiability Problem Presentation Slideshow demonstrating the CNF satisfiability problem. OpenDSA Satisfiability Problem
950 Proof that 3-SAT is NP-Complete Slideshow Proof Visualization Slideshow demonstrating that 3-Satisfiability is NP-Complete by a reduction from Satisfiability. OpenDSA Clique Problem
951 Problem Notation Slideshow Presentation Slideshow showing the basic notation for defining a problem, with the example being sorting. OpenDSA Reduction
952 Reduction of Sorting to Pairing Presentation Slideshow showing a reduction of Sorting to Pairing. This demonstrates that the lower bound for Pairing is the same as... OpenDSA Reduction
953 Introduction to the 3-CNF Satisfiability Problem Presentation Slideshow demonstrating the 3-CNF satisfiability problem. OpenDSA Satisfiability Problem
954 Reduction of 3-SAT to Clique Slideshow Presentation Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Clique problem. OpenDSA Reduction, Satisfiability Problem, Clique Problem
955 Reduction of 3-SAT to Hamiltonian Cycle Slideshow Presentation Slideshow demonstrating a reduction from an instance of the 3-Satisfiability problem to an instance of the Hamiltonian Cycle problem. OpenDSA Reduction, Satisfiability Problem, Hamiltonian Cycle Problem
956 Introduction to the Traveling Salesman Problem Presentation Slideshow demonstrating the Traveling Salesman problem. OpenDSA Traveling Salesman Problem
957 Introduction to the Vertex Cover Problem Presentation Slideshow demonstrating the vertex cover problem. OpenDSA Vertex Cover Problem
958 Equivalence Relations Review Programmed Instruction Programmed Instruction Frameset presentation of equivalence relations review. OpenDSA Set
959 Programmed Instruction: Induction Proof For Factorial Programmed Instruction Programmed Instruction Frameset examples of induction proof proving a Factorial function implementation correct. OpenDSA Proof by Induction
960 Programmed Instruction: Induction Proof Examples Programmed Instruction Programmed Instruction Frameset examples of induction proofs. OpenDSA Proof by Induction
961 Programmed Instruction: Induction Proofs Programmed Instruction Programmed Instruction Frameset review of induction proofs. OpenDSA Induction Proof
962 Programmed Instruction: Induction Proof For Two Coloring Programmed Instruction Programmed Instruction Frameset examples of induction proof for two-coloring the 2D plane. OpenDSA Proof by Induction
963 Programmed Instruction: Proof Techniques Introduction Programmed Instruction Programmed Instruction Frameset presentation of basic proofs review, including proof by contradiction review. OpenDSA Proof
964 Relations Review Programmed Instruction Programmed Instruction Frameset presentation of basic relations terminology review. OpenDSA Set
965 Set Definitions Review Programmed Instruction Programmed Instruction Frameset presentation of basic set definitions and terminology review. OpenDSA Set
966 Set Notation Review Programmed Instruction Programmed Instruction Frameset presentation of basic set notation review. OpenDSA Set
967 Context-Free Language Ambiguity Frameset Programmed Instruction Programmed Instruction Frameset discussing ambiguity in Context-Free Grammars. OpenDSA Context-Free Grammar
968 Context-Free Language Derivations Frameset Programmed Instruction Programmed Instruction Frameset discussing derivations of strings from Context-Free Grammars. OpenDSA Context-Free Language
969 Context-Free Language Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Context-Free Languages and their formal definition. OpenDSA Context-Free Language
970 Context-Free Grammar Transformation: Chomsky Normal Form Frameset Programmed Instruction Programmed Instruction Frameset discussing Chomsky Normal Form for Context-Free Grammars. OpenDSA Context-Free Grammar
971 Context-Free Language Derivation Trees Frameset Programmed Instruction Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. OpenDSA Context-Free Language
972 Context-Free Grammar Transformation: Greibach Normal Form Frameset Programmed Instruction Programmed Instruction Frameset discussing Greibach Normal Form for Context-Free Grammars. OpenDSA Context-Free Grammar
973 Context-Free Language Membership Problem Frameset Programmed Instruction Programmed Instruction Frameset discussing how to recognize if a given string is derivable from a given Context-Free Grammar. OpenDSA Context-Free Language
974 Context-Free Grammar Transformation: Remove Lambda Productions Frameset Programmed Instruction Programmed Instruction Frameset discussing removing lambda productions from Context-Free Grammars. OpenDSA Context-Free Grammar
975 Context-Free Grammar Transformation: Remove Unit Productions Frameset Programmed Instruction Programmed Instruction Frameset discussing removing unit productions from Context-Free Grammars. OpenDSA Context-Free Grammar
976 Context-Free Grammar Transformation: Useless Productions Frameset Programmed Instruction Programmed Instruction Frameset discussing removing useless productions from Context-Free Grammars. OpenDSA Context-Free Grammar
977 Context-Free Grammar Transformation Introduction Frameset Programmed Instruction Programmed Instruction Frameset discussing reasons for transforming Context-Free Grammars to simpler versions. OpenDSA Context-Free Grammar
978 Context-Free Language Derivation Trees Example Algorithm Visualization Visualization of a derviation tree from a given context-free grammar. OpenDSA Context-Free Language
979 Programmed Instruction: DFA Advanced Concepts Programmed Instruction Programmed Instruction Frameset covering more advanced DFA concepts. OpenDSA Deterministic Finite Automata
980 Programmed Instruction: DFA Definitions Programmed Instruction Programmed Instruction Frameset covering the formal definition of a DFA. OpenDSA Deterministic Finite Automata
981 Programmed Instruction: DFA Minimization Example 1 Programmed Instruction Programmed Instruction Frameset presenting the algorithm to minimize the number of states in a DFA: Example 1. OpenDSA Deterministic Finite Automata
982 Programmed Instruction: DFA Minimization Example 2 Programmed Instruction Programmed Instruction Frameset presenting the algorithm to minimize the number of states in a DFA: Example 2. OpenDSA Deterministic Finite Automata
983 Programmed Instruction: DFA Minimization Programmed Instruction Programmed Instruction Frameset presenting the algorithm to minimize the number of states in a DFA. OpenDSA Deterministic Finite Automata
984 Programmed Instruction: NFA to DFA Conversion Programmed Instruction Programmed Instruction Frameset with an example for converting an NFA to an equivalent DFA. OpenDSA Deterministic Finite Automata
985 Programmed Instruction: Non-Deterministic Finite Automata Programmed Instruction Programmed Instruction Frameset introducing the concept of non-determinism and the NFA. OpenDSA Deterministic Finite Automata
986 Introduction to the Concept of a Grammar Programmed Instruction Programmed Instruction slideshow introducing the concept of a grammar. OpenDSA Grammar
987 Introduction to the Concept of a Language Programmed Instruction Programmed Instruction slideshow introducing the concept of a language. OpenDSA Language
988 Closure Properties to Show a Language Non-Regular: Example 1 Programmed Instruction, Proof Visualization Programmed Instruction slideshow demonstrating an example of using closure properties to prove a language non-regular. Language: a^n b^m a^m. OpenDSA Non-Regular Language, Closure Property
989 Closure Properties to Show a Language Non-Regular: Example 2 Programmed Instruction, Proof Visualization Programmed Instruction slideshow demonstrating an example of using closure properties to prove a language non-regular. Example 2. OpenDSA Non-Regular Language, Closure Property
990 Closure Properties to Show a Language Non-Regular Programmed Instruction, Proof Visualization Programmed Instruction slideshow introducing the concept of using closure properties to prove a language non-regular. OpenDSA Non-Regular Language, Closure Property
991 Introduction to the Concept of a Non-Regular Language Programmed Instruction Programmed Instruction slideshow introducing the concept of a non-regular language and ideas for how to recognize one. OpenDSA Non-Regular Language
992 Introduction to the Concept of the Pumping Lemma Programmed Instruction Programmed Instruction slideshow introducing the concept of a the pumping lemma for regular languages. OpenDSA Non-Regular Language
993 Pumping Lemma Example: Harder Proof Programmed Instruction, Proof Visualization Programmed Instruction slideshow showing the harder pumping lemma proof where there are multiple cases to consider. OpenDSA Non-Regular Language
994 Pumping Lemma Example: a^n b^n Programmed Instruction, Proof Visualization Programmed Instruction slideshow showing the pumping lemma proof that the language a^n b^n is not regular. OpenDSA Non-Regular Language
995 Pumping Lemma Example: wwR Programmed Instruction, Proof Visualization Programmed Instruction slideshow showing the pumping lemma proof that the language consisting of a string w followed by the reverse... OpenDSA Non-Regular Language
996 Closure Properties for Context-Free Languages Programmed Instruction Programmed Instruction slideshow explaining the concept and giving examples of closure properties for Context-Free Languages. OpenDSA Context-Free Language, Closure Property
997 Context-Free Language Pumping Lemma Example 1 Programmed Instruction Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^n b^n... OpenDSA Context-Free Language, Pumping Lemma
998 Context-Free Language Pumping Lemma Example 2 Programmed Instruction Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^n b^n... OpenDSA Context-Free Language, Pumping Lemma
999 Context-Free Language Pumping Lemma Example 3 Programmed Instruction Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: a^j b^k... OpenDSA Context-Free Language, Pumping Lemma
1000 Context-Free Language Pumping Lemma Example 4 Programmed Instruction Programmed Instruction slideshow giving an example for using a pumping lemma to prove a language is not Context-Free: w, reverse... OpenDSA Context-Free Language, Pumping Lemma
1001 Pumping Lemma for Context-Free Languages Programmed Instruction Programmed Instruction slideshow introducing a pumping lemma for Context-Free Languages. OpenDSA Context-Free Language, Pumping Lemma
1002 Deterministic vs Nondeterministic PDAs Programmed Instruction Programmed Instruction Frameset discussing the differences between deterministic and non-deterministic PDAs. OpenDSA Pushdown Automata
1003 Grammars for Deterministic CFL Programmed Instruction Programmed Instruction Frameset discussing grammars for deterministic context free languages. OpenDSA Context-Free Language
1004 Proof not all CFL are Deterministic Programmed Instruction Programmed Instruction Frameset with a proof that there exists a CFL that is not a deterministic CFL. OpenDSA Pushdown Automata
1005 Pushdown Automata Acceptance Models Frameset Programmed Instruction Programmed Instruction Frameset discussing Pushdown Automata acceptance models. OpenDSA Pushdown Automata
1006 Pushdown Automata Acceptance Model Equivalence Frameset Programmed Instruction Programmed Instruction Frameset discussing the equivalence of various Pushdown Automata acceptance models. OpenDSA Pushdown Automata
1007 Pushdown Automata and Context Free Languages Programmed Instruction Programmed Instruction Frameset discussing the relationship between Pushdown Automata and context free languages. OpenDSA Pushdown Automata
1008 Pushdown Automata Empty Stack Acceptance Frameset Programmed Instruction Programmed Instruction Frameset discussing Pushdown Automata and the empty stack acceptance model. OpenDSA Pushdown Automata
1009 Pushdown Automata Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Pushdown Automata and their formal definition. OpenDSA Pushdown Automata
1010 Pushdown Automata Transitions Frameset Programmed Instruction Programmed Instruction Frameset discussing Pushdown Automata transition types. OpenDSA Pushdown Automata
1011 Review of the Concept of Closure Properties Programmed Instruction Programmed Instruction Frameset reviewing the concept of closure properties, in the context of regular languages. OpenDSA Regular Language, Closure Property
1012 NFA Conversion to Regular Expression Example Programmed Instruction Programmed Instruction Frameset presenting an example of converting a NFA to an equivalent Regular Expression. OpenDSA Regular Expression, Non-Deterministic Finite Automata
1013 Right and Left Regular Grammars Frameset Programmed Instruction Programmed Instruction Frameset presenting right and left regular grammars and conversion between them. OpenDSA Regular Grammar, Regular Language
1014 Converting NFAs to Regular Grammars Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a NFA to an equivalent regular grammar. OpenDSA Regular Grammar, Regular Language, Non-Deterministic Finite Automata
1015 Regular Expressions Equivalent to NFA: Part 1 Programmed Instruction Programmed Instruction Frameset presenting Part 1 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. OpenDSA Regular Expression, Non-Deterministic Finite Automata
1016 Regular Expressions Equivalent to NFA: Part 3: Concatenate Programmed Instruction Programmed Instruction Frameset presenting Part 3 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Concatenating... OpenDSA Regular Expression, Non-Deterministic Finite Automata
1017 Regular Expressions Equivalent to NFA: Example Programmed Instruction Programmed Instruction Frameset presenting examples of converting a Regular Expression to an equivalend NFA. OpenDSA Regular Expression, Non-Deterministic Finite Automata
1018 Regular Expressions Equivalent to NFA: Part 2: Or Programmed Instruction Programmed Instruction Frameset presenting Part 2 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Or'ing... OpenDSA Regular Expression, Non-Deterministic Finite Automata
1019 Regular Expressions Equivalent to NFA: Part 4: Star Programmed Instruction Programmed Instruction Frameset presenting Part 4 of 4 parts of a proof of equivalence of Regular Expressions and NFAs. Kleene... OpenDSA Regular Expression, Non-Deterministic Finite Automata
1020 Regular Expressions Introduction Frameset Programmed Instruction Programmed Instruction Frameset introducing Regular Expressions their formal definition. OpenDSA Regular Expression
1021 Converting a RegEx to a Left Regular Grammar Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular expression to a left regular grammar. OpenDSA Regular Grammar, Regular Language
1022 Converting a RegEx to a Right Regular Grammar Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular expression to a right regular grammar. OpenDSA Regular Grammar, Regular Language
1023 Regular Grammars Introduction Frameset Programmed Instruction Programmed Instruction Frameset presenting an introduction to regular grammars, their definitions and properties. OpenDSA Regular Grammar, Regular Language
1024 Converting Regular Grammars to NFAs Frameset Programmed Instruction Programmed Instruction Frameset presenting a conversion from a regular grammar to an equivalent NFA. OpenDSA Regular Grammar, Regular Language, Non-Deterministic Finite Automata
1025 Basic Closure Properties of Regular Languages Programmed Instruction Programmed Instruction Frameset presenting some basic operations that are closed for regular languages, like intersection. OpenDSA Regular Language, Closure Property
1026 Closure Properties for Regular Languages: Right Quotient Programmed Instruction Programmed Instruction Frameset presenting the concept of right quotient, and a proof that this operator is closed for regular languages. OpenDSA Regular Language, Closure Property
1027 Closure Properties for Regular Languages: Homomorphism Programmed Instruction Programmed Instruction Frameset presenting the concept of homomorphism, and a proof that this operator is closed for regular languages. OpenDSA Regular Language, Closure Property
1028 Decideable Questions about Regular Languages Programmed Instruction Programmed Instruction Frameset reviews the concept of decideablilty and presenting some key questions that are decideable for regular languages. OpenDSA Regular Language
1029 Composition of Turing Machines Programmed Instruction Slideshow the formal conepts that support composition of Turing machines, which is a necessary step to building more complicated machines. OpenDSA Turing Machine
1030 Turing Machines Deciding vs. Accepting Frameset Programmed Instruction Slideshow presenting the distinction between a Turing Machine that decides a language (always halts with a decision) vs. one that... OpenDSA Turing Machine
1031 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
1032 Turing Machines Introduction Frameset Programmed Instruction Slideshow introducing the concept of a Turing machine and its formal definition. OpenDSA Collision Resolution
1033 Turing Machines Configurations and Terminology Frameset Programmed Instruction Slideshow presenting the concept of a configuration for a Turing machine, along with defintions for terms like halting, accepting, and... OpenDSA Collision Resolution
1034 Reduction of True and False using Church Bools Algorithm Visualization Slideshow visualizing reduction of true and false using Church bools. OpenDSA Lambda Calculus
1035 Church Numerals 2 Algorithm Visualization Slideshow illustrating reduction for Church numerals: Multiplication. OpenDSA Lambda Calculus
1036 Church Numerals Algorithm Visualization Slideshow illustrating reduction for Church numerals. OpenDSA Lambda Calculus
1037 Lambda Calculus: How to Build a Parse Tree Algorithm Visualization, Code Tracing Presentation Slideshow visualizing building a parse tree for lambda calculus expressions. OpenDSA Lambda Calculus
1038 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
1039 Parse Tree Example for a Math Expression Algorithm Visualization Slideshow visualizing generation of a parse tree for a simple math expression. OpenDSA Parse Tree
1040 Ambiguous Parse Tree Example for a Math Expression Algorithm Visualization Slideshow visualizing how generation of a parse tree from a grammar might be ambiguous. OpenDSA Parse Tree
1041 Ambiguous Parse Tree Example for a Math Expression: 2 Algorithm Visualization Slideshow visualizing a second example of how generation of a parse tree from a grammar might be ambiguous. OpenDSA Parse Tree
1042 Functional Programming List Processing: Summation Algorithm Visualization, Code Tracing Presentation Slideshow visualizing basic list processing in a functional programming language: Summation of list values. OpenDSA Functional Programming
1043 Functional Programming List Processing: isMember Algorithm Visualization, Code Tracing Presentation Slideshow visualizing basic list processing in a functional programming language: isMember function. OpenDSA Functional Programming
1044 Functional Programming List Processing: Substitution Algorithm Visualization, Code Tracing Presentation Slideshow visualizing basic list processing in a functional programming language: substitution function. OpenDSA Functional Programming
1045 Functional Programming Recursion: Summing Elements in a Tree Algorithm Visualization, Code Tracing Presentation Slideshow visualizing list-of-list (tree) processing in a functional programming language: sum all values. OpenDSA Functional Programming
1046 Functional Programming Recursion: BST Algorithm Visualization, Code Tracing Presentation Slideshow visualizing list-of-list (tree) processing in a functional programming language: Binary Search Tree Search. OpenDSA Functional Programming
1047 Functional Programming: Split and Join Algorithm Visualization, Code Tracing Presentation Slideshow visualizing split and join operations in a functional programming language. OpenDSA Functional Programming
1048 Functional Programming: Accumulator Pattern Pivot Algorithm Visualization, Code Tracing Presentation Slideshow visualizing using pivot as an example in the accumlator pattern. OpenDSA Functional Programming
1049 Functional Programming: Scope and Closure Algorithm Visualization, Code Tracing Presentation Slideshow visualizing scope and closure in a functional programming language. OpenDSA Functional Programming
1050 Functional Programming: Variable Hoisting Algorithm Visualization, Code Tracing Presentation Slideshow visualizing variable hoisting in a functional programming language. OpenDSA Functional Programming
1051 Functional Programming: Nested Scopes Algorithm Visualization, Code Tracing Presentation Slideshow illustrating nested scopes in a functional programming language. OpenDSA Functional Programming
1052 Functional Programming Visualization: Static vs Dynamic Binding Algorithm Visualization, Code Tracing Presentation Slideshow illustrating static vs dynamic binding in a functional programming language. OpenDSA Functional Programming
1053 Functional Programming: Closures Algorithm Visualization, Code Tracing Presentation Slideshow illustrating closures in a functional programming language. OpenDSA Functional Programming
1054 Functional Programming Visualization: Mapping Pattern Algorithm Visualization, Code Tracing Presentation Slideshow visualizing the mapping pattern in a functional programming language. OpenDSA Functional Programming
1055 Functional Programming Visualization: Functional Composition Algorithm Visualization, Code Tracing Presentation Slideshow visualizing functional composition in a functional programming language. OpenDSA Functional Programming
1056 Functional Programming: Currying Algorithm Visualization, Code Tracing Presentation Slideshow visualizing currying in a functional programming language. OpenDSA Functional Programming
1057 Functional Programming: Filter Pattern Algorithm Visualization, Code Tracing Presentation Slideshow visualizing the filter pattern in a functional programming language. OpenDSA Functional Programming
1058 Functional Programming: Reduce/Folding Pattern Algorithm Visualization, Code Tracing Presentation Slideshow visualizing the reduce/folding pattern in a functional programming language. OpenDSA Functional Programming
1059 Functional Programming: ReduceRight Pattern Algorithm Visualization, Code Tracing Presentation Slideshow visualizing the reduceRight pattern in a functional programming language. OpenDSA Functional Programming
1060 Functional Programming: MapReduce Pattern Algorithm Visualization, Code Tracing Presentation Slideshow visualizing the Map/Reduce pattern in a functional programming language. OpenDSA Functional Programming
1061 Functional Programming: Continuation Passing Algorithm Visualization, Code Tracing Presentation Slideshow illustrating continuation passing in a functional programming language. OpenDSA Functional Programming
1062 Functional Programming: CPS vs non-tail recursion Algorithm Visualization, Code Tracing Presentation Slideshow comparing continuation passing with non-tail recursion and accumulation. OpenDSA Functional Programming
1063 From Operation Algorithm Visualization Slideshow illustrating the concept of a lazy list. OpenDSA Parameter Passing, Lazy List
1064 Lazy Lists Algorithm Visualization Slideshow illustrating the lazy list from operation. OpenDSA Parameter Passing, Lazy List
1065 Lazy Lists Map Operation Algorithm Visualization Slideshow illustrating the map operation for a lazy list. OpenDSA Parameter Passing, Lazy List
1066 Lazy Lists Filter Operation Algorithm Visualization Slideshow illustrating the filter operation for a lazy list. OpenDSA Parameter Passing, Lazy List
1067 Lazy Lists Drop Operation Algorithm Visualization Slideshow illustrating the drop operation for a lazy list. OpenDSA Parameter Passing, Lazy List
1068 Lazy Lists Iterates Operation Algorithm Visualization Slideshow illustrating the iterates operation for a lazy list. OpenDSA Parameter Passing, Lazy List
1069 Lazy Lists Eager Evaluation Algorithm Visualization Slideshow illustrating the concept of eager evaluation for a lazy list. OpenDSA Parameter Passing, Lazy List
1070 Lazy Lists Lazy Evaluation Algorithm Visualization Slideshow illustrating the concept of lazy evaluation for a lazy list. OpenDSA Parameter Passing, Lazy List
1071 Consequences of Dereferencing a Null Pointer Presentation Slideshow demonstrating the consequence of dereferencing a null pointer. OpenDSA Pointer, Reference, Object
1072 Assigning a Reference to an Object Code Tracing Presentation Slideshow demonstrating assigning a reference to an object. OpenDSA Pointer, Reference, Object
1073 Changing the Reference to an Object Code Tracing Presentation Slideshow demonstrating changing the reference to an object. OpenDSA Pointer, Reference, Object
1074 Garbage Disposal Algorithm Visualization, Code Tracing Presentation Slideshow introducing the concept of garbage collection. OpenDSA Garbage Collection, Heap Memory
1075 Link Nodes Algorithm Visualization, Code Tracing Presentation Slideshow introducing the concept of Link Nodes. OpenDSA Link Node
1076 Creating a Chain of Links Algorithm Visualization, Code Tracing Presentation Slideshow introducing the concept of chaining link nodes to form a linked list. OpenDSA Link Node, Linked List
1077 Link Nodes: Iteration Algorithm Visualization, Code Tracing Presentation Slideshow introducing the concept of iterating through a linked list. OpenDSA Link Node, Iteration
1078 Link Nodes: Delete Algorithm Visualization, Code Tracing Presentation Slideshow introducing the concept of deleting from a linked list. OpenDSA Link Node, Iteration
1079 Link Nodes: Insertion Algorithm Visualization, Code Tracing Presentation Slideshow introducing the concept of inserting a new node into a linked list. OpenDSA Link Node, Iteration
1080 A Heap Example Code Tracing Presentation Slideshow demonstrating the memory allocation and deallocation. OpenDSA Memory Allocation
1081 Java Data Types Presentation Slideshow showing primitive data types in Java and the concept of object and reference. OpenDSA Pointer, Reference, Data Type, Object
1082 Shallow vs Deep Copy Code Tracing Presentation Slideshow demonstrating the distinction between shallow and deep copy. OpenDSA Pointer, Reference, Object
1083 Lifetime of Local Variables Code Tracing Presentation Slideshow demonstrating the lifetime of local storage. OpenDSA Pointer, Reference, Object
1084 Allocation and Deallocation of Local Variables Code Tracing Presentation Slideshow demonstrating the details of local variable allocation and deallocation. OpenDSA Pointer, Reference, Object
1085 Basics of Writing a Recursive Function Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating the concept of recusion as delegation of a task. OpenDSA Recursion, Delegation
1086 Recursion Introduction Slideshow: Details of Recursion Algorithm Visualization Slideshow demonstrating the concept of recusion showing the detials of recursive multiplication. OpenDSA Recursion
1087 Tracing Recursive Code: Domino Effect Code Tracing Presentation Slideshow demonstrating code tracing, using a domino metaphor. OpenDSA Recursion
1088 Tracing Recursive Code: Factorial Function Code Tracing Presentation Slideshow demonstrating code tracing, using the factorial function as an example. OpenDSA Recursion
1089 Tracing Recursive Code: Summation Code Tracing Presentation Slideshow demonstrating code tracing, using a simple summation function as an example. OpenDSA Recursion
1090 Tracing Recursive Code: Towers of Hanoi Code Tracing Presentation Slideshow demonstrating code tracing the Towers of Hanoi problem. OpenDSA Recursion, Towers of Hanoi
1091 Tracing Recursive Code: Winding and Unwinding Code Tracing Presentation Slideshow demonstrating code tracing, showing how the call stack winds and unwinds. OpenDSA Recursion
1092 Recursion Introduction Slideshow: Delegation Code Tracing Presentation Slideshow demonstrating the basic concepts of base cases and recursive calls in a function. OpenDSA Recursion
1093 Writing a Recursive Function: Variations Code Tracing Presentation Slideshow showing multiple examples of how to write a recursive function to do summation. OpenDSA Recursion
1094 Binary Search Algorithm Algorithm Visualization, Code Tracing Presentation Slideshow illustrating Binary Search and presenting its analysis. OpenDSA Binary Search, Algorithm Analysis
1095 Skip List Insert Slideshow Algorithm Visualization Slideshow showing examples of insertion into a Skip List. OpenDSA Skip List, Randomized Algorithm
1096 Skip List Introduction Slideshow Algorithm Visualization Slideshow showing an idealized version of the Skip List as an introduction to the concepts. OpenDSA Skip List
1097 Skip List Delete Slideshow Algorithm Visualization Slideshow showing examples of deletion from a Skip List. OpenDSA Skip List, Randomized Algorithm
1098 Constructing a Binomial Tree Algorithm Visualization Slideshow showing a small example of building a binomial tree. OpenDSA Binomial Tree
1099 Master Theorem for Recurrence Relations Presentation Slideshow showing how to calculate the closed form for a divide-and-conquer recurrence using the Master Theorem. OpenDSA Recurrence Relation, Master Theorem
1100 Discrete Fourier Transform Matrix Presentation Demonstration of multiplying by the FFT symmetry matrix for the 8th power of unity. OpenDSA Polynomial Multiplication, Fast Fourier Transform
1101 Symmetries of the FFT Matrix Presentation Demonstration of the symmetries found within the nth powers of unity matrix for the FFT. OpenDSA Polynomial Multiplication, Fast Fourier Transform
1102 Evaluation and Interpolation Algorithm Visualization Slideshow demonstrating the relationships of evaluation and interpolation of a polynomial. OpenDSA Polynomial Multiplication, Polynomial Evaluation, Polynomial Interpolation
1103 Polynomial Evaluation Algorithm Visualization Visualization of the relationship between evaluation of polynomials and multiplying polynomials. OpenDSA Polynomial Multiplication, Evaluation
1104 Even and Odd Polynomials Slideshow Presentation Demonstration of the symmetries between even powers versus odd powers for polynomial evaluation of a value and its negation. OpenDSA Polynomial Multiplication
1105 Expanding a Divide and Conquer Recurrence Presentation Slideshow showing how to calculate the closed form for a divide-and-conquer recurrence using the expansion technique. OpenDSA Recurrence Relation
1106 The Fast Fourier Transform Algorithm Visualization, Code Tracing Presentation Visual demonstration of the Fast Fourier Transform for polynomial multiplication. OpenDSA Polynomial Multiplication, Fast Fourier Transform
1107 Call Structure for the Fibonacci Sequence Problem Algorithm Visualization Slideshow showing the tree structure for calls by a recursive implementation of the Fibonacci sequence calculation. OpenDSA Dynamic Programming, Fibonacci Sequence
1108 Geometric Summation Proof Presentation Slideshow showing how to calculate the closed form for the geometric series. OpenDSA Summation
1109 Call Structure for the Chained Matrix Multiplication Problem Algorithm Visualization Slideshow showing the tree structure for calls by a solution to the chained matrix multiplication problem. OpenDSA Dynamic Programming, Chained Matrix Multplication Problem
1110 Polynomial Multiplication Introduction Slideshow Algorithm Visualization Slideshow showing how the terms of a polynomial affect its geometric shape. OpenDSA Polynomial Multiplication
1111 Using Posets for a Lower Bounds Proof Presentation Slideshow showing the use of posets in a proof of the lower bound for search in an unsorted list. OpenDSA Poset, Search in Unsorted Lists
1112 Polynomial Product Algorithm Visualization Visualization of the process for muliplying to polynomials. OpenDSA Polynomial Multiplication
1113 Binsort Slideshow: Sorting a Permutation Algorithm Visualization Slideshow showing the details of sorting a permutation of the n values from 0 to n-1. OpenDSA Binsort
1114 Binsort Slideshow: Generalized Version Algorithm Visualization Slideshow showing the details of binsort for an arbitrary key range. OpenDSA Binsort
1115 Bubble Sort Analysis Slideshow Algorithm Analysis Presentation Slideshow showing an analysis of Bubble Sort's cost in worst, average, and best cases. OpenDSA Bubble Sort, Worst Case, Average Case, Best Case
1116 Bubble Sort First Pass Slideshow Algorithm Visualization Slideshow showing a simple visualization of the first pass for Bubble Sort. OpenDSA Bubble Sort
1117 Bubble Sort 2nd Pass Slideshow Algorithm Visualization Slideshow showing a simple visualization of the second pass for Bubble Sort. OpenDSA Bubble Sort
1118 Exchange Sort Analysis Slideshow Algorithm Analysis Presentation Slideshow showing an analysis of Echange Sorting cost. OpenDSA Bubble Sort, Worst Case, Average Case, Best Case
1119 Heapsort Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the cost of Heapsort. OpenDSA Heapsort
1120 Heapsort Visualization Slideshow Algorithm Visualization Slideshow showing a visualization of the Heapsort algorithm. OpenDSA Heapsort
1121 Insertion Sort Average Case Slideshow Code Tracing Presentation, Algorithm Analysis Presentation Slideshow showing an analysis of Insertion Sort's average-case behavior and cost. OpenDSA Insertion Sort, Average Case
1122 Insertion Sort Best Case Slideshow Code Tracing Presentation, Algorithm Analysis Presentation Slideshow showing an analysis of Insertion Sort's best-case behavior and cost. OpenDSA Insertion Sort, Best Case
1123 Insertion Sort Slideshow Algorithm Visualization Slideshow showing a visualization for the first pass of Insertion Sort. OpenDSA Insertion Sort
1124 Insertion Sort Worst Case Analysis Code Tracing Presentation, Algorithm Analysis Presentation Slideshow showing an analysis of Insertion Sort's worst-case behavior and cost. OpenDSA Insertion Sort, Worst Case
1125 Mergsort Implementation Slideshow: Final Pass Algorithm Visualization Slideshow showing the details of implementing Mergesort using an array. This is the first of a two-part series, showing the... OpenDSA Mergesort
1126 Mergsort Implementation Slideshow: Optimized Final Pass Algorithm Visualization Slideshow showing the details of implementing Mergesort using an array. This is the second of a two-part series, showing an... OpenDSA Mergesort
1127 Mergesort Analysis Slideshow Algorithm Visualization Slideshow showing a visual analysis of Mergesort best, average, and worst case performance. OpenDSA Mergesort
1128 Merging Slideshow Algorithm Visualization Slideshow showing the details of merging two sorted runs in Mergesort. OpenDSA Mergesort
1129 Pointer Swap Optimization Slideshow Presentation Slideshow showing that Selection Sort can be sped up for large records with swapping to records. OpenDSA
1130 Quicksort Average Case Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the average-case cost of Quicksort. OpenDSA Quicksort
1131 Quicksort Best Case Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the best-case cost of Quicksort. OpenDSA Quicksort
1132 Quicksort Partition Slideshow Algorithm Visualization Slideshow showing the partition step for Quicksort. OpenDSA Quicksort
1133 Quicksort Partition Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the cost of the partition step for Quicksort. OpenDSA Quicksort
1134 Quicksort Worst Case Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the worst-case cost of Quicksort. OpenDSA Quicksort
1135 Radix Sort Analysis Algorithm Visualization Slideshow showing a visual analysis for the cost of Radix Sort. OpenDSA Radix Sort
1136 Selection Sort Analysis Slideshow Algorithm Analysis Presentation Slideshow showing an analysis of Selection Sort's cost analysis. OpenDSA Selection Sort, Worst Case, Average Case, Best Case
1137 Selection Sort First Pass Slideshow Algorithm Visualization Slideshow showing a simple visualization of the first pass for Selection Sort. OpenDSA Selection Sort
1138 Selection Sort Second Pass Slideshow Algorithm Visualization Slideshow showing a simple visualization of the second pass for Selection Sort. OpenDSA Selection Sort
1139 Shellsort First Pass Sublist Slideshow Algorithm Visualization Slideshow showing the sublists that would be processed by the first pass of Shellsort (increments of size n/2). OpenDSA Shellsort
1140 Shellsort First Pass Details Slideshow Algorithm Visualization Slideshow showing the details of what records would be compared and swapped in the first pass of Shellsort. OpenDSA Shellsort
1141 Shellsort Second Pass Sublist Slideshow Algorithm Visualization Slideshow showing a visualization for the sublists that would be sorted in the second pass of Shellsort. OpenDSA Shellsort
1142 Shellsort Second Pass Sorting Details Slideshow Algorithm Visualization Slideshow showing the details of what records would be compared and swapped in the second pass of Shellsort. OpenDSA Shellsort
1143 Shellsort Third Pass Sorting Details Slideshow Algorithm Visualization Slideshow showing the details of what records would be compared and swapped in the third pass of Shellsort. OpenDSA Shellsort
1144 Shellsort Final Pass Details Slideshow Algorithm Visualization Slideshow showing the details of what records would be compared and swapped in the final "cleanup" pass of Shellsort. OpenDSA Shellsort
1145 Sorting Lower Bound Analysis Slideshow Algorithm Visualization Slideshow showing a visual proof for the lower bound of the general sorting problem. OpenDSA Sorting Problem Lower Bound
1146 Sorting Terminology and Notation Slideshow Presentation Slideshow introducing the sorting problem. OpenDSA Sorting Notation
1147 Unambiguous CFG Parse Tree Example Algorithm Visualization Visualization for the parse tree generated for a mathematical expression from a non-ambiguouse CFG. OpenDSA Context-Free Language, Parse Tree
1148 DFA Example Trace: How a DFA Traces Algorithm Visualization, Code Tracing Presentation Visualization of how a DFA would process an input string. OpenDSA Deterministic Finite Automata
1149 DFA Example Trace: Even Binary Numbers Algorithm Visualization, Code Tracing Presentation Visualization of how a DFA would process input strings for the language of even binary numbers. OpenDSA Deterministic Finite Automata
1150 Introduction to the Pumping Lemma Proof Visualization Introduction to the Pumping Lemma for regular languages. Includes a visualization for how this works. OpenDSA Pumping Lemma, Non-Regular Language
1151 Pumping Lemma Slideshow Proof Visualization Simple demonstration of a Pumping Lemma proof to show that a language is not regular. OpenDSA Pumping Lemma, Non-Regular Language
1152 Regular Expression to Minimized DFA Example Algorithm Visualization Visualization presenting examples of converting a Regular Expression to an equivalend NFA. OpenDSA Regular Expression, Non-Deterministic Finite Automata
1153 Visualizaiton of the Turing Machine that accepts a^n b^n c^n Algorithm Visualization, Code Tracing Presentation Detailed trace on some examples for a Turing machine that accepts the langugage a^n b^n c^n. OpenDSA Turing Machine