Showing 0-0 of 0 results
# Exercise Title Features Description Platform Keywords
1 List Implementation Overhead Exercise Calculation Exercise, Battery User provides overhead computations for specified implementations. OpenDSA Linked List, Array-Based List, Overhead, List Implementation Comparison
2 List Element Data Slideshow Algorithm Visualization Slideshow discussing the tradeoffs for storing element values in link nodes vs. references to element values. OpenDSA List Element Implementation
3 List Element Deletion Slideshow Algorithm Visualization Slideshow discussing the design choices on what to do when a list element is deleted. OpenDSA List Element Implementation
4 List Element Type Slideshow Algorithm Visualization Slideshow illustrating the choice between storing non-homogeneous data types in list nodes and limiting to a homogenous data type. OpenDSA List Element Implementation
5 Inheritance - Sparrow Free Coding Problem Coding Question CodeWorkout superclass, subclass, abstract, implement, overwrite
6 Implement addLast using raw nodes Code Completion Implement the addLast method in this simplified LinkedList class. CodeCheck Linear Data Structures
7 Implement LabeledPoint.toString Code Completion A labeled point has an x- and y-position and a label. CodeCheck Inheritance
8 Implement LabeledPoint.equals Code Completion A labeled point has an x- and y-position and a label. CodeCheck Inheritance
9 Implement Tile.translate Code Completion A Tile class extends Rectangle. It is to be used for non-overlapping tilings. Your task is to override the translate... CodeCheck Inheritance
10 Implement the Doublable interface Code Completion Some objects can be doubled, for example a bank account. The result would be a bank account with twice the... CodeCheck Interfaces
11 Implement an Interface to Change Rectangle Dimensions Code Completion Complete the RectangleManager class below so that it implements the given Adjuster interface. The implementation should use the h and... CodeCheck Interfaces
12 Implement an Interface to Provide Museum's Car Count Code Completion Complete the CarMuseum class below so that it implements the given Measurable interface. Your tasks are as follows: CodeCheck Interfaces
13 Queue Implementation Implementing Queue. Using Class to construct a Queue structure. PCEX queue, queues
14 Queue implementation Python PredictingFinalResult for demonstrating Queue implementation QuizPET queue, queues
15 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
16 Mergsort Implementation Slideshow: Final Pass Algorithm Visualization Slideshow showing the details of implementing Mergesort using an array. This is the first of a two-part series, showing the... OpenDSA Mergesort
17 Mergsort Implementation Slideshow: Optimized Final Pass Algorithm Visualization Slideshow showing the details of implementing Mergesort using an array. This is the second of a two-part series, showing an... OpenDSA Mergesort
18 Introduce class to implement method that mutates value Code Completion A Java method cannot update primitive type parameters. For example, the following program cannot work as intended: CodeCheck Designing Classes
19 Make Sentence implement Measurable Code Completion Complete the Sentence class below so that it implements the Measurable interface. The measure of a sentence should be the... CodeCheck Interfaces
20 Linked List Implementation - 1 Python CodeConstruction&CompletionBundle for demonstrating Linked List Implementation - 1 PCEX
21 Linked List Implementation In this example, we will define a linked list and create functions to add a new element to the end... PCEX
22 Linked List Implementation - 2 Python CodeConstruction&CompletionBundle for demonstrating Linked List Implementation - 2 PCEX
23 Linked List Implementation In this example, we will define a linked list and create functions to add a new element to the end... PCEX
24 Radix Sort Visualization: Array Implementation Algorithm Visualization, User Supplied Data Algorithm Visualization for Radix Sort, implemented using arrays. User can select data for the visualization. OpenDSA Radix Sort
25 ArrayList - Understanding Implementation Question, forced choice, fill in the blank Multiple Choice Question CodeWorkout arraylist, interface, forced choice, fill in the blank
26 Radix Sort Visualization: Linked List Implementation Algorithm Visualization, User Supplied Data Algorithm Visualization for Radix Sort, implemented using linked lists. User can select data for the visualization. OpenDSA Radix Sort
27 Provide a RectangleDoubler class that implements the Doubler interface Code Completion Some objects can be doubled, for example a bank account. The result would be a bank account with twice the... CodeCheck Interfaces
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 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
30 BankAccount with Bonus for Opening Account Code Completion Implement a BankAccount that pays a bonus of $10 for each new account. CodeCheck Classes
31 ClassSchedule Code Completion Implement a class ClassSchedule with a title (a string), days the class meets (a string), a start meeting time (a... CodeCheck Classes
32 Add an element to the front and back of a linked list Code Completion Implement a method that adds an element to the beginning of a linked list and another at the end. CodeCheck Linear Data Structures
33 Selection sort modification placing even before odd Code Completion Implement a modification of the SelectionSorter class that reorders the array to have even elements followed by odd ones. Follow... CodeCheck Sorting and Searching
34 Generic replicate method Code Completion Implement the generic replicate method. It should return a list containing multiple copies of the given value. CodeCheck Generic Types
35 Stack Challenge Implementing Stack. Using Class to construct a Stack. Implement a function to determine if all the given brackets are paired.\nFor... PCEX
36 c_funkcija_prebroji_znak Implementirati funkciju prebroji koja prima string i karakter, te vraća broj pojavljivanja tog karaktera u stringu. U glavnom programu omogućiti... PCEX
37 Stack Implementing Stack. Using Class to construct a Stack structure. PCEX classes, data structures, stack, stacks
38 Reverse an integer Code Completion We want to implement a method that reverses the digits in an integer. For example, reverseInt(3456) should yield 6543. CodeCheck Recursion
39 Reverse an integer with helper method Code Completion We want to implement a method that reverses the digits in an integer. For example, reverseDigits(3456) should yield 6543. CodeCheck Recursion
40 Number guesser Code Completion Your task is to implement a number guesser that works on the principle of a binary search. In each step,... CodeCheck Sorting and Searching
41 Binary Search - 2 This function implements a recursive version of Binary Search PCEX
42 Binary Search - 2 This function implements a recursive version of Binary Search PCEX
43 c_pokazivaci_min_max Napisati program koji implementira i poziva funkciju min_max. Funkcija prima dva cijela broja i pomoću pokazivača sprema u zadane varijable:... PCEX
44 Practicing quick sort algorithm Construct a function that implements quick sort algorithm. The partition() function has been pre defined and displayed below.
Consider data is...
jsParsons recursion, search algorithms, sorting, sorting algorithms
45 Practicar el algoritmo de ordenación rápida (Quick Sort) Construye una funcion que implemente el algoritmo de ordenamiento rapido. La funcion de particion() ha sido predefinida y se muestra... jsParsons
46 Array-Based Stack Pop Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the pop operation in an array-based stack. OpenDSA Array-Based Stack
47 Array-Based Stack Push Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the push operation in an array-based stack. OpenDSA Array-Based Stack
48 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
49 Linked Queue Dequeue Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting an implementation for linked queue dequeue. OpenDSA Linked Queue
50 Linked Queue Enqueue Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting an implementation for linked queue enqueue. OpenDSA Linked Queue
51 Linked Stack Pop Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the pop operation in a linked stack. OpenDSA Linked Stack
52 Linked Stack Push Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow discussing the implementation for the push operation in a linked stack. OpenDSA Linked Stack
53 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
54 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
55 Array-based List Introduction Slideshow Presentation Slideshow presenting the array-based list implementation. OpenDSA Array-Based List
56 Generic matrix class as a map with integer keys Code Completion Your task is to complete the implementation of a generic Matrix class. A matrix is a two-dimensional arrangement of elements.... CodeCheck Generic Types
57 Generic matrix class as linear array Code Completion Your task is to complete the implementation of a generic Matrix class. A matrix is a two-dimensional arrangement of elements.... CodeCheck Generic Types
58 Generic matrix class as array of arrays Code Completion Your task is to complete the implementation of a generic Matrix class. A matrix is a two-dimensional arrangement of elements.... CodeCheck Generic Types
59 Generic matrix class as a map with integer pair keys Code Completion Your task is to complete the implementation of a generic Matrix class. A matrix is a two-dimensional arrangement of elements.... CodeCheck Generic Types
60 Functional Programming: Quicksort Tracing Exercise A question related to using split and join to implement Quicksort. OpenDSA Functional Programming
61 Array-based List Private Data Members Code Tracing Presentation Slideshow presenting the private data members from an array-based list implementation. OpenDSA Array-Based List
62 Circular Array-Based Queue Design Slideshow: Data Members Code Tracing Presentation Slideshow presenting the data members for a circular array-based queue implementation. OpenDSA Array-Based Queue
63 Array-Based Stack Data Members Slideshow Code Tracing Presentation Slideshow presenting the data members for an array-based stack implementation. OpenDSA Array-Based Stack
64 Linked List Constructors Slideshow Code Tracing Presentation Slideshow presenting the constructors for a linked list implementation. OpenDSA Linked List
65 Linked List Miscillaneous Methods Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow demonstrating some miscillaneous methods for a linked list implementation. OpenDSA Linked List
66 Linked List Data Members Slideshow Code Tracing Presentation Slideshow presenting the data members for a linked list implementation. OpenDSA Linked List
67 Linked Queue Data Members Slideshow Algorithm Visualization, Code Tracing Presentation Slideshow presenting data members and constructors for a linked queue implementation. OpenDSA Linked Queue
68 Programmed Instruction: Induction Proof For Factorial Programmed Instruction Programmed Instruction Frameset examples of induction proof proving a Factorial function implementation correct. OpenDSA Proof by Induction
69 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
70 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
71 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
72 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
73 Palindrome testing with stack and queue Code Completion Using a queue and a stack, implement a method that tests whether a sequence of numbers is a palindrome, that... CodeCheck Linear Data Structures
74 Design IllegalNumberOfWheels Exception Code Completion The following Vehicle class throws a custom exception of type IllegalNumberOfWheels. Your task is to implement this exception class. The... CodeCheck Input and Output
75 Construct a function that checks the size of a linked list Construct a function that calculates the number of elements in a singly linked list.
LinkedList class implementation is given below.
jsParsons linked list
76 Construir una función que verifique el tamaño de una lista enlazada Construye una funcion que calcule el numero de elementos en una lista simplemente enlazada.
La implementacion de la clase ListaEnlazada se...
jsParsons
77 Construct a function that traverse a linked list Construct a function that prints all elements of a Doubly Linked List in forwards and then reverse order.
DoublyLinkedList class implementation...
jsParsons doubly linked list, linked list
78 Construir una función que recorra una lista enlazada Construye una funcion que imprima todos los elementos de una Lista Doblemente Enlazada hacia adelante y luego en orden inverso.
La...
jsParsons
79 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
80 Creating the Movement Interface Code Completion Create the Movement interface below and the abstract methods move and getPosition, which are implemented by the Ship and Auto... CodeCheck Interfaces
81 Relationships between classes and interfaces Code Completion A stamp has a descriptive name, a face value, and an issuing country. Stamps have a measurable value (the face... CodeCheck Object-Oriented Design
82 XML Map Labels Code Completion The latitude, longitude and place name are used to label a map. Implement a class with latitude and longitude as... CodeCheck Classes
83 XML Map Labels convert to decimal degrees Code Completion The latitude, longitude and place name are used to label a map. Implement a class with latitude and longitude as... CodeCheck Classes
84 Timer Code Completion The following timer class measures the total time that has elapsed after timing a number of events. Your job is... CodeCheck Fundamental Data Types
85 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
86 c_strukture_i_nizovi_challenge Napisati program u programskom jeziku C koji radi sa strukturom `Proizvod` koja sadrži naziv proizvoda i njegovu cijenu. U programu... PCEX
87 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
88 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
89 Greatest Common Factor Challenge Construct a program that recursively finds and returns the great common factor between of two integers. This is a simple... PCEX recursion
90 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
91 Using aggregation for modeling Square class Code Completion Intuitively, every square is a rectangle, so it is tempting to use inheritance for implementing a square: CodeCheck Object-Oriented Design
92 Using inheritance for modeling Square class Code Completion Intuitively, every square is a rectangle, so it is tempting to use inheritance for implementing a square: CodeCheck Object-Oriented Design
93 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
94 Change Firstname Lastname to Lastname, Firstname Code Completion Fred fills out his time sheet at work, but he needs to provide the number of minutes worked. He only... CodeCheck Fundamental Data Types
95 Count visits in selection sort Code Completion In section 14.5, we approximated a count of the array visits in merge sort. Your task is to provide an... CodeCheck Sorting and Searching
96 Count visits in selection sort Code Completion In section 14.3, we approximated a count of the array visits in selection sort. Your task is to provide an... CodeCheck Sorting and Searching
97 Finding all matches for a predicate Code Completion Recall that a predicate is a method with a Boolean return value. The Predicate interface can be used to test... CodeCheck Generic Types
98 Finding the first match for a predicate Code Completion Recall that a predicate is a method with a Boolean return value. The Predicate interface can be used to test... CodeCheck Generic Types
99 Make a measurer for words Code Completion In this exercise, we use the Word class from chapter 6 (with the bugs fixed). You should not change the... CodeCheck Interfaces