Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | 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 |
| 2 | Postfix | Python PredictingFinalResult for demonstrating Postfix | QuizPET | queues, stack, stacks | |
| 3 | Postfix 2 | Python PredictingFinalResult for demonstrating Postfix 2 | QuizPET | queues, stack, stacks | |
| 4 | Post Decrement | Java PredictingFinalResult for demonstrating Post Decrement | QuizJET | arithmetic operations, arithmetic operators | |
| 5 | Post Increment | Java PredictingFinalResult for demonstrating Post Increment | QuizJET | arithmetic operations, arithmetic operators, operators, variables | |
| 6 | 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 |
| 7 | 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 |
| 8 | (If) Positive - CSEdPad | Given a number, this program reports if the number is a positive number | AnnEx | if statement | |
| 9 | ISD:: Post Request Example.java | Java BehaviorExample for demonstrating ISD:: Post Request Example.java | AnnEx | ||
| 10 | General Tree Postorder Traversal Slideshow | Algorithm Visualization | Slideshow showing postorder traveral of a general tree, and demonstrates the general tree ADT. | OpenDSA | General Tree |
| 11 | Array-Based Queue Positions Slideshow | Algorithm Visualization | Slideshow presenting an initial design for storing a queue in an array. | OpenDSA | Array-Based Queue |
| 12 | List ADT Positions Slideshow | Presentation | Slideshow discussing the concept of current position in a list and its implications for insertion. | OpenDSA | List |
| 13 | c_datoteke_brojanje_rijeci_s_velikim_pocetnim_slovom | Napisati program koji određuje broj riječi koje počinju velikim slovom u tekstualnoj datoteci. Ime datoteke se unosi sa tastature. Riječ... | PCEX | ||
| 14 | c_brojanje_rijeci_s_velikim_pocetnim_slovom | Napisati program u kojem se omogućava unos nekog stringa, a zatim se ispisuje broj njegovih riječi koje počinju velikim slovom.... | PCEX | ||
| 15 | Finding the Smallest Divisor of a Positive Number | Construct a program that finds the smallest divisor (other than 1) of a positive number. For example, the smallest divisor... | PCEX | ||
| 16 | Finding the Largest Divisor of a Positive Number | Construct a program that finds the largest divisor of a positive number, excluding the number itself. For example, the largest... | PCEX | ||
| 17 | Encontrar el Mayor Divisor de un Numero Positivo | Construir un programa que encuentre el mayor divisor de un número positivo, excluyendo el número mismo. Por ejemplo, el mayor... | PCEX | ||
| 18 | Finding the Smallest Divisor of a Positive Number | Construct a program that finds the smallest divisor (other than 1) of a positive number. For example, the smallest divisor... | PCEX | ||
| 19 | Finding the Largest Divisor of a Positive Number | Construct a program that finds the largest divisor of a positive number, excluding the number itself. For example, the largest... | PCEX | ||
| 20 | Finding the Smallest Divisor of a Positive Number | Construct a program that finds the smallest divisor (other than 1) of a positive number. For example, the smallest divisor... | PCEX | ||
| 21 | Finding the Largest Divisor of a Positive Number | Construct a program that finds the largest divisor of a positive number, excluding the number itself. For example, the largest... | PCEX | ||
| 22 | Rotating the Array Values to the Left by One Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | ||
| 23 | Rotating the Array Values to the Left by Two Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | ||
| 24 | Rotating the Array Values to the Right by One Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | ||
| 25 | Rotating the List Values to the Right by Two Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 26 | Rotating the Array Values to the Left by One Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | ||
| 27 | Rotating the Array Values to the Left by Two Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | ||
| 28 | Rotating the Array Values to the Right by One Position | Construct a program that has a method that receives an array of values and returns the array rotated to the... | PCEX | ||
| 29 | Rotating the List Values to the Right by Two Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 30 | Encontrar el Divisor Mas Pequeno de un Numero Positivo | Construir un programa que encuentre el divisor más pequeño (distinto de 1) de un número positivo. Por ejemplo, el divisor... | PCEX | ||
| 31 | Rotating the List Values to the Left by One Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 32 | Rotating the List Values to the Left by Two Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 33 | Rotating the List Values to the Right by One Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 34 | Rotating the List Values to the Right by Two Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 35 | Rotating the List Values to the Left by One Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 36 | Rotating the List Values to the Left by Two Position | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 37 | Rotating the List Values to the Right by One Position. | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 38 | Rotating the List Values to the Right by Two Position. | Construct a program that has a function that receives a list of values and returns the list rotated to the... | PCEX | ||
| 39 | 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 |
| 40 | 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 |
| 41 | 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 |
| 42 | 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 |
| 43 | 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 |
| 44 | 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 |
| 45 | 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 |
| 46 | 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 |
| 47 | 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 |
| 48 | 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 |
| 49 | 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 |
| 50 | 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 |
| 51 | 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 |
| 52 | 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 |
| 53 | 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 |
| 54 | 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 |
| 55 | 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 |
| 56 | 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 |
| 57 | 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 |
| 58 | 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 |
| 59 | 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 |
| 60 | 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 |
| 61 | 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 |
| 62 | 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 |
| 63 | 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 |
| 64 | 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 |
| 65 | 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 |
| 66 | 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 |
| 67 | 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 |
| 68 | 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 |
| 69 | 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 |
| 70 | 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 |
| 71 | 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 |
| 72 | 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 |
| 73 | 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 |
| 74 | 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 |
| 75 | 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 |
| 76 | c_elementi_ispod_glavne_dijagonale | Napisati program koji postavlja sve elemente ispod glavne dijagonale na 0, a zatim ispisuje matricu na ekran. | PCEX | ||
| 77 | Printing Numbers in Descending Order | Construct a program that accepts a positive integer N and then prints all the positive numbers in the sequence N,... | PCEX | ||
| 78 | 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 |
| 79 | Creating an Array of Odd Numbers | Construct a program that creates an array of first ten positive odd numbers. | PCEX | ||
| 80 | Creating an Array of Odd Numbers | Construct a program that creates an array of first ten positive odd numbers. | PCEX | ||
| 81 | Printing the Squares of Numbers Within a Specified Range (Case 1) | Construct a program to write out the squares of even positive integers less than or equal to 10. | PCEX | ||
| 82 | Printing the Squares of Numbers Within a Specified Range (Case 2) | Construct a program to write out the squares of odd positive integers less than 10. | PCEX | ||
| 83 | Printing the Squares of Numbers Within a Specified Range (Case 1) | Construct a program to write out the squares of even positive integers less than or equal to 10. | PCEX | ||
| 84 | Printing the Squares of Numbers Within a Specified Range (Case 2) | Construct a program to write out the squares of odd positive integers less than 10. | PCEX | ||
| 85 | Determining the Sign of an Integer | Construct a program that determines whether an integer is positive, negative, or zero. | PCEX | ||
| 86 | Determining the Sign of an Integer | Construct a program that determines whether an integer is positive, negative, or zero. | PCEX | ||
| 87 | Determining the Sign of an Integer | Construct a program that determines whether an integer is positive, negative, or zero. | PCEX | ||
| 88 | Add Values to an Empty List (Case 1) | Construct a program that creates a list of first ten positive odd numbers. | PCEX | ||
| 89 | Add Values to an Empty List (Case 1) | Construct a program that creates a list of first ten positive odd numbers. | PCEX | ||
| 90 | Printing the Squares of Numbers Within a Specified Range (Case 1) | Construct a program to write out the squares of even positive integers less than or equal to 10. | PCEX | ||
| 91 | Printing the Squares of Numbers Within a Specified Range (Case 2) | Construct a program to write out the squares of odd positive integers less than 10. | PCEX | ||
| 92 | Determining the Sign of an Integer | Construct a program that determines whether an integer is positive, negative, or zero. | PCEX | ||
| 93 | c_zamjena_dvije_kolone | Napisati program koji zamjenjuje dvije kolone matrice (elementi jedne kolone postaju elementi druge kolone, i obrnuto). Korisnik unosi indekse dvije... | PCEX | ||
| 94 | c_zamjena_dva_reda | Napisati program koji zamjenjuje dva reda matrice (elementi jednog reda postaju elementi drugog reda, i obrnuto). Korisnik unosi indekse dva... | PCEX | ||
| 95 | c_zamjena_redova | Napisati program koji zamjenjuje redove matrice (elementi jednog reda postaju elementi drugog reda, i obrnuto). Korisnik unosi indekse redova koje... | PCEX | ||
| 96 | Recursive Factorial | Define a function that returns the factorial of a given positive integer. | jsParsons | functions, recursion, search, search algorithms, sorting, sorting algorithms | |
| 97 | Crear una función recursiva | Define una funcion que devuelva el factorial de un entero positivo dado. | jsParsons | recursion | |
| 98 | 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 |
| 99 | Bucket Hashing Slideshow | Algorithm Visualization | Slideshow showing the basic hash method of hashing to any free position within a computed bucket. | OpenDSA | Bucket Hashing |
| 100 | csedpad.09.WhileLoops.whileloops_1 | Construct a program that finds the smallest divisor (other than 1) of a positive number. For example, the smallest divisor... | PCEX | ||
| 101 | 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 |
| 102 | Introduction to Hashing Slideshow | Algorithm Visualization | Slideshow showing the simplest of hashing approaches: Just put a key into that array position. | OpenDSA | Hashing |
| 103 | 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 | ||
| 104 | c_promjena_vrijednosti_preko_pokazivaca | U programu je deklarisan realan broj x i pokazivač double *p. Postavite p da pokazuje na x, promijenite vrijednost x... | PCEX | ||
| 105 | c_dinamicka_alokacija_niza_calloc | Napisati program koji koristi dinamičku alokaciju memorije za cjelobrojni niz. Program treba imati posebnu funkciju za alokaciju niza i posebnu... | PCEX | ||
| 106 | c_dinamicka_alokacija_niza_malloc | Napisati program koji koristi dinamičku alokaciju memorije za cjelobrojni niz. Program treba imati posebnu funkciju za alokaciju niza i posebnu... | PCEX | ||
| 107 | c_citanja_izmjena_koristenjem_kursora_challenge | Napisati program koji otvara tekstualnu datoteku podaci.txt u update režimu. Program treba pomoću funkcije fseek postaviti kursor na sredinu datoteke,... | PCEX | ||
| 108 | 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 |
| 109 | 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 |
| 110 | c_izmjena_binarnih_datoteka_challenge | Napisati program koji radi s binarnom datotekom poruke.dat. Datoteka sadrži jednu kratku tekstualnu poruku fiksne dužine (niz znakova) od maksimalno... | PCEX | ||
| 111 | c_brojanje_rijeci_razmaci | Napisati program u kojem se omogućava unos nekog stringa s najviše 1000 karaktera, a zatim se ispisuje broj riječi koje... | PCEX | ||
| 112 | c_dinamicka_alokacija_nizova_challenge | Napisati program koji koristi dinamičku alokaciju memorije koja je inicijalizirana s nulama za niz struktura. Definisati strukturu Student koja sadrži... | PCEX | ||
| 113 | Counting the Number of Valid and Banned Product Codes (Case 1) | Suppose a hypothetical company uses codes to represent its various products. A product code includes, among other information, a character... | PCEX | ||
| 114 | Counting the Number of Valid and Banned Product Codes (Case 2) | Suppose a hypothetical company uses codes to represent its various products. A product code includes, among other information, a character... | PCEX | ||
| 115 | Counting the Number of Valid and Banned Product Codes (Case 1) | Suppose a hypothetical company uses codes to represent its various products. A product code includes, among other information, a character... | PCEX | ||
| 116 | Counting the Number of Valid and Banned Product Codes (Case 2) | Suppose a hypothetical company uses codes to represent its various products. A product code includes, among other information, a character... | PCEX | ||
| 117 | c_pokazivaci_manipulacija_clanova_niza | Dat je niz cijelih brojeva i pokazivač p koji pokazuje na drugi član niza. Uvećati vrijednost drugog člana niza za... | PCEX | ||
| 118 | Counting the Number of Valid and Banned Product Codes (Case 1) | Suppose a hypothetical company uses codes to represent its various products. A product code includes, among other information, a character... | PCEX | ||
| 119 | Counting the Number of Valid and Banned Product Codes (Case 2) | Suppose a hypothetical company uses codes to represent its various products. A product code includes, among other information, a character... | PCEX | ||
| 120 | Selection sort | Ascending-order Selection sort operates by finding the minimum element of an array and moving it to the “beginning” of the... | PCEX | ||
| 121 | Selection sort | Descending-order Selection sort operates by finding the maximum element of an array and moving it to the “beginning” of the... | PCEX | ||
| 122 | Tree traversal. | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | ||
| 123 | Tree traversal. | The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... | PCEX | ||
| 124 | c_funkcija_podstring | Napisati funkciju podstring koja prima dva stringa s1 i s2, te provjerava da li je s2 podstring stringa s1. Ako... | PCEX | ||
| 125 | c_funkcija_ukloni_razmake | Napisati funkciju ukloni_razmake koja prima string i uklanja sve razmake u njemu. Funcija treba vratiti pokazivač na početak izmijenjenog stringa. | PCEX | ||
| 126 | 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 | algorithm analysis, for loop, nested loops | |
| 127 | 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 | for loop, loops | |
| 128 | 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 | nested loops | |
| 129 | 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 |
| 130 | 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 |
| 131 | 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 |
| 132 | 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 |
| 133 | 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 |
| 134 | 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 |
| 135 | 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 |
| 136 | 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 |
| 137 | c_izmjena_binarnih_datoteka | Napisati program koji omogućava dodavanje novih zapisa u binarnu datoteku brojevi.dat. Definisati strukturu Broj koja sadrži jedan cijeli broj. Program... | PCEX | ||
| 138 | c_citanje_iz_txt_challenge | Napisati program koji čita podatke iz tekstualne datoteke rezultati.txt. Datoteka sadrži više redova, pri čemu je svaki red zapisan u... | PCEX | ||
| 139 | c_strukture_i_nizovi | Napisati program u programskom jeziku C koji omogućava rad sa studentima koristeći strukture i nizove. Potrebno je definisati strukturu Student... | PCEX | ||
| 140 | c_strukture_i_nizovi_pokazivaci | Napisati program koji omogućava rad sa studentima koristeći strukture i nizove. Potrebno je definisati strukturu Student koja sadrži ime i... | PCEX | ||
| 141 | c_pisanje_u_binarne_datoteke_challenge | Napisati program koji omogućava upis podataka o kursevima u binarnu datoteku kurs.dat. Definisati strukturu Kurs koja sadrži naziv kursa, šifru... | PCEX | ||
| 142 | c_citanje_izmjena_datoteka_koristenjem_kursora | Napisati program koji radi sa tekstualnom datotekom podaci.txt otvorenom u read-update režimu. Program treba prvo otvoriti datoteku i pomoću funkcije... | PCEX | ||
| 143 | c_pisanje_u_datoteke_challenge | Napisati program koji omogućava unos podataka o knjigama i njihov upis u tekstualnu datoteku knjige.txt. Definisati strukturu Knjiga koja sadrži... | PCEX | ||
| 144 | 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 |