Showing 0–0 of 0 results
# Exercise Title Features Description Platform Keywords
1 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
2 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
3 Tree inorder traversal Python PredictingFinalResult for demonstrating Tree inorder traversal QuizPET binary search, trees
4 Tree preorder traversal Python PredictingFinalResult for demonstrating Tree preorder traversal QuizPET binary search, trees
5 Tree traversal. The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX
6 Tree traversal. The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order... PCEX
7 Tree Python CodeVisualization for demonstrating Tree JSVEE binary search, trees
8 Tree Node Access Python CodeVisualization for demonstrating Tree Node Access JSVEE binary search, trees
9 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
10 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
11 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
12 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
13 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
14 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
15 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
16 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
17 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
18 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
19 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
20 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
21 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
22 py_trees_insert_binarytree PCEX Set of activities for py_trees_insert_binarytree PCEX
23 py_trees_traversal PCEX Set of activities for py_trees_traversal PCEX
24 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
25 KD Tree Visualization Algorithm Visualization Algorithm Visualization illustrating the KD Tree. OpenDSA KD Tree
26 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
27 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
28 Binary Tree Traversal Summary Questions Question, Battery Self-practice questions about binary tree traversals. OpenDSA Binary Tree Traversal
29 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
30 General Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given general tree. OpenDSA Sequential Representation, General Tree
31 Binary Tree Sequential Representation Proficiency Exercise Tracing Exercise User must show the sequential representation for a given binary tree. OpenDSA Sequential Representation, Binary Tree
32 Recursive Tree Processing: Value Summation Tracing Exercise A question related to tree processing in a functional programming language: Value summation. OpenDSA Functional Programming
33 Recursive Tree Processing: Substitution Question A question related to tree processing in a functional programming language: Substitution. OpenDSA Functional Programming
34 Recursive Tree Processing: Substitution 2 Question A question related to tree processing in a functional programming language: Substitution 2. OpenDSA Functional Programming
35 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
36 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
37 General Tree Postorder Traversal Slideshow Algorithm Visualization Slideshow showing postorder traveral of a general tree, and demonstrates the general tree ADT. OpenDSA General Tree
38 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
39 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
40 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
41 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
42 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
43 Parse Tree Example for a Math Expression Algorithm Visualization Slideshow visualizing generation of a parse tree for a simple math expression. OpenDSA Parse Tree
44 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
45 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
46 Constructing a Binomial Tree Algorithm Visualization Slideshow showing a small example of building a binomial tree. OpenDSA Binomial Tree
47 q_py_tree_inorder_traverse_es Python PredictingFinalResult for demonstrating q_py_tree_inorder_traverse_es QuizPET
48 q_py_tree_preorder_traverse_es Python PredictingFinalResult for demonstrating q_py_tree_preorder_traverse_es QuizPET
49 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
50 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
51 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
52 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
53 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
54 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
55 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
56 Inserting binary tree In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... PCEX
57 Inserting binary tree In a BinaryTree, adding new nodes to the tree is an important capability to have.\nConstruct a simple implementation of a... PCEX
58 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
59 Binary Search Tree Insert Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST insert. OpenDSA Binary Search Tree
60 Binary Search Tree Remove Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST remove. OpenDSA Binary Search Tree
61 Binary Search Tree Search Proficiency Exercise Tracing Exercise Interactive exercise to demonstrate proficiency with BST search. OpenDSA Binary Search Tree
62 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
63 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
64 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
65 Binary Search Tree Summary Questions Question, Battery Self-practice questions about Binary Search Trees. OpenDSA Binary Search Tree
66 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
67 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
68 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
69 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
70 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
71 Typical Mistakes During Tree Traversal Code Tracing Presentation Slideshow demonstrating some typical mistakes when writing recursive binary tree traversals. OpenDSA Preorder Traversal
72 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
73 Huffman Coding Tree Slideshow: Setting Codes Algorithm Visualization Slideshow visualizing the Huffman Coding Tree code setting step. OpenDSA Huffman Coding Tree
74 Huffman Coding Tree Slideshow: Decoding Algorithm Visualization Slideshow visualizing the process of decoding a string of Huffman Codes. OpenDSA Huffman Coding Tree
75 Huffman Coding Tree Slideshow: Label Edges Algorithm Visualization Slideshow visualizing the Huffman Coding Tree edge labeling step. OpenDSA Huffman Coding Tree
76 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
77 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
78 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
79 Context-Free Language Derivation Trees Frameset Programmed Instruction Programmed Instruction Frameset discussing derivation trees for Context-Free Grammars. OpenDSA Context-Free Language
80 Context-Free Language Derivation Trees Example Algorithm Visualization Visualization of a derviation tree from a given context-free grammar. OpenDSA Context-Free Language
81 Reduction of True and False using Church Bools Algorithm Visualization Slideshow visualizing reduction of true and false using Church bools. OpenDSA Lambda Calculus
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 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
84 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
85 Recursive Operations in a Binary Tree Presentation Slideshow discussing recursive operations on a binary tree. OpenDSA Array-Based Stack
86 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
87 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
88 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
89 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
90 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
91 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
92 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
93 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
94 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
95 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
96 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
97 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
98 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
99 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
100 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
101 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
102 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
103 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
104 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
105 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
106 BST Delete Max Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive delete of the maximum value in a BST. OpenDSA Binary Search Tree
107 BST Insert Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive insert in a BST. OpenDSA Binary Search Tree
108 BST Remove Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive remove value in a BST. OpenDSA Binary Search Tree
109 BST Search Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow visualizing recursive search in a BST. OpenDSA Binary Search Tree
110 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
111 csedpad.12.NestedLoops.nestedloops Print a triangle of stars. PCEX
112 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
113 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
114 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
115 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
116 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
117 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
118 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
119 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
120 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
121 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
122 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
123 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
124 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
125 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
126 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
127 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
128 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
129 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
130 csedpad.03.MathClass.mathclass Demonstrate understanding of Math class concepts by constructing a program that finds the length of the hypotenuse in of a... PCEX
131 csedpad.MathClass.mathclass Demonisterate the understanding of Math class concepts by construct a program that finds the length of the hypotenuse in of... PCEX
132 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
133 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
134 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
135 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
136 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
137 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
138 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
139 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
140 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
141 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
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_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
144 c_strukture Napisati program u kojem se definišu strukture Tacka i Kruznica. Program treba omoguciti unos obje strukture i ispisati da li... PCEX
145 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
146 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
147 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
148 (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
149 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
150 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
151 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
152 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
153 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
154 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
155 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
156 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
157 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
158 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
159 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
160 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
161 c_celzijus_farenhajt_konverzija Napisati program koji traži unos broja stepeni u Celzijusima i pretvara ih u Farenhajte prema formuli: F = C *... PCEX
162 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
163 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
164 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
165 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
166 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
167 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
168 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
169 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
170 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
171 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
172 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
173 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
174 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
175 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
176 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
177 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
178 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
179 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
180 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
181 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
182 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
183 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
184 c_funkcija_podstring Napisati funkciju podstring koja prima dva stringa s1 i s2, te provjerava da li je s2 podstring stringa s1. Ako... PCEX
185 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
186 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
187 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
188 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
189 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
190 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
191 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
192 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
193 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
194 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
195 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
196 c_zamjena_redova Napisati program koji zamjenjuje redove matrice (elementi jednog reda postaju elementi drugog reda, i obrnuto). Korisnik unosi indekse redova koje... PCEX