Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Given a string in which words are separated by spaces, return the longest word. | Code Completion | Given a string in which words are separated by spaces, return the longest word. | CodeCheck | Strings, Words |
| 2 | Given a string in which words are separated by spaces, return the first word that is duplicated (such as an accidental “this this”. | Code Completion | Given a string in which words are separated by spaces, return the first word that is duplicated (such as an... | CodeCheck | Strings, Words |
| 3 | Given a string in which words are separated by spaces, return the first word that is repeated somewhere in the string. | Code Completion | Given a string in which words are separated by spaces, return the first word that is repeated somewhere in the... | CodeCheck | Strings, Words |
| 4 | Given a string in which words are separated by spaces, and two words a and b, interchange all occurrences of a and b. | Code Completion | Given a string in which words are separated by spaces, and two words a and b, interchange all occurrences of... | CodeCheck | Strings, Words |
| 5 | Given a string in which words are separated by spaces, return the longest word. | Code Completion | Given a string in which words are separated by spaces, return the longest word. | CodeCheck | Strings, Words |
| 6 | Given a string in which words are separated by spaces, return the first word that is repeated somewhere in the string. | Code Completion | Given a string in which words are separated by spaces, return the first word that is repeated somewhere in the... | CodeCheck | Strings, Words |
| 7 | Given a string in which words are separated by spaces, and two words a and b, interchange all occurrences of a and b. | Code Completion | Given a string in which words are separated by spaces, and two words a and b, interchange all occurrences of... | CodeCheck | Strings, Words |
| 8 | Given a string in which words are separated by spaces, return the first word that is duplicated (such as an accidental “this this”). | Code Completion | Given a string in which words are separated by spaces, return the first word that is duplicated (such as an... | CodeCheck | Strings, Words |
| 9 | 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 |
| 10 | 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 |
| 11 | Short words | Code Completion | You want to collect all “short” words in an array of words, that is, words with at most three characters.... | CodeCheck | Arrays and Array Lists |
| 12 | Zipper words with helper method | Code Completion | Two strings of equal length can be interlaced like the teeth of a zipper to form a new word. For... | CodeCheck | Recursion |
| 13 | Zipper words | Code Completion | Two strings of equal length can be interlaced like the teeth of a zipper to form a new word. For... | CodeCheck | Recursion |
| 14 | Creating a List of Words from a File | Construct a program that reads a text file and creates a list of the words that the file contains, ignoring... | PCEX | file i/o | |
| 15 | Comparing the List of Words from Two Files | Construct a program that reads two text files and creates a list of the words that each of these files... | PCEX | file i/o | |
| 16 | Creating a List of Words from File(s) | Construct a program that reads a text file and creates a list of the words that the file contains, ignoring... | PCEX | arraylist, file i/o, list | |
| 17 | Comparing the List of Words from Two Files | Construct a program that reads two text files and creates a list of the words that each of these files... | PCEX | arraylist, file i/o | |
| 18 | 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 |
| 19 | Remove short words | Code Completion | Remove all short words (that is, words of length at most 3) from an array. Move down the remaining array... | CodeCheck | Arrays and Array Lists |
| 20 | Duplicate short words | Code Completion | Your task is to duplicate all short words (that is, words with at most 3 characters) in a linked list.... | CodeCheck | Linear Data Structures |
| 21 | Remove short words | Code Completion | Your task is to remove all short words (that is, words with at most 3 characters) from a linked list. | CodeCheck | Linear Data Structures |
| 22 | 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 |
| 23 | Creating a Dictionary of Character-Count/Words Pairs | Construct a program that has a function which receives a string from the user and creates a dictionary that maps... | PCEX | classes, data structures, dictionaries, dictionary, stacks | |
| 24 | Creating a Dictionary of Character-Count/Words Pairs | Construct a program that has a function which receives a string and creates a dictionary that maps each character to... | PCEX | dictionaries, dictionary | |
| 25 | Average word length | Code Completion | Complete the following program to compute the average length of the words. Invoke the appropriate method to compute the length... | CodeCheck | Objects |
| 26 | String join | Construct a program that prints out a sentence from a given list of words. | jsParsons | strings | |
| 27 | Select a short word | Code Completion | You want to pick a particular “short” word in an array of words, that is, words with at most three... | CodeCheck | Arrays and Array Lists |
| 28 | ZipperWordGenerator | Code Completion | You are given two strings of equal length. Your task is to generate all zipper words that can be produced... | CodeCheck | Recursion |
| 29 | Find longest word in file | Code Completion | Your task is to open a file, read all words in the file, and find the longest word in the... | CodeCheck | Input and Output |
| 30 | Reporting File Information (Case 1) | Construct a program that receives the full path to an input file from the user, reads that file and reports... | PCEX | file i/o | |
| 31 | Reporting File Information (Case 2) | Construct a program that receives the full path to an input file from the user, reads that file and reports... | PCEX | file i/o | |
| 32 | Reporting File Information | Construct a program that receives the full path to an input file from the user, reads that file and reports... | PCEX | file i/o | |
| 33 | Reporting File Information | Construct a program that receives the full path to an input file from the user, reads that file and reports... | PCEX | file i/o | |
| 34 | Reporting File Information (Case 2) | Construct a program that receives the full path to an input file from the user, reads that file and reports... | PCEX | classes, exceptions, file i/o, methods, objects | |
| 35 | Reporting File Information | Construct a program that receives the full path to an input file from the user, reads that file and reports... | PCEX | exception handling, file i/o | |
| 36 | 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 |
| 37 | 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 | |
| 38 | Insertion Sort Worst Case Analysis | Code Tracing Presentation, Algorithm Analysis Presentation | Slideshow showing an analysis of Insertion Sort's worst-case behavior and cost. | OpenDSA | Insertion Sort, Worst Case |
| 39 | Bubble Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Bubble Sort's cost in worst, average, and best cases. | OpenDSA | Bubble Sort, Worst Case, Average Case, Best Case |
| 40 | Exchange Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Echange Sorting cost. | OpenDSA | Bubble Sort, Worst Case, Average Case, Best Case |
| 41 | Selection Sort Analysis Slideshow | Algorithm Analysis Presentation | Slideshow showing an analysis of Selection Sort's cost analysis. | OpenDSA | Selection Sort, Worst Case, Average Case, Best Case |
| 42 | word_count | C++ BehaviorExample for demonstrating word_count | AnnEx | ||
| 43 | Quicksort Worst Case Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual proof for the worst-case cost of Quicksort. | OpenDSA | Quicksort |
| 44 | Bubble Sort Worst | Python CodeVisualization for demonstrating Bubble Sort Worst | JSVEE | recursion, search algorithms, sorting, sorting algorithms | |
| 45 | Binary Search Algorithm Worst Case Analysis Recurrence Visualization | Algorithm Analysis Presentation | Slideshow illustrating Binary Search worst case analysis through analysis of its recurrence relation. | OpenDSA | Binary Search, Algorithm Analysis, Recurrence Relation |
| 46 | Best, Worst, and Average cases slideshow | Presentation | Slideshow illustrating analysis when there are different inputs of a given size. | OpenDSA | Problem, Algorithm, Program |
| 47 | Insertion Sort | Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... | PCEX | recursion, search algorithms, sorting, sorting algorithms | |
| 48 | Insertion Sort Challenge | Insertion sort works similarly to how one would sort a hand of cards: by choosing an element and searching through... | PCEX | ||
| 49 | Middle Letter | Code Completion | Complete the getMiddle method that gets the middle character from a word if the word length is odd, or the... | CodeCheck | Branches |
| 50 | 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 |
| 51 | Introduction Chapter for CS1: Review Questions 1 | Question, Battery | Intro to Software Design Week 1 battery of self-assessment questions: Micro-Worlds | OpenDSA | Software Design |
| 52 | Introduction Chapter for CS1: Review Questions 2 | Question, Battery | Intro to Software Design Week 1 battery of self-assessment questions: Turning micro-worlds into code. | OpenDSA | Software Design |
| 53 | Calculating the Wage of an Employee at the Customer Service Call Center | Construct a program for the payment department of a company to calculate the wage of an employee who works at... | PCEX | control flow, if-else statement | |
| 54 | 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 |
| 55 | 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 |
| 56 | 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 |
| 57 | Introduction to the Pumping Lemma | Proof Visualization | Introduction to the Pumping Lemma for regular languages. Includes a visualization for how this works. | OpenDSA | Pumping Lemma, Non-Regular Language |
| 58 | Calculating the Wage of an Employee at the Customer Service Call Center | Construct a program for the payment department of a company to calculate the wage of an employee who works at... | PCEX | control flow, if-else statement | |
| 59 | The Wage of an Employee | Construct a program for the payment department of a company to calculate the wage of an employee who works at... | PCEX | if-else statement | |
| 60 | Calculating the Employees Wage Based on the Hours That the Employee Has Worked and an Hourly Pay Rate | Construct a program for the payment department of a company to calculate the wage of an employee based on the... | PCEX | control flow, if-else statement | |
| 61 | First Fit Memory Manager Visualization | Algorithm Visualization, User Supplied Data | Algorithm Visualization for various sequential memory manager schemes. User can select data for the visualization. Multiple versions are available: First... | OpenDSA | Sequential Fit Memory Manager |
| 62 | Mergesort Analysis Slideshow | Algorithm Visualization | Slideshow showing a visual analysis of Mergesort best, average, and worst case performance. | OpenDSA | Mergesort |
| 63 | The Wage of an Employee | Construct a program for the payment department of a company to calculate the wage of an employee based on the... | PCEX | control flow, if-else statement | |
| 64 | The Wage of an Employee | Construct a program for the payment department of a company to calculate the wage of an employee based on the... | PCEX | control flow, if statement, if-else statement | |
| 65 | Find vowels in string with recursive helper method | Code Completion | Complete the MyMethods class so that the static vowels method returns a string of the vowels of the string parameter.... | CodeCheck | Recursion |
| 66 | Extract uppercase letters from string | Code Completion | Modify the static return upperCase method in the MyMethods class so that it returns a string of the upper case... | CodeCheck | Recursion |
| 67 | Uppercase international letters | Code Completion | Your task is to find out what happens when you call the toUpperCase method on strings that contain accented characters... | CodeCheck | Objects |
| 68 | Generic method for filling an array | Code Completion | The class below has a static method which sets all elements of an array to a value. The method is... | CodeCheck | Generic Types |