Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | 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 |
| 2 | 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 |
| 3 | 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 |
| 4 | 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 |
| 5 | 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 |
| 6 | 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 |
| 7 | 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 |
| 8 | 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 |
| 9 | 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 |
| 10 | 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 |
| 11 | 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 |
| 12 | 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 |
| 13 | 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 |
| 14 | 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 |
| 15 | 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 |
| 16 | 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 |
| 17 | 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 |
| 18 | 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 |
| 19 | 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 |
| 20 | 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 |
| 21 | 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 |
| 22 | 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 |
| 23 | 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 |
| 24 | 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 |
| 25 | 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 |
| 26 | 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 |
| 27 | 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 |
| 28 | 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 |
| 29 | 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 |
| 30 | 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 |
| 31 | 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 |
| 32 | c_promjena_vrijednosti_preko_pokazivaca_2 | U programu su date cjelobrojne varijable a i b. Pokazivač p prvobitno pokazuje na varijablu a. Vaš zadatak je da... | PCEX | ||
| 33 | Comparisons | Construct a program that prints out whether variable a is bigger than b. | jsParsons | boolean expressions, boolean logic, comparison operators | |
| 34 | Practicar el uso de comparaciones | Construye un programa que imprima si la variable a es mayor que b. | jsParsons | boolean expressions, conditionals | |
| 35 | 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 |
| 36 | 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 |
| 37 | 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 |
| 38 | 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 |
| 39 | Increment/Decrement Operators (Case 1) | Construct a program that performs increment/decrement operations on variable a (with initial value of 4) and variable b (with initial... | PCEX | ||
| 40 | Increment/Decrement Operators (Case 2) | Construct a program that performs increment/decrement operations on variable a (with initial value of 8) and variable b (with initial... | PCEX | ||
| 41 | Increment/Decrement Operators (Case 3) | Construct a program that performs increment/decrement operations on variable a (with initial value of 6) and variable b (with initial... | PCEX | ||
| 42 | Increment/Decrement Operators (Case 1) | Construct a program that performs increment/decrement operations on variable a (with initial value of 4) and variable b (with initial... | PCEX | ||
| 43 | Increment/Decrement Operators (Case 2) | Construct a program that performs increment/decrement operations on variable a (with initial value of 8) and variable b (with initial... | PCEX | ||
| 44 | Increment/Decrement Operators (Case 3) | Construct a program that performs increment/decrement operations on variable a (with initial value of 6) and variable b (with initial... | PCEX | ||
| 45 | c_funkcija_suma_kolicnika | Napisati funkciju sa prototipom double suma_kolicnika(int a, int b) koja računa i vraća sumu: S=a/1+a/2+a/3+...+a/b. U glavnom programu unijeti a... | PCEX | ||
| 46 | XOR | Construct a program that mimics a XOR gate (exclusive or). When input_a and input_b are the same, it should print... | jsParsons | boolean expressions, boolean logic, if-else statement, logical operators | |
| 47 | 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 | boolean expressions, conditionals | |
| 48 | 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 | functions, if-else statement | |
| 49 | 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 | conditionals, functions | |
| 50 | 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 |
| 51 | 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 |
| 52 | 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 |
| 53 | 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 |
| 54 | 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 |
| 55 | 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 |
| 56 | 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 |
| 57 | c_vrijednosti_u_pokazivacima_int | Napisati program u kojem se deklarišu dvije cjelobrojne varijable i dva pokazivača na int. Postaviti pokazivač p da pokazuje na... | PCEX | ||
| 58 | c_pretvaranje_broja_u_slovo | Napisati program koji omogućava unos teksta sa maksimalno 1000 karaktera, a zatim u tekstu zamjenjuje sve brojeve sa slovom 'B'.... | PCEX | ||
| 59 | 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 |
| 60 | 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 |