Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 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
2 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
3 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 trees
4 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 trees
5 Tree Python CodeVisualization for demonstrating Tree JSVEE binary search, trees
6 Tree Node Access Python CodeVisualization for demonstrating Tree Node Access JSVEE binary search, trees
7 Tree traversal. The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX binary search, trees
8 Tree traversal. Challenge The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX trees
9 Tree inorder traversal Python PredictingFinalResult for demonstrating Tree inorder traversal QuizPET binary search, trees
10 Tree preorder traversal Python PredictingFinalResult for demonstrating Tree preorder traversal QuizPET binary search, trees
11 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
12 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
13 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
14 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
15 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
16 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
17 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
18 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
19 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
20 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
21 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
22 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
23 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
24 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
25 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
26 Path lengths in binary tree Code Completion Your task is to compute a set of all path lengths in a binary tree. For example, given this tree, CodeCheck Tree Structures
27 Letter frequency map Code Completion Your task is to produce a map of the frequencies of all letters in a string. Letters are represented as... CodeCheck Tree Structures
28 Unique words in two string sets Code Completion Implement a method that receives two arrays of strings and determines which words are unique to each. CodeCheck Tree Structures
29 Make Person class comparable Code Completion The program below will fail to run because the Person class does not implement the Comparable interface. Modify the class... CodeCheck Tree Structures
30 Hash code for Person class Code Completion When you add instances of the given Person class in a HashSet, the resulting hash set is too large. Evidently,... CodeCheck Tree Structures
31 Map words to their lengths Code Completion Given an array of strings, create a tree map with each string as a key and its corresponding value the... CodeCheck Tree Structures
32 Letter set Code Completion Your task is to produce a set of all letters in a string. Letters are represented as strings of length... CodeCheck Tree Structures
33 Hash code for LabeledPoint Code Completion Implement the hashCode method for the LabeledPoint class so that equal objects have the same hash code and that unequal... CodeCheck Tree Structures
34 A fast priority queue Code Completion It is possible to provide a fast priority queue implementation if the inserted items have a bounded number of integer... CodeCheck Tree Structures
35 Map word lengths to words Code Completion Given an array of strings, create a tree map whose keys are the string lengths and whose values are the... CodeCheck Tree Structures
36 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
37 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
38 KD Tree Visualization Algorithm Visualization Algorithm Visualization illustrating the KD Tree. OpenDSA KD Tree
39 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
40 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
41 Binary Tree Traversal Summary Questions Question, Battery Self-practice questions about binary tree traversals. OpenDSA Binary Tree Traversal
42 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
43 General Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given general tree. OpenDSA Sequential Representation, General Tree
44 Binary Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given binary tree. OpenDSA Sequential Representation, Binary Tree
45 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
46 General Tree Postorder Traversal Slideshow Algorithm Visualization Slideshow showing postorder traveral of a general tree, and demonstrates the general tree ADT. OpenDSA General Tree
47 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
48 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
49 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
50 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
51 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
52 Parse Tree Example for a Math Expression Algorithm Visualization Slideshow visualizing generation of a parse tree for a simple math expression. OpenDSA Parse Tree
53 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
54 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
55 Constructing a Binomial Tree Algorithm Visualization Slideshow showing a small example of building a binomial tree. OpenDSA Binomial Tree
56 Inserting binary tree In a BinaryTree, adding new nodes to the tree is an important capability to have. Construct a simple implementation of... PCEX binary search, recursion, trees
57 Inserting binary tree Challenge In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... PCEX recursion, trees
58 Binary Search Tree Insert Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST insert. OpenDSA Binary Search Tree
59 Binary Search Tree Remove Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST remove. OpenDSA Binary Search Tree
60 Binary Search Tree Search Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST search. OpenDSA Binary Search Tree
61 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
62 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
63 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
64 Binary Search Tree Summary Questions Question, Battery Self-practice questions about Binary Search Trees. OpenDSA Binary Search Tree
65 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
66 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
67 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
68 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
69 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
70 BST Delete Max Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive delete of the maximum value in a BST. OpenDSA Binary Search Tree
71 BST Insert Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive insert in a BST. OpenDSA Binary Search Tree
72 BST Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive remove value in a BST. OpenDSA Binary Search Tree
73 BST Search Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive search in a BST. OpenDSA Binary Search Tree
74 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
75 Huffman Coding Tree Slideshow: Setting Codes Algorithm Visualization Slideshow visualizing the Huffman Coding Tree code setting step. OpenDSA Huffman Coding Tree
76 Huffman Coding Tree Slideshow: Decoding Algorithm Visualization Slideshow visualizing the process of decoding a string of Huffman Codes. OpenDSA Huffman Coding Tree
77 Huffman Coding Tree Slideshow: Label Edges Algorithm Visualization Slideshow visualizing the Huffman Coding Tree edge labeling step. OpenDSA Huffman Coding Tree
78 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
79 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
80 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
81 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
82 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
83 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
84 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
85 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
86 Binary search Binary Search operates by dividing an array in half, and then determining whether or not the target value would be... PCEX binary search, recursion, search, search algorithms, sorting, trees
87 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
88 Recursive Tree Processing: Value Summation Tracing Exercise A question related to tree processing in a functional programming language: Value summation. OpenDSA Functional Programming
89 Recursive Tree Processing: Substitution Question A question related to tree processing in a functional programming language: Substitution. OpenDSA Functional Programming
90 Recursive Tree Processing: Substitution 2 Question A question related to tree processing in a functional programming language: Substitution 2. OpenDSA Functional Programming
91 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
92 Printing A Right Triangle Star Pattern A Right triangle star pattern contains N asterisks in N-th row. Construct a program that receives the number of rows... PCEX nested loops
93 Printing an Inverted Right Triangle Star Pattern An inverted right triangle star pattern of N rows contains N-i+1 asterisks in the i-th row. Construct a program that... PCEX nested loops
94 q_py_tree_inorder_traverse_es Python PredictingFinalResult for demonstrating q_py_tree_inorder_traverse_es QuizPET
95 q_py_tree_preorder_traverse_es Python PredictingFinalResult for demonstrating q_py_tree_preorder_traverse_es QuizPET
96 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
97 Typical Mistakes During Tree Traversal Code Tracing Presentation Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. OpenDSA Preorder Traversal
98 Context-Free Language Derivation Trees Frameset Programmed Instruction Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. OpenDSA Context-Free Language
99 Context-Free Language Derivation Trees Example Algorithm Visualization Visualization of a derviation tree from a given context-free grammar. OpenDSA Context-Free Language
100 Reduction of True and False using Church Bools Algorithm Visualization Slideshow visualizing reduction of true and false using Church bools. OpenDSA Lambda Calculus
101 Printing A Right Triangle Star Pattern A Right triangle star pattern contains N asterisks in N-th row. Construct a program that receives the number of rows... PCEX loops, nested loops
102 Printing A Right Triangle Star Pattern A Right triangle star pattern contains N asterisks in N-th row. Construct a program that receives the number of rows... PCEX algorithm analysis, for loop, nested loops
103 Printing an Inverted Right Triangle Star Pattern An inverted right triangle star pattern of N rows contains N-i+1 asterisks in the i-th row. Construct a program that... PCEX nested loops
104 Printing A Right Triangle Star Pattern An inverted right triangle star pattern of N rows contains N-i+1 asterisks in the i-th row. Construct a program that... PCEX for loop, nested loops
105 Imprimir un Patron de Estrellas en Forma de Triangulo Rectangulo Un patrón de estrellas en forma de triángulo rectángulo contiene N asteriscos en la N-ésima fila. Construya un programa que... PCEX
106 Imprimir un Patron de Estrellas en Forma de Triangulo Rectangulo Invertido Un patrón de estrellas en forma de triángulo rectángulo invertido de N filas contiene N-i+1 asteriscos en la i-ésima fila.... PCEX for loop, loops
107 Recursive Operations in a Binary Tree Presentation Slideshow discussing recursive operations on a binary tree. OpenDSA Array-Based Stack
108 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
109 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
110 Determining When at Least One of the Three Boolean Variables is True Construct a program that determines whether at least one of the three boolean variables is true based on the inputs... PCEX boolean expressions
111 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
112 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
113 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
114 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
115 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
116 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
117 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
118 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
119 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
120 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
121 c_unos_karaktera_za_karakterom Napisati program koji traži da tri studenta (Tarik, Bojan i Mirza) unesu sa standardnog ulaza po jedno slovo koje predstavlja... PCEX
122 Modulo is Even Construct a function that will return True if a given number is even, otherwise false. jsParsons algorithm analysis, functions, if-else statement
123 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 functions
124 Practicar ciclos while anidados Construye un programa que imprima un triangulo rectangulo invertido. Supone que 'tamano' esta definido y contiene un valor entero. jsParsons loops, while loop
125 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
126 Determinando Si Uno Es Adolescente (Caso 1) Construir un programa que reciba un string que tiene el nombre de usuario y la edad separados por dos puntos,... PCEX exceptions
127 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
128 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
129 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 algorithm analysis, nested loops, while loop
130 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
131 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
132 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
133 Pythagorean Theorem (Case 2) Suppose that the user provides two input values for a right-angle triangle. The first input is for the length of... PCEX arithmetic operations
134 Pythagorean Theorem (Case 2) Suppose that the user provides two input values for a right-angle triangle. The first input is for the length of... PCEX
135 Three Booleans Construct a program that determines whether at least one of the three boolean variables is true based on the inputs... PCEX boolean expressions
136 Three Booleans Construct a program that determines whether at least one of the three boolean variables is True based on the inputs... PCEX boolean expressions, boolean logic, if-else statement, logical operators
137 Pythagorean Theorem (Case 2) Suppose that the user provides two input values for a right-angle triangle. The first input is for the length of... PCEX arithmetic operations, arithmetic operators, data types, operators, variables
138 Pythagorean Theorem Suppose that the user provides two input values for a right-angle triangle. The first input is for the length of... PCEX operators, variables
139 c_citanje_podatka_iz_bin_datoteke Napisati program koji iz binarne datoteke broj.dat učitava jedan podatak tipa double. Program treba otvoriti datoteku u binarnom režimu za... PCEX
140 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
141 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
142 c_dinamicka_alokacija_varijable_calloc Napisati program koji dinamički alocira memoriju za jednu realnu varijablu. Program treba omogućiti korisniku unos realnog broja sa tastature, zatim... PCEX
143 c_dinamicka_alokacija_varijable_malloc Napisati C program koji dinamički alocira memoriju za jednu cjelobrojnu varijablu. Program treba omogućiti korisniku da unese cijeli broj, smjesti... PCEX
144 c_ispisi_sa_sirinom_i_preciznosti Napisati program koji ispisuje dva cijela broja poravnata udesno i razdvojena razmakom, pri čemu prvi broj treba zauzeti barem 5... PCEX
145 c_ispisi_sa_sirinom_preciznosti_i_vodecim_nulama Napisati program koji na ekran ispisuje broj 10 na 5 mjesta, pri čemu dodatna mjesta trebaju biti ispunjena nulama. Nakon... PCEX
146 c_strukture_s_pokazivacima Napisati program u kojem se definišu strukture Tacka i Kruznica. Program treba omoguciti unos obje strukture i ispisati da li... PCEX
147 Linked List Operations - Contains In this example, we will implement the contains() method that accepts a value and returns True if the value is... PCEX
148 c_pokazivaci_pomjeranje_kroz_niz Dat je niz cijelih brojeva i pokazivač p koji pokazuje na prvi član niza. Program treba ispisati vrijednost prvog i... PCEX
149 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
150 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
151 c_strukture Napisati program u kojem se definišu strukture Tacka i Kruznica. Program treba omoguciti unos obje strukture i ispisati da li... PCEX
152 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
153 Calculating the Winning Percentage of a Sports Team (Case 3) Construct a program that receives from the user the number of games that a sports team won and tied in... PCEX while loop
154 (MathClass) MathExample1 - CSEdPad Demonstrate the understanding of Math class concepts by constructing a program that finds the length of the hypotenuse in of... AnnEx math
155 Math class 1 (Memphis) Simple example of how to use Java Math methods. This program shows that the trig identity sin^2(x) + cos^2(x) =... AnnEx math
156 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
157 Calculating the Winning Percentage of a Sports Team (Case 3) Construct a program that receives from the user the number of games that a sports team won and tied in... PCEX while loop
158 Calculating the Winning Percentage of a Sports Team (Case 3) Construct a program that receives from the user the number of games that a sports team won and tied in... PCEX while loop
159 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
160 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
161 Pythagorean Theorem (Case 1) Construct a program that accepts two input values from the user, one for each side of a right-angle triangle. The... PCEX arithmetic operations, operators, variables
162 Determining When All Three Boolean Variables Are Equal Construct a program that receives the value of three boolean variables from the user and determines whether all variables have... PCEX boolean expressions
163 c_izbacivanje_nte_rijeci Napisati program koji iz datog stringa izbacuje n-tu riječ po redu. Brojanje počinje od 1 (prva riječ se treba obrisati... PCEX
164 c_citanje_iz_bin_datoteke_challenge Napisati program koji čita podatke iz binarne datoteke proizvodi.dat. Datoteka sadrži zapise tipa Proizvod, pri čemu svaki zapis obuhvata naziv... PCEX
165 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
166 c_dinamicka_alokacija_varijabli_challenge Napisati program koji od korisnika traži unos broja elemenata n, a zatim u petlji dinamički alocira memoriju za jednu cijelobrojnu... PCEX
167 c_celzijus_farenhajt_konverzija Napisati program koji traži unos broja stepeni u Celzijusima i pretvara ih u Farenhajte prema formuli: F = C *... PCEX
168 c_farenhajt_celzijus_konverzija Napisati program koji traži unos broja stepeni u Celzijusima i pretvara ih u Farenhajte prema formuli: C = (5/9) *... PCEX
169 c_max_number Napisati program koji sa tastature traži unos dva cijela broja, a zatim na ekran ispisuje onaj broj koji je veći... PCEX
170 c_zamjena_svakog_drugog_znaka Napisati program u kojem se u unešenom stringu zamijeni svaki drugi znak znakom '*'. Kandidati za zamjenu su znakovi koji... PCEX
171 c_niz_karaktera_brojanje_samoglasnika Napisati program koji prolazi kroz niz karaktera i broji koliko se puta u njemu pojavljuju samoglasnici. Program treba prepoznati i... PCEX
172 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
173 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
174 c_pisanje_podatka_u_binarnu_datoteku Napisati program u programskom jeziku C koji u binarnu datoteku podatak.dat upisuje jedan podatak tipa double. Program treba otvoriti datoteku... PCEX
175 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
176 c_pokazivaci_na_karaktere_brojanje_samoglasnika Napisati program koji prolazi kroz niz karaktera koristeći pokazivačku aritmetiku i broji koliko se puta pojavljuju samoglasnici. Program treba prepoznati... PCEX
177 c_pokazivaci_pomjeranje_kroz_niz_i_manipulacija Napisati program u kojem je inicijalizovan niz sa 10 cjelobrojnih vrijednosti i pokazivač na prvi element niza. Vrijednost prvog elementa... PCEX
178 Concatenando Caracteres de Dos Strings (Caso 1) Construya un programa que tenga una función que reciba dos strings y devuelva un string formado a partir de los... PCEX strings
179 Determinando Cuando Comprar un Nuevo Telefono (Caso 1) Construir un programa que determine si es el momento de comprar un nuevo teléfono basado en las entradas que recibe... PCEX conditionals
180 Determinando Cuando Comprar un Nuevo Telefono (Caso 2) Construir un programa que determine si es el momento de comprar un nuevo teléfono basado en las entradas que recibe... PCEX conditionals
181 Pythagorean Theorem (Case 1) Construct a program that accepts two input values from the user, one for each side of a right-angle triangle. The... PCEX
182 Calculando el Porcentaje de Victorias de un Equipo (Caso 3) Construye un programa que reciba del usuario el número de partidos que un equipo ganó y empató en un torneo... PCEX conditionals, loops, while loop
183 c_funkcija_nadji_rijec Napisati funkciju nadji_rijec koja prima dva stringa s1 i s2, pri čemu s1 predstavlja neku rečenicu, a s2 jednu riječ.... PCEX
184 c_unos_karaktera_getchar Napisati program koji traži od korisnika da unese jedan karakter, koji se čita pomoću getchar() funkcije. Program treba zatim ispisati... PCEX
185 c_unos_broja_i_karaktera Napisati program u kojem se traži unos broja nekog stola (prirodan broj), a nakon toga jedno malo slovo koje označava... PCEX
186 c_pisanje_u_datoteke Napisati program koji iz tekstualne datoteke ispit.txt učitava podatke o studentima. Datoteka sadrži zapise u kojima su za svakog studenta... PCEX
187 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
188 c_funkcija_podstring Napisati funkciju podstring koja prima dva stringa s1 i s2, te provjerava da li je s2 podstring stringa s1. Ako... PCEX
189 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
190 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
191 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
192 Pythagorean Theorem Construct a program that accepts two input values from the user, one for each side of a right-angle triangle. The... PCEX arithmetic operations, arithmetic operators, math, operators, variables
193 Pythagorean Theorem Construct a program that accepts two input values from the user, one for each side of a right-angle triangle. The... PCEX operators, variables
194 Determining When All Three Boolean Variables Are Equal Construct a program that receives the value of three boolean variables from the user and determines whether all variables have... PCEX boolean expressions
195 Three Booleans (Case 3) Construct a program that receives the value of three boolean variables from the user and determines whether all variables have... PCEX boolean expressions, if-else statement
196 Drawing with fill3DRect Code Completion Complete the ThreeButtonComponent class to draw three boxes that look like push buttons. Each box is a Rectangle drawn in... CodeCheck Objects
197 Pair class with compareTo method Code Completion We sometimes want to compare two Pair objects, for example, when using pairs as keys in a tree map. CodeCheck Generic Types
198 Using instanceof for Converting Between Animal Types Code Completion The Cat and Dog class below implement the Animal interface. All animals have names, but only dogs do tricks. Implement... CodeCheck Interfaces
199 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
200 c_citanje_iz_bin_datoteke Napisati program koji omogućava čitanje podataka o osobama iz binarne datoteke baza.dat. Datoteka sadrži zapise tipa Osoba, pri čemu svaki... PCEX
201 c_citanje_struktura_iz_datoteka Napisati program koji iz tekstualne datoteke ispit.txt učitava podatke o studentima. Datoteka sadrži više redova, pri čemu svaki red ima... PCEX
202 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
203 c_pisanje_u_binarne_datoteke Napisati program koji omogućava upis podataka o osobama u binarnu datoteku baza.dat. Definisati strukturu Osoba koja sadrži ime osobe i... PCEX
204 Concatenando Caracteres de Dos Strings (Caso 2). Construye un programa que tenga una función que reciba dos strings y devuelva un string formado a partir de las... PCEX strings
205 Queue Class - Check if Element Exists In this example, you will use Queue class from queue provided by python. This class contains methods for adding a... PCEX
206 Queue Class - Check if Element Exists In this example, you will use Queue class from queue provided by python. This class contains methods for adding a... PCEX
207 c_zamjena_redova Napisati program koji zamjenjuje redove matrice (elementi jednog reda postaju elementi drugog reda, i obrnuto). Korisnik unosi indekse redova koje... PCEX
208 Search in the linked list. When using a LinkedList, it is possible that you may want to search through the list to see if a... PCEX linked list, search algorithms