Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | 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 | |
| 2 | 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 | |
| 3 | String Concatenation (Case 1) | Construct a program that prints the text "24 and 45 concatenated: 2445" and "24 and 45 added: 69". | PCEX | strings | |
| 4 | Accessing String Characters (Case 1) | Construct a program that prints the 1st, 9th, and the last character of the string "String Example!". | PCEX | strings | |
| 5 | Accessing String Characters (Case 2) | Construct a program that prints the 7th, 11th, and 14th character of the string "Second Example!". | PCEX | strings | |
| 6 | String Comparison (Case 1) | Construct the program that first checks the equality of the strings "HELLO WORLD!" and "hello world!" and then modifies the... | PCEX | strings | |
| 7 | String Comparison (Case 2) | Construct the program that modifies the string "hexxo worxd!" so that it matches (ignoring case) the string "HELLO WORLD!". | PCEX | strings | |
| 8 | String With Escape Characters (Case 1) | Construct a program that prints the following output:\n"Quotes"\nSlashes\n\//\nHow '"confounding' "\" it is! | PCEX | strings | |
| 9 | String With Escape Characters (Case 2) | Construct a program that prints the following output:\n""Two Double Quotes""\n Slashes \//\nHow '"confounding' "\" it is! | PCEX | strings | |
| 10 | String With Escape Characters (Case 3) | Construct a program that prints the following output:\n"Slashes"\\//\n \\//\nHow '"confounding' "\" it is! | PCEX | strings | |
| 11 | Printing Name Initials | Construct a program that prints the initials of the name "John Smith". | PCEX | strings | |
| 12 | Printing Name in APA Style | Construct a program that prints the name "Alice Ann Darcy" following the APA style, i.e., last name first, followed by... | PCEX | strings | |
| 13 | 2-21_StringDemos | Java BehaviorExample for demonstrating 2-21_StringDemos | AnnEx | strings | |
| 14 | Char Strings (Memphis) | Some demos of working with the char and String data types. | AnnEx | strings | |
| 15 | Creating String | Creating String | AnnEx | strings | |
| 16 | String Length | String Length | AnnEx | strings | |
| 17 | String Example | StringExample | AnnEx | strings | |
| 18 | Strings (charAt) | Java BehaviorExample for demonstrating Strings (charAt) | AnnEx | strings | |
| 19 | Strings (equalsIgnoreCase) | Java BehaviorExample for demonstrating Strings (equalsIgnoreCase) | AnnEx | strings | |
| 20 | Strings (parse) | Java BehaviorExample for demonstrating Strings (parse) | AnnEx | strings | |
| 21 | Strings (replace) | Java BehaviorExample for demonstrating Strings (replace) | AnnEx | strings | |
| 22 | Substring | Substring | AnnEx | strings | |
| 23 | Strings | Python CodeVisualization for demonstrating Strings | JSVEE | strings | |
| 24 | Crear una función que verifique si una cadena es un palíndromo o no | Construye una funcion que determine si la cadena dada como parametro es un palindromo. La funcion debe ser insensible a... | jsParsons | strings | |
| 25 | Crear una función que verifique si una cadena es un palíndromo o no | Construye una funcion que determine si la cadena dada como parametro es un palindromo. La funcion debe ser insensible a... | jsParsons | strings | |
| 26 | String Indexing | Construct a program that first prints out strings "Py", "th", "o", and "n" | jsParsons | strings | |
| 27 | Practicar el corte de cadenas (slicing) | Construye un programa que primero imprima las cadenas "Py", "th", "o" y "n" | jsParsons | strings | |
| 28 | String join | Construct a program that prints out a sentence from a given list of words. | jsParsons | strings | |
| 29 | f-string format 1 | Python CodeVisualization for demonstrating f-string format 1 | JSVEE | strings | |
| 30 | f-string format 2 | Python CodeVisualization for demonstrating f-string format 2 | JSVEE | strings | |
| 31 | Palindrome | Python CodeVisualization for demonstrating Palindrome | JSVEE | strings | |
| 32 | q_py_aliasing3_es | Python PredictingFinalResult for demonstrating q_py_aliasing3_es | QuizPET | strings | |
| 33 | q_py_concat_strings1_es | Python PredictingFinalResult for demonstrating q_py_concat_strings1_es | QuizPET | strings | |
| 34 | concatenate strings | Python PredictingFinalResult for demonstrating concatenate strings | QuizPET | strings | |
| 35 | f-string formatting 1 | Python PredictingFinalResult for demonstrating f-string formatting 1 | QuizPET | strings | |
| 36 | f-string formatting 2 | Python PredictingFinalResult for demonstrating f-string formatting 2 | QuizPET | strings | |
| 37 | f-string formatting 3 | Python PredictingFinalResult for demonstrating f-string formatting 3 | QuizPET | strings | |
| 38 | f-string formatting 4 | Python PredictingFinalResult for demonstrating f-string formatting 4 | QuizPET | strings | |
| 39 | q_py_output2_es | Python PredictingFinalResult for demonstrating q_py_output2_es | QuizPET | strings | |
| 40 | String Formatting V1 | Python PredictingFinalResult for demonstrating String Formatting V1 | QuizPET | strings | |
| 41 | String Formatting | Python PredictingFinalResult for demonstrating String Formatting | QuizPET | strings | |
| 42 | String Formatting 1 | Python PredictingFinalResult for demonstrating String Formatting 1 | QuizPET | strings | |
| 43 | String Formatting 2 | Python PredictingFinalResult for demonstrating String Formatting 2 | QuizPET | strings | |
| 44 | q_py_str_ref1_es | Python PredictingFinalResult for demonstrating q_py_str_ref1_es | QuizPET | strings | |
| 45 | q_py_substring1_es | Python PredictingFinalResult for demonstrating q_py_substring1_es | QuizPET | strings | |
| 46 | substring | Python PredictingFinalResult for demonstrating substring | QuizPET | strings | |
| 47 | Strings Basics | Python BehaviorExample for demonstrating Strings Basics | WebEx | strings | |
| 48 | Sub-Strings | Python BehaviorExample for demonstrating Sub-Strings | WebEx | strings | |
| 49 | Adding Strings | Python BehaviorExample for demonstrating Adding Strings | WebEx | strings | |
| 50 | Escape Characters | Python BehaviorExample for demonstrating Escape Characters | WebEx | strings | |
| 51 | Finding character in a string | Python BehaviorExample for demonstrating Finding character in a string | WebEx | strings | |
| 52 | Concatenating Characters of Two Strings | Construct a program that has a function that receives two strings and returns a string formed from the given strings... | PCEX | strings | |
| 53 | Concatenating Strings and Numbers | Construct a program that uses variables x, y, and z to print "Python was invented in 1989.". | PCEX | strings | |
| 54 | Concatenating Characters of Two Strings | Construct a program that has a function that receives two strings and returns a string formed from the given strings... | PCEX | strings | |
| 55 | Concatenating Strings and Numbers (Case 2) | Construct a program that uses variables x, y, and z to print "x * 2 = 4". | PCEX | strings | |
| 56 | Concatenating Strings and Numbers (Case 3) | Construct a program that uses variables x, y, and z to print "10 + 20 = 30". | PCEX | strings | |
| 57 | String Concat | Java PredictingFinalResult for demonstrating String Concat | QuizJET | strings | |
| 58 | Different Ways to Print | Python BehaviorExample for demonstrating Different Ways to Print | WebEx | strings, variables | |
| 59 | Given a string s and an integer n, return a string in which each of the characters in s is repeated n times. | Code Completion | Given a string s and an integer n, return a string in which each of the characters in s is... | CodeCheck | Strings, Other String Operations |
| 60 | Given a string s, return the first vowel that is doubled in the string. | Code Completion | Given a string s, return the first vowel that is doubled in the string. | CodeCheck | Strings, Other String Operations |
| 61 | Given a string s, return the string with adjacent duplicates removed. | Code Completion | Given a string s, return the string with adjacent duplicates removed. For example, Mississippi yields Misisipi. | CodeCheck | Strings, Other String Operations |
| 62 | Given a string s and a string t, return a string in which all the characters of s that occur in t have been replaced by a _ character. | Code Completion | Given a string s and a string t, return a string in which all the characters of s that occur... | CodeCheck | Strings, Other String Operations |
| 63 | Given a string, return a string composed first of all characters at even positions and then of all characters at odd positions. | Code Completion | Given a string, return a string composed first of all characters at even positions and then of all characters at... | CodeCheck | Strings, Other String Operations |
| 64 | Write a method that undoes the effect of the preceding exercise. | Code Completion | Write a method that undoes the effect of the preceding exercise. | CodeCheck | Strings, Other String Operations |
| 65 | Given a string and two characters x and y (as strings of length 1), interchange all occurrences of x and y. | Code Completion | Given a string and two characters x and y (as strings of length 1), interchange all occurrences of x and... | CodeCheck | Strings, Other String Operations |
| 66 | Given a string s and a character c (as string of length 1), return a string with the characters surrounding the first occurrence of c reversed. | Code Completion | Given a string s and a character c (as string of length 1), return a string with the characters surrounding... | CodeCheck | Strings, Other String Operations |
| 67 | Given a string s and a character c (as string of length 1), return a string with the characters surrounding any occurrence of c reversed. | Code Completion | Given a string s and a character c (as string of length 1), return a string with the characters surrounding... | CodeCheck | Strings, Other String Operations |
| 68 | Given two strings s and t, return the first position where their characters differ, or -1 if they are identical. | Code Completion | Given two strings s and t, return the first position where their characters differ, or -1 if they are identical. | CodeCheck | Strings, Comparing Strings |
| 69 | Given two strings s and t, return the first position where their characters are the same, or -1 if there is no such position. | Code Completion | Given two strings s and t, return the first position where their characters are the same, or -1 if there... | CodeCheck | Strings, Comparing Strings |
| 70 | Given a string s, count how many times the ith character from the front equals the ith character from the back. | Code Completion | Given a string s, count how many times the ith character from the front equals the ith character from the... | CodeCheck | Strings, Comparing Strings |
| 71 | Given strings s and t, return a list of all positions in which t occurs in s. | Code Completion | Given strings s and t, return a list of all positions in which t occurs in s. | CodeCheck | Strings, Finding Substrings |
| 72 | Given strings s and t, return a string in which all occurrences of t are removed from s. | Code Completion | Given strings s and t, return a string in which all occurrences of t are removed from s. | CodeCheck | Strings, Finding Substrings |
| 73 | Given strings s and t, return a string in which all characters in t are removed from s. | Code Completion | Given strings s and t, return a string in which all characters in t are removed from s. | CodeCheck | Strings, Finding Substrings |
| 74 | Given a string s, return the longest prefix that is repeated somewhere else in the string. | Code Completion | Given a string s, return the longest prefix that is repeated somewhere else in the string. | CodeCheck | Strings, Finding Substrings |
| 75 | Given a string s, find the longest prefix that also occurs at the end (so that s = p + t + p), and return t, the string without the beginning and the end. | Code Completion | Given a string s, find the longest prefix that also occurs at the end (so that s = p +... | CodeCheck | Strings, Finding Substrings |
| 76 | Given a string, return the string with the first and last characters swapped. | Code Completion | Given a string, return the string with the first and last characters swapped. | CodeCheck | Strings, No Loops |
| 77 | Given a string, return the string with the middle two characters removed if it has even length, and the middle character removed if it has odd length. | Code Completion | Given a string, return the string with the middle two characters removed if it has even length, and the middle... | CodeCheck | Strings, No Loops |
| 78 | Given a string, return the string with the middle two characters swapped if it has even length, and the middle three characters swapped if it has odd length. | Code Completion | Given a string, return the string with the middle two characters swapped if it has even length, and the middle... | CodeCheck | Strings, No Loops |
| 79 | Given a string, return the string with the first and second half swapped. | Code Completion | Given a string, return the string with the first and second half swapped. If the string has odd length, leave... | CodeCheck | Strings, No Loops |
| 80 | Given a string, return the string with the first half and the second half doubled. | Code Completion | Given a string, return the string with the first half and the second half doubled. For example, Java becomes JaJavava... | CodeCheck | Strings, No Loops |
| 81 | Given a string, find the first integer inside and return its value as an integer. | Code Completion | Given a string, find the first integer inside and return its value as an integer. Return 0 if there is... | CodeCheck | Strings, Numbers in Strings |
| 82 | Given a string, find the sum of all integers inside. | Code Completion | Given a string, find the sum of all integers inside. Return 0 if there is no integer inside. | CodeCheck | Strings, Numbers in Strings |
| 83 | Given a string, find all integers inside and return a string that separates them by commas. | Code Completion | Given a string, find all integers inside and return a string that separates them by commas. | CodeCheck | Strings, Numbers in Strings |
| 84 | 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 |
| 85 | 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 |
| 86 | 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 |
| 87 | 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 |
| 88 | Strings With Escape Characters | Construct a program that prints the following output:\n"Quotes"\nSlashes\n\//\nHow '"confounding' "\" it is! | PCEX | string operations, strings | |
| 89 | Strings 1 | Java PredictingFinalResult for demonstrating Strings 1 | QuizJET | string, string operations, strings | |
| 90 | Strings 2 | Java PredictingFinalResult for demonstrating Strings 2 | QuizJET | string operations, strings | |
| 91 | Strings 3 | Java PredictingFinalResult for demonstrating Strings 3 | QuizJET | string operations, strings | |
| 92 | Strings 4 | Java PredictingFinalResult for demonstrating Strings 4 | QuizJET | string operations, strings | |
| 93 | Strings 5 | Java PredictingFinalResult for demonstrating Strings 5 | QuizJET | string operations, strings | |
| 94 | Strings 6 | Java PredictingFinalResult for demonstrating Strings 6 | QuizJET | conditionals, data types, string operations, strings, variables | |
| 95 | Given a string, find the first integer inside and return its value as an integer. | Code Completion | Given a string, find the first integer inside and return its value as an integer. Return 0 if there is... | CodeCheck | Strings, Numbers in Strings |
| 96 | Given a string, find all integers inside and return a string that separates them by commas. | Code Completion | Given a string, find all integers inside and return a string that separates them by commas. | CodeCheck | Strings, Numbers in Strings |
| 97 | Given a string, find the sum of all integers inside. | Code Completion | Given a string, find the sum of all integers inside. Return 0 if there is no integer inside. | CodeCheck | Strings, Numbers in Strings |
| 98 | 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 |
| 99 | 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 |
| 100 | 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 |
| 101 | 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 |
| 102 | Given a string, return the string with the first and last characters swapped. | Code Completion | Given a string, return the string with the first and last characters swapped. | CodeCheck | Strings, No Loops |
| 103 | Given a string, return the string with the middle two characters swapped if it has even length, and the middle three characters swapped if it has odd length. | Code Completion | Given a string, return the string with the middle two characters swapped if it has even length, and the middle... | CodeCheck | Strings, No Loops |
| 104 | Given a string, return the string with the first and second half swapped. | Code Completion | Given a string, return the string with the first and second half swapped. If the string has odd length, leave... | CodeCheck | Strings, No Loops |
| 105 | Given a string, return the string with the first half and the second half doubled. | Code Completion | Given a string, return the string with the first half and the second half doubled. For example, Java becomes JaJavava... | CodeCheck | Strings, No Loops |
| 106 | Given a string, return the string with the middle two characters removed if it has even length, and the middle character removed if it has odd length. | Code Completion | Given a string, return the string with the middle two characters removed if it has even length, and the middle... | CodeCheck | Strings, No Loops |
| 107 | Given a string s and a character c, return a string with the characters surrounding any occurrence of c reversed. | Code Completion | Given a string s and a character c, return a string with the characters surrounding any occurrence of c reversed.... | CodeCheck | Strings, Other String Operations |
| 108 | Given a string s and an integer n, return a string in which each of the characters in s is repeated n times. | Code Completion | Given a string s and an integer n, return a string in which each of the characters in s is... | CodeCheck | Strings, Other String Operations |
| 109 | Given a string s, return the string with adjacent duplicates removed. | Code Completion | Given a string s, return the string with adjacent duplicates removed. For example, Mississippi yields Misisipi. | CodeCheck | Strings, Other String Operations |
| 110 | Given a string s and a string t, return a string in which all the characters of s that occur in t have been replaced by a _ sign. | Code Completion | Given a string s and a string t, return a string in which all the characters of s that occur... | CodeCheck | Strings, Other String Operations |
| 111 | Given a string, return a string composed first of all characters at even positions and then of all characters at odd positions. | Code Completion | Given a string, return a string composed first of all characters at even positions and then of all characters at... | CodeCheck | Strings, Other String Operations |
| 112 | Write a method that undoes the effect of the preceding exercise. | Code Completion | Write a method that undoes the effect of the preceding exercise. | CodeCheck | Strings, Other String Operations |
| 113 | Given a string s, return the first vowel that is doubled in the string. | Code Completion | Given a string s, return the first vowel that is doubled in the string. | CodeCheck | Strings, Other String Operations |
| 114 | Given a string s and a character c, return a string with the characters surrounding the first of c reversed. | Code Completion | Given a string s and a character c, return a string with the characters surrounding the first of c reversed.... | CodeCheck | Strings, Other String Operations |
| 115 | Given a string and two characters x and y, interchange all occurrences of x and y. | Code Completion | Given a string and two characters x and y, interchange all occurrences of x and y. | CodeCheck | Strings, Other String Operations |
| 116 | Given strings s and t, return a list of all positions in which t occurs in s. | Code Completion | Given strings s and t, return a list of all positions in which t occurs in s. | CodeCheck | Strings, Finding Substrings |
| 117 | Given strings s and t, return a string in which all characters in t are removed from s. | Code Completion | Given strings s and t, return a string in which all characters in t are removed from s. | CodeCheck | Strings, Finding Substrings |
| 118 | Given a string s, return the longest prefix that is repeated somewhere else in the string. | Code Completion | Given a string s, return the longest prefix that is repeated somewhere else in the string. | CodeCheck | Strings, Finding Substrings |
| 119 | Given a string s, find the longest prefix that also occurs at the end (so that s = p + t + p), and return t, the string without the beginning and the end. | Code Completion | Given a string s, find the longest prefix that also occurs at the end (so that s = p +... | CodeCheck | Strings, Finding Substrings |
| 120 | Given strings s and t, return a string in which all occurrences of t are removed from s. | Code Completion | Given strings s and t, return a string in which all occurrences of t are removed from s. | CodeCheck | Strings, Finding Substrings |
| 121 | Given two strings s and t, return the first position where their characters differ, or -1 if they are identical. | Code Completion | Given two strings s and t, return the first position where their characters differ, or -1 if they are identical. | CodeCheck | Strings, Comparing Strings |
| 122 | Given a string s, count how many times the ith character from the front equals the ith character from the back. | Code Completion | Given a string s, count how many times the ith character from the front equals the ith character from the... | CodeCheck | Strings, Comparing Strings |
| 123 | Given two strings s and t, return the first position where their characters are the same, or -1 if there is no such position. | Code Completion | Given two strings s and t, return the first position where their characters are the same, or -1 if there... | CodeCheck | Strings, Comparing Strings |
| 124 | Comparing Strings | Java PredictingFinalResult for demonstrating Comparing Strings | QuizJET | boolean expressions, conditionals, data types, string operations, strings, variables | |
| 125 | String Equals | Java BehaviorExample for demonstrating String Equals | AnnEx | boolean expressions, strings, variables | |
| 126 | Concat Demo | Java CodeVisualization for demonstrating Concat Demo | JSVEE | string operations, strings | |
| 127 | String Example | Java CodeVisualization for demonstrating String Example | JSVEE | string operations, strings | |
| 128 | ToString Demo | Java CodeVisualization for demonstrating ToString Demo | JSVEE | string operations, strings | |
| 129 | Format 1 | Python CodeVisualization for demonstrating Format 1 | JSVEE | string formatting, strings | |
| 130 | Format 2 | Python CodeVisualization for demonstrating Format 2 | JSVEE | string formatting, strings | |
| 131 | Practicar métodos de cadenas | Construye un programa que imprima una oracion a partir de una lista dada de palabras. | jsParsons | list, strings | |
| 132 | q_py_output1_es | Python PredictingFinalResult for demonstrating q_py_output1_es | QuizPET | operators, strings, variables | |
| 133 | simple format | Python PredictingFinalResult for demonstrating simple format | QuizPET | string formatting, strings | |
| 134 | format with one argument | Python PredictingFinalResult for demonstrating format with one argument | QuizPET | string formatting, strings | |
| 135 | q_py_output3_es | Python PredictingFinalResult for demonstrating q_py_output3_es | QuizPET | operators, strings, variables | |
| 136 | format with two arguments | Python PredictingFinalResult for demonstrating format with two arguments | QuizPET | string formatting, strings | |
| 137 | format with three arguments | Python PredictingFinalResult for demonstrating format with three arguments | QuizPET | string formatting, strings | |
| 138 | Output Formatting | Python BehaviorExample for demonstrating Output Formatting | WebEx | string formatting, strings | |
| 139 | Output Formatting 2 | Python BehaviorExample for demonstrating Output Formatting 2 | WebEx | string formatting, strings | |
| 140 | String Index Search | Python BehaviorExample for demonstrating String Index Search | WebEx | search algorithms, strings | |
| 141 | String Addition | Construct a program that prints the text "24 and 45 concatenated: 2445" and "24 and 45 added: 69". | PCEX | string operations, strings | |
| 142 | Accessing String Characters | Construct a program that prints the 1st, 9th, and the last character of the string "String Example!". | PCEX | string operations, strings | |
| 143 | String Comparison | Construct the program that first checks the equality of the strings "HELLO WORLD!" and "hello world!" and then modifies the... | PCEX | string operations, strings | |
| 144 | Name Initials | Construct a program that prints the initials of the name "John Smith". | PCEX | string operations, strings | |
| 145 | Repeating Characters of a String | Construct a program that has a function that receives a string and creates a new string that has each character... | PCEX | functions, strings | |
| 146 | Accessing String Characters (Case 2) | Construct a program that prints the 7th, 11th, and 14th character of the string "Second Example!". | PCEX | string operations, strings | |
| 147 | String Comparison (Case 2) | Construct the program that modifies the string "hexxo worxd!" so that it matches (ignoring case) the string "HELLO WORLD!". | PCEX | string operations, strings | |
| 148 | String With Escape Characters (Case 2) | Construct a program that prints the following output:\n""Two Double Quotes""\n Slashes \//\nHow '"confounding' "\" it is! | PCEX | string operations, strings | |
| 149 | String With Escape Characters (Case 3) | Construct a program that prints the following output:\n"Slashes"\\//\n \\//\nHow '"confounding' "\" it is! | PCEX | string operations, strings | |
| 150 | Printing Name in APA Style | Construct a program that prints the name "Alice Ann Darcy" following the APA style, i.e., last name first, followed by... | PCEX | string operations, strings | |
| 151 | Counting the Occurrences of One String in Another | Construct a program that has a function that receives a string and returns the number of times that the string... | PCEX | functions, strings | |
| 152 | Repeating Characters of a String | Construct a program that has a function that receives a string and creates a new string that has every other... | PCEX | functions, strings | |
| 153 | Converting String to double | Java PredictingFinalResult for demonstrating Converting String to double | QuizJET | primitive data types, strings | |
| 154 | Converting String to int | Java PredictingFinalResult for demonstrating Converting String to int | QuizJET | primitive data types, strings | |
| 155 | String (equals) | Java PredictingFinalResult for demonstrating String (equals) | QuizJET | string operations, strings | |
| 156 | String (replace) | Java PredictingFinalResult for demonstrating String (replace) | QuizJET | string operations, strings | |
| 157 | Counting the Occurrences of One String in Another | Construct a program that has a function that receives a string and returns the number of times that the string... | PCEX | for loop, functions, strings | |
| 158 | Creating a function that checks if the string is a palindrome or not. | Construct a function which determines whether the string given as a paramter is a palindrome. The function should be case... | jsParsons | recursion, search algorithms, sorting algorithms, strings | |
| 159 | String Concatenation (Case 2) | Construct a program that prints the text "333", "63", and "36". | PCEX | conditionals, data types, string operations, strings, variables | |
| 160 | Printing Full Name with Middle Initial | Construct a program that prints the full name with middle initial for the name "John Phillip Smith". | PCEX | conditionals, data types, string, string operations, strings, variables | |
| 161 | if-else 1 | Java PredictingFinalResult for demonstrating if-else 1 | QuizJET | boolean expressions, conditionals, if-else statement, strings | |
| 162 | Objects 4 (String) | Java PredictingFinalResult for demonstrating Objects 4 (String) | QuizJET | classes, object, objects, strings | |
| 163 | String Variables | Java PredictingFinalResult for demonstrating String Variables | QuizJET | data types, primitive data types, string operations, strings, variables | |
| 164 | (Strings) Change case - CSEdPad | Given a string, this program converts the string into uppercase and lowercase. present on those variable to either uppercase or... | AnnEx | string | |
| 165 | (Strings) String length - CSEdPad | Given a string, this program finds out the length of a string. | AnnEx | string | |
| 166 | Strings (Concatenation) | Java BehaviorExample for demonstrating Strings (Concatenation) | AnnEx | ||
| 167 | Strings Review Quiz | Question, Battery | Strings introduction for CS1 review questions. | OpenDSA | String |
| 168 | Comparing Strings | Java PredictingFinalResult for demonstrating Comparing Strings | QuizJET | boolean expressions, control flow, string operations | |
| 169 | Variable type: Strings | Python BehaviorExample for demonstrating Variable type: Strings | WebEx | operators, variables | |
| 170 | Given three input strings, print all but the shortest one. | Code Completion | Given three input strings, print all but the shortest one. | CodeCheck | Branches, Branches Without Functions |
| 171 | Given a list of strings and a string s, return the average length of all strings containing s. | Code Completion | Given a list of strings and a string s, return the average length of all strings containing s. | CodeCheck | Lists - Simple Exercises, Sums, Averages, Products |
| 172 | Grammar Construction Exercise: Three Strings | Grammar Construction Exercise | Exercise where user must write the grammar for a given language. This language has three strings. | OpenDSA | Language, Grammar |
| 173 | Regular Expression Exercise: Strings Containing aba | RegEx Writing Exercise | User writes an regular expression for the language of strings containing aba. | OpenDSA | Regular Expression |
| 174 | Regular Expression Exercise: Strings of Multiples of 3 a's | RegEx Writing Exercise | User writes an regular expression for the language of strings that contain a multiple of 3 a's. | OpenDSA | Regular Expression |
| 175 | Regular Expression Exercise: Strings of a's Preceded or Followed by b | RegEx Writing Exercise | User writes an regular expression for the language of strings where every a is either proceeded or followed by b. | OpenDSA | Regular Expression |
| 176 | Regular Expression Exercise: Strings Containing bba in an Even Position | RegEx Writing Exercise | User writes an regular expression for the langugae of strings containing bba in an even position. | OpenDSA | Regular Expression |
| 177 | Regular Expression Exercise: Strings of 2 b's and c's | RegEx Writing Exercise | User writes an regular expression for the language of strings where the number of b's and c's sums to 2. | OpenDSA | Regular Expression |
| 178 | Regular Expression Exercise: Strings of Even Binary Numbers | RegEx Writing Exercise | User writes an regular expression for the language of strings that are even binary numbers. | OpenDSA | Regular Expression |
| 179 | Regular Expression Exercise: Strings Containing No aa | RegEx Writing Exercise | User writes an regular expression for the langugae of strings containing no occurance of aa. | OpenDSA | Regular Expression |
| 180 | Regular Expression Exercise: Strings Containing One bbb | RegEx Writing Exercise | User writes an regular expression for the langugae of strings containing exactly one instance of bbb. | OpenDSA | Regular Expression |
| 181 | Given an array of strings and a string s, return the average length of all strings containing s. | Code Completion | Given an array of strings and a string s, return the average length of all strings containing s. | CodeCheck | Arrays - Simple Exercises, Sums, Averages, Products |
| 182 | Given three input strings, print all but the shortest one. | Code Completion | Given three input strings, print all but the shortest one. | CodeCheck | Branches, Branches Without Functions |
| 183 | Creating an Array of Numbers/Strings | Construct a program that creates an array of first ten positive odd numbers. | PCEX | arrays | |
| 184 | Simple Printing | Printing strings and numbers | AnnEx | variables | |
| 185 | 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 |
| 186 | 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 |
| 187 | Insertion Sort | reads in Strings and uses insertion sort to print them out in sorted order | PCEX | ||
| 188 | Characterizing Languages Exercise 2: Alternate | Question | Users characterize the strings in the language for a given grammar on palindromes. | OpenDSA | Language, Grammar |
| 189 | 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 |
| 190 | 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 |
| 191 | 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 |
| 192 | CFG Exercise: a^mb^ia^n, i=m+n | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ia^n, i=m+n. | OpenDSA | Context-Free Grammar |
| 193 | CFG Exercise: a^mb^ic^n, i less than 3 | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^mb^ic^n, i < 3. | OpenDSA | Context-Free Grammar |
| 194 | CFG Exercise: Odd length | Grammar Construction Exercise | User creates a CFG that generates strings in the language a^nb^m where m - n is positive, odd. | OpenDSA | Context-Free Grammar |
| 195 | CFG Exercise: a's and b's are equal | Grammar Construction Exercise | User creates a CFG that generates strings in the language where the number of a's and b's is equal. | OpenDSA | Context-Free Grammar |
| 196 | DFA Exercise: Length a Multiple of 3 with No aab | Automata Construction Exercise | User creates a DFA that recognizes strings with length a multiple of 3 and containing no instance of aab. | OpenDSA | Context-Free Grammar |
| 197 | Turing Machine Exercise: Accept Powers of 2 | Automata Construction Exercise | User creates a Turing machine that accepts strings of a's with the number of characters being a power of 2. | OpenDSA | Turing Machine |
| 198 | Characterizing Languages Exercise 1: Alternate | Question | Exercise on how to characterize the strings in the language for a given grammar on a's and b's. Alternate version. | OpenDSA | Language, Grammar |
| 199 | Characterizing Languages Exercise 1 | Question | Exercise on how to characterize the strings in the language for a given grammar on a's and b's. | OpenDSA | Language, Grammar |
| 200 | Characterizing Languages Exercise 2 | Question | Exercise on how to characterize the strings in the language for a given grammar on palindromes. | OpenDSA | Language, Grammar |
| 201 | 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 |
| 202 | Context-Free Language Derivations Frameset | Programmed Instruction | Programmed Instruction Frameset discussing derivations of strings from Context-Free Grammars. | OpenDSA | Context-Free Language |
| 203 | Updating an Element in the Array (Case 3) | Construct a program that initializes an array with four strings, changes the last element in the array, and finally, prints... | PCEX | arrays | |
| 204 | DFA Exercise: Both Even or Odd | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with both even a's and b's, or both odd a's... | OpenDSA | Deterministic Finite Automata |
| 205 | DFA Exercise: b Surrounds a | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings where every a is surrounded by b's. | OpenDSA | Deterministic Finite Automata |
| 206 | DFA Exercise: Compliment of No 3 a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of a's and b's that have 3 consecutive a's. | OpenDSA | Deterministic Finite Automata |
| 207 | DFA Exercise: Divisible by 4 | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of binary numbers divisible by 4. | OpenDSA | Deterministic Finite Automata |
| 208 | DFA Exercise: Even a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's. | OpenDSA | Deterministic Finite Automata |
| 209 | DFA Exercise: Even a's, b's, odd a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's, followed by at least... | OpenDSA | Deterministic Finite Automata |
| 210 | DFA Exercise: Even a, 3 b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's and at least 3... | OpenDSA | Deterministic Finite Automata |
| 211 | DFA Exercise: Even a's Odd b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an even number of a's and an odd number... | OpenDSA | Deterministic Finite Automata |
| 212 | DFA Exercise: No 3 a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings of a's and b's without 3 consecutive a's. | OpenDSA | Deterministic Finite Automata |
| 213 | DFA Exercise: No ba | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with a's and b's that does not end in ba. | OpenDSA | Deterministic Finite Automata |
| 214 | DFA Exercise: Odd a's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an odd number of a's. | OpenDSA | Deterministic Finite Automata |
| 215 | DFA Exercise: Odd a's, 3 b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an odd number of a's and at most 3... | OpenDSA | Deterministic Finite Automata |
| 216 | DFA Exercise: Odd a's, Even b's | Automata Construction Exercise | User creates a DFA that accepts the langugage of strings with an odd number of a's and an even number... | OpenDSA | Deterministic Finite Automata |
| 217 | PDA Exercise: Twice as many a's as b's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage of strings that have twice as many a's as b's. | OpenDSA | Pushdown Automata |
| 218 | Regular Grammar Exercise: aaab*ba | Grammar Construction Exercise | User writes an regular grammar for the language of strings matching the regular expression (aaab*ba)*. | OpenDSA | Regular Expression, Regular Grammar |
| 219 | Regular Grammar Exercise: a's a Multiple of 3 | Grammar Construction Exercise | User writes an regular grammar for the language of strings with the number of a's being divisible by 3. | OpenDSA | Regular Grammar |
| 220 | Regular Grammar Exercise: Number of a's and b's is Odd | Grammar Construction Exercise | User writes an regular grammar for the language of strings with an odd length. | OpenDSA | Regular Expression, Regular Grammar |
| 221 | Regular Grammar Exercise: bb*aaa* | Grammar Construction Exercise | User writes an regular grammar for the language of strings that meet this regular expression: bb*aaa* | OpenDSA | Regular Expression, Regular Grammar |
| 222 | Turing Machine Exercise: Decide Powers of 2 | Automata Construction Exercise | User creates a Turing machine that decides if strings of a's have a length that is a power of 2. | OpenDSA | Turing Machine |
| 223 | 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 |
| 224 | Jison Grammar Exercise 2 | Calculation Exercise | A question where users calculate the number of strings parsed successfully by a given grammar. | OpenDSA | Parser Generator |
| 225 | DFA Example Trace: Even Binary Numbers | Algorithm Visualization, Code Tracing Presentation | Visualization of how a DFA would process input strings for the language of even binary numbers. | OpenDSA | Deterministic Finite Automata |
| 226 | Updating an Element in the Array (Case 3) | Construct a program that initializes an array with four strings, changes the last element in the array, and finally, prints... | PCEX | arrays | |
| 227 | 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 |
| 228 | Reversing a string with StringBuilder | Code Completion | StringBuilder is another class that provides methods to manipulate strings. Look in the StringBuilder class API for information on the... | CodeCheck | Objects |
| 229 | A slow sorting algorithm with two threads | Code Completion | Consider the following algorithm to sort an array of strings and remove duplicates, using two threads. | CodeCheck | Concurrency |
| 230 | Picture of Colored Boxes | Code Completion | Your task is to write a method that produces images from strings describing color values. | CodeCheck | Loops |
| 231 | DFA Exercise: Complement Even a, 3 b's | Automata Construction Exercise | User creates a DFA that accepts the complement of the langugage of strings with an even number of a's and... | OpenDSA | Deterministic Finite Automata |
| 232 | DFA Exercise: Complement No ba | Automata Construction Exercise | User creates a DFA that accepts the complement of the langugage of strings with a's and b's that does not... | OpenDSA | Deterministic Finite Automata |
| 233 | Turing Machine Exercise: Palindromes | Automata Construction Exercise | User creates a Turing machine that recognizes the language of palindromes on strings of a's and b's. | OpenDSA | Turing Machine |
| 234 | Annotating Jison Exercise | Tracing Exercise | A question where users determine the results of parsing a given collection of strings. | OpenDSA | Parser Generator |
| 235 | Jison Grammar Exercise 1 | Calculation Exercise | A collection of self-practice questions where users calculate the number of strings parsed successfully by a given grammar. | OpenDSA | Parser Generator |
| 236 | 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 |
| 237 | Concatenate elements backwards | Code Completion | Your task is to concatenate all elements in a linked list of strings backwards, starting at the end of the... | CodeCheck | Linear Data Structures |
| 238 | 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 |
| 239 | 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 |
| 240 | 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 |
| 241 | 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 |
| 242 | 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 |
| 243 | Contando las Ocurrencias de un String en Otro (Caso 2). | Construye un programa que tenga una función que reciba un string y devuelva el número de veces que el string... | PCEX | for loop, loops | |
| 244 | 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 |
| 245 | String Concatenation (Case 2) | Construct a program that prints the text "333", "63", and "36". | PCEX | ||
| 246 | string_compare | C++ BehaviorExample for demonstrating string_compare | AnnEx | ||
| 247 | string_lib_func1 | C++ BehaviorExample for demonstrating string_lib_func1 | AnnEx | ||
| 248 | string_to_integer | C++ BehaviorExample for demonstrating string_to_integer | AnnEx | ||
| 249 | String Comparison | String Comparison | AnnEx | if-else statement | |
| 250 | String Operation | String Operation | AnnEx | pattern matching | |
| 251 | String Operation pt | This is the portuguese version. | AnnEx | pattern matching | |
| 252 | string reference | Python PredictingFinalResult for demonstrating string reference | QuizPET | aliasing, value vs reference | |
| 253 | String Folding Method activity | Calculation, User Supplied Data | Calculator for computing value of hashing a string by 'folding'. A better method than character value summing. | OpenDSA | Hash Function |
| 254 | Slanje stringova u funkcije | C CodeConstruction&CompletionBundle for demonstrating Slanje stringova u funkcije | PCEX | ||
| 255 | find_string | C++ BehaviorExample for demonstrating find_string | AnnEx | ||
| 256 | DEPRECATED_String Comparison | Java BehaviorExample for demonstrating DEPRECATED_String Comparison | AnnEx | ||
| 257 | DEPRECATED_String Length | Java BehaviorExample for demonstrating DEPRECATED_String Length | AnnEx | ||
| 258 | DEPRECATED_StringExample | Java BehaviorExample for demonstrating DEPRECATED_StringExample | AnnEx | ||
| 259 | Simple String Hash Calculator | Calculation, User Supplied Data | Calculator for computing value of hashing a string by simple summation of its characters' ASCII values. | OpenDSA | Hash Function |
| 260 | Recursive string reversal with helper method | Code Completion | Complete the static reverseHelper method so that the reverse method returns a String that is the reverse of the parameter... | CodeCheck | Recursion |
| 261 | Brisanje dijelova stringa | C CodeConstruction&CompletionBundle for demonstrating Brisanje dijelova stringa | PCEX | ||
| 262 | Detektovanje granica unutar stringa | C CodeConstruction&CompletionBundle for demonstrating Detektovanje granica unutar stringa | PCEX | ||
| 263 | Mijenjanje karaktera u stringu | C CodeConstruction&CompletionBundle for demonstrating Mijenjanje karaktera u stringu | PCEX | ||
| 264 | c_trazenje_karaktera_u_stringu | Napisati program koji provjerava da li se u datom stringu nalazi određeni karakter. | PCEX | ||
| 265 | c_trazenje_karaktera_u_stringu_pokazivaci | Napisati program koji pomoću pokazivačke aritmetike provjerava da li se u datom stringu nalazi određeni karakter. | PCEX | ||
| 266 | c_funkcija_uporedi_stringove | Napisati funkciju koja daje poredak dva stringa po leksikografskom redoslijedu, te vraća -1 ako je prvi string manji od drugog,... | PCEX | ||
| 267 | Ubacivanje karaktera u string | C CodeConstruction&CompletionBundle for demonstrating Ubacivanje karaktera u string | PCEX | ||
| 268 | c_spajanje_dva_stringa | Napisati program koji dodaje sadržaj drugog stringa prvom stringu. | PCEX | ||
| 269 | c_upis_stringa_u_datoteku | Napisati program koji upisuje u datoteku sadržaj datog niza karaktera (varijable niz). Pisanje je potrebno uraditi karakter po karakter. | PCEX | ||
| 270 | DEPRECATED_Creating String | Java BehaviorExample for demonstrating DEPRECATED_Creating String | AnnEx | ||
| 271 | list reference (string) | Python PredictingFinalResult for demonstrating list reference (string) | QuizPET | aliasing, value vs reference | |
| 272 | q_py_q_py_string_formatting1_es | Python PredictingFinalResult for demonstrating q_py_q_py_string_formatting1_es | QuizPET | ||
| 273 | q_py_q_py_string_formatting2_es | Python PredictingFinalResult for demonstrating q_py_q_py_string_formatting2_es | QuizPET | ||
| 274 | Given an input string, print the string with the first and last letter removed if they were equal, or the original string if they were not. | Code Completion | Given an input string, print the string with the first and last letter removed if they were equal, or the... | CodeCheck | Branches, Branches Without Functions |
| 275 | PDA Exercise: String and Reverse | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage WcW^R. | OpenDSA | Pushdown Automata |
| 276 | Objects 5 (String) | Java PredictingFinalResult for demonstrating Objects 5 (String) | QuizJET | classes, objects | |
| 277 | 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 |
| 278 | 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 |
| 279 | Read XML from string or file. | Code Completion | You are given a string that is either valid XML (when it starts with a '<' character) or the name... | CodeCheck | XML |
| 280 | Given an input string, print the string with the first and last letter removed if they were equal, or the original string if they were not. | Code Completion | Given an input string, print the string with the first and last letter removed if they were equal, or the... | CodeCheck | Branches, Branches Without Functions |
| 281 | c_formatirane_datoteke_citanje_broja_i_stringa | Neka svaki red u datoteci datoteka.txt sadrži jedan broj i jedan string, razdvojeni razmakom. Napisati program koji će ispisati na... | PCEX | ||
| 282 | c_formatirane_datoteke_citanje_brojeva_i_stringa | Data je datoteka knjige.txt koja u svakom redu sadrži sljedeće podatke razdvojene zarezom: cijena (realan broj), broj primjeraka (cijeli broj)... | PCEX | ||
| 283 | Contando las Ocurrencias de un String en Otro (Caso 1) | Construye un programa que tenga una función que reciba un string y devuelva el número de veces que el string... | PCEX | for loop, loops | |
| 284 | c_formatirane_datoteke_upis_broja_i_stringa | U programu su data imena studenata. Potrebno je kreirati novu datoteku studenti.txt i u nju upisati za svakog studenta njegov... | PCEX | ||
| 285 | Creating a function that checks if the string is a palindrome or not. | Construct a program which determines whether the original string is a palindrome. The function should be case insensitive i.e. upper... | jsParsons | search algorithms | |
| 286 | Creating a function that checks if the string is a palindrome or not. | Construct a function which determines whether the string given as a paramter is a palindrome. The function should be case... | jsParsons | recursion, search algorithms | |
| 287 | Construct a function which determines whether the string given as a paramter is a palindrome. | Construct a function that checks if the string is a palindrome or not. The function should be case insensitive i.e.... | jsParsons | recursion | |
| 288 | Turing Machine Exercise: Reverse a String | Automata Construction Exercise | User creates a Turing machine that, given string W, outputs WW^R. | OpenDSA | Turing Machine |
| 289 | Turing Machine to Copy a String | Algorithm Visualization, Code Tracing Presentation | Slideshow presenting the execution of a Turing machine that copies a string. | OpenDSA | Turing Machine |
| 290 | Given a two-dimensional array of integers and a string N, E, S, W, give the middle element along the border in the given compass direction, or the average of the two middle ones if the border length is even. | Code Completion | Given a two-dimensional array of integers and a string N, E, S, W, give the middle element along the border... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 291 | Given a two-dimensional array of integers and a string NW, NW, SW, SE, return the sum of the four elements in the given compass direction. | Code Completion | Given a two-dimensional array of integers and a string NW, NW, SW, SE, return the sum of the four elements... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 292 | Given a two-dimensional array of integers and a string N, E, S, W, return the sum of all elements of the border in the given compass direction. | Code Completion | Given a two-dimensional array of integers and a string N, E, S, W, return the sum of all elements of... | CodeCheck | Two-Dimensional Arrays, Loops Along a Row or Column |
| 293 | Given a two-dimensional array of integers and a string N, E, S, W, return the sum of all elements of the border in the given compass direction. | Code Completion | Given a two-dimensional array of integers and a string N, E, S, W, return the sum of all elements of... | CodeCheck | Two-Dimensional Arrays, Loops Along a Row or Column |
| 294 | Given a two-dimensional array of integers and a string N, E, S, W, give the middle element along the border in the given compass direction, or the average of the two middle ones if the border length is even. | Code Completion | Given a two-dimensional array of integers and a string N, E, S, W, give the middle element along the border... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 295 | Given a two-dimensional array of integers and a string NW, NW, SW, SE, return the sum of the four elements in the given compass direction. | Code Completion | Given a two-dimensional array of integers and a string NW, NW, SW, SE, return the sum of the four elements... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 296 | Static method for counting the number of times a character appears in a string | Code Completion | Supply a static method that counts the number of times that a specific character appears in a given string. For... | CodeCheck | Designing Classes |
| 297 | Given a two-dimensional array of integers, row/column indexes r, c, and a string N E S W, return the neighbor in that direction, or 0 if it doesn't exist. | Code Completion | Given a two-dimensional array of integers, row/column indexes r, c, and a string N E S W, return the neighbor... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 298 | Given a two-dimensional array of integers and row/column positions r, c, return the compass direction of the largest neighbor as a string N E S W NE NW SE SW. | Code Completion | Given a two-dimensional array of integers and row/column positions r, c, return the compass direction of the largest neighbor as... | CodeCheck | Two-Dimensional Arrays, Looping over Neighbors |
| 299 | Given a two-dimensional array of integers, an index, and a string R or C, return the sum of the elements in that row or column. | Code Completion | Given a two-dimensional array of integers, an index, and a string R or C, return the sum of the elements... | CodeCheck | Two-Dimensional Arrays, Loops Along a Row or Column |
| 300 | Given a two-dimensional array of integers and row/column positions r, c, return the compass direction of the largest neighbor as a string N E S W NE NW SE SW. | Code Completion | Given a two-dimensional array of integers and row/column positions r, c, return the compass direction of the largest neighbor as... | CodeCheck | Two-Dimensional Arrays, Looping over Neighbors |
| 301 | Given a two-dimensional array of integers, an index, and a string R or C, return the sum of the elements in that row or column. | Code Completion | Given a two-dimensional array of integers, an index, and a string R or C, return the sum of the elements... | CodeCheck | Two-Dimensional Arrays, Loops Along a Row or Column |
| 302 | Given a two-dimensional array of integers, row/column indexes r, c, and a string N E S W, return the neighbor in that direction, or 0 if it doesn't exist. | Code Completion | Given a two-dimensional array of integers, row/column indexes r, c, and a string N E S W, return the neighbor... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 303 | (Recursion) Recursive is palindrome - CSEdPad | This program checks a string is palindrome or not (first half of the string is the same as the second... | AnnEx | recursion | |
| 304 | c_izbacivanje_svakog_ntog_karaktera | Napisati program u kojem se iz datog stringa izbacuje svaki n-ti karakter. Brojanje karaktera počinje od 1 (prvi karakter se... | PCEX | ||
| 305 | 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 | ||
| 306 | c_brisanje_samoglasnika | Napisati program koji iz datog stringa briše sve samoglasnike. | PCEX | ||
| 307 | Determining Whether One is a Teenager (Case 1) | Construct a program that receives a string that has the user name and age separated by a colon, and prints... | PCEX | exception handling, exceptions | |
| 308 | 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 | ||
| 309 | 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 | |
| 310 | 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 | ||
| 311 | 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 | ||
| 312 | c_ubacivanje_rijeci | Napisati program koji u datom stringu zamjenjuje svaku cifru 1 sa tekstom "jedan". Pretpostaviti da je primljeni string dovoljno velik... | PCEX | ||
| 313 | c_funkcija_podstring | Napisati funkciju podstring koja prima dva stringa s1 i s2, te provjerava da li je s2 podstring stringa s1. Ako... | PCEX | ||
| 314 | 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 | ||
| 315 | Huffman Coding Tree Slideshow: Decoding | Algorithm Visualization | Slideshow visualizing the process of decoding a string of Huffman Codes. | OpenDSA | Huffman Coding Tree |
| 316 | Determining Whether One is a Teenager | Construct a program that receives a string that has the user name and age separated by a colon, and prints... | PCEX | exception handling, exceptions | |
| 317 | Determining Whether One is a Teenager | Construct a program that receives a string that has the user name and age separated by a colon, and prints... | PCEX | exception handling, exceptions, if-else statement | |
| 318 | Creating an Array of User Inputs | Construct a program that creates an array of eight string values received from the user. | PCEX | arrays | |
| 319 | c_brojanje_rijeci_alfanumericki | Napisati program u kojem se omogućava unos nekog stringa, a zatim se ispisuje broj riječi koje se u njemu nalaze.... | PCEX | ||
| 320 | c_brojanje_rijeci_razmaci | Napisati program u kojem se omogućava unos nekog stringa s najviše 1000 karaktera, a zatim se ispisuje broj riječi koje... | PCEX | ||
| 321 | c_brojanje_rijeci_s_velikim_pocetnim_slovom | Napisati program u kojem se omogućava unos nekog stringa, a zatim se ispisuje broj njegovih riječi koje počinju velikim slovom.... | PCEX | ||
| 322 | Determining Whether One is a Teenager (Case 2) | Construct a program that asks the user to enter a string that has the user name and age separated by... | PCEX | exceptions | |
| 323 | Creando un Diccionario de Pares Caracteres-Frecuencia | Construye un programa que tenga una función que reciba un string del usuario y cree un diccionario que mapea cada... | PCEX | dictionaries | |
| 324 | Creando un Diccionario de Pares Caracteres-Palabras | Construye un programa que tenga una función que reciba un string y cree un diccionario que mapea cada carácter a... | PCEX | dictionaries | |
| 325 | Determinando Si Uno Es Adolescente (Caso 2) | Construye un programa que le pida al usuario que ingrese un string que contenga el nombre de usuario y la... | PCEX | exceptions | |
| 326 | Letter frequency | Construct a program which counts the frequency of each character in string 'Summer' and stores it in a dictionary. Finally,... | jsParsons | dictionaries | |
| 327 | Turing Machine Exercise: Add an a | Automata Construction Exercise | User creates a Turing machine that adds an a to a string of a's. | OpenDSA | Turing Machine |
| 328 | Turing Machine Exercise: Erase abc | Automata Construction Exercise | User creates a Turing machine that erases a string of a's, b's, and c's. | OpenDSA | Turing Machine |
| 329 | Turing Machine Exercise: Keep abc | Automata Construction Exercise | User creates a Turing machine that moves over a string of a's, b's, and c's. | OpenDSA | Turing Machine |
| 330 | 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 |
| 331 | CFG Ambiguity 2 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 332 | CFG Ambiguity 3 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 333 | Context-Free Language Membership Problem Frameset | Programmed Instruction | Programmed Instruction Frameset discussing how to recognize if a given string is derivable from a given Context-Free Grammar. | OpenDSA | Context-Free Language |
| 334 | DFA Example Trace: How a DFA Traces | Algorithm Visualization, Code Tracing Presentation | Visualization of how a DFA would process an input string. | OpenDSA | Deterministic Finite Automata |
| 335 | 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 | |
| 336 | Creating an Array of User Inputs | Construct a program that creates an array of eight string values received from the user. | PCEX | arrays | |
| 337 | Determining Whether One is a Teenager (Case 2) | Construct a program that asks the user to enter a string that has the user name and age separated by... | PCEX | classes, exception handling, exceptions, file i/o, if-else statement, loops, methods, objects | |
| 338 | 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 | |
| 339 | Determining Whether One is a Teenager | Construct a program that asks the user to enter a string that has the user name and age separated by... | PCEX | exception handling, if-else statement | |
| 340 | Updating an Element in a List (Case 3) | Construct a program that initializes a list with four string values, changes the last element in the list, and finally,... | PCEX | list, value vs reference | |
| 341 | Adding Values to an Empty List | Construct a program that creates a list of eight string values received from the user. | PCEX | list | |
| 342 | 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 |
| 343 | Last n Characters | Code Completion | Write a method that gets the last n characters from a string. For example, last("Hello, World!", 5) should return the... | CodeCheck | Fundamental Data Types |
| 344 | Swap first and last name | Code Completion | Write a method getLastFirst whose parameter is a string containing a name such as "Harry Smith" and that returns a... | CodeCheck | Fundamental Data Types |
| 345 | (Inheritance) Physics teacher - CSEdPad | Demonstrate the inheritance concept by creating a superclass Teacher with a private string features designation and collegeName and does function.... | AnnEx | inheritance | |
| 346 | Letter frequency | Construct a function which counts the frequency of each character in the string given as a parameter and returns a... | jsParsons | dictionaries | |
| 347 | 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 |
| 348 | CFG Ambiguity 1 Exercise: Alternate | Question, Battery | A collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 349 | CFG Ambiguity 2 Exercise: Alternate | Question, Battery | A second collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 350 | CFG Ambiguity 3 Exercise: Alternate | Question, Battery | A third collection of self-practice questions where users determine whether a given string is parsed ambiguously or not. Alternate version. | OpenDSA | Context-Free Grammar, Ambiguity |
| 351 | 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 |
| 352 | Pumping Lemma Example: wwR | Programmed Instruction, Proof Visualization | Programmed Instruction slideshow showing the pumping lemma proof that the language consisting of a string w followed by the reverse... | OpenDSA | Non-Regular Language |
| 353 | Stutter | Code Completion | Your task is to write a method stutter that repeats all letters t in a string. For example, the call... | CodeCheck | Loops |
| 354 | GetVowels | Code Completion | Your task is to write a method getVowels that gets the vowels in a string. For example, the call getVowels("Hello,... | CodeCheck | Loops |
| 355 | Letter frequency (count) | Code Completion | Write a method that computes how often each letter A-Z or a-z occurs in a string. Don't distinguish between upper-... | CodeCheck | Arrays and Array Lists |
| 356 | c_upis_reda_na_kraj_datoteke | Data je datoteka knjige.txt koja u svakom redu sadrži sljedeće podatke razdvojene zarezom: cijena (realan broj), broj primjeraka (cijeli broj)... | PCEX | ||
| 357 | c_pretvaranje_broja_u_slovo | Napisati program koji omogućava unos teksta sa maksimalno 1000 karaktera, a zatim u tekstu zamjenjuje sve brojeve sa slovom 'B'.... | PCEX | ||
| 358 | On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. | Code Completion | On a chessboard, positions are marked with a letter between a and h for the column and a number between... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 359 | On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. | Code Completion | On a chessboard, positions are marked with a letter between a and h for the column and a number between... | CodeCheck | Branches, Branches Without Functions |
| 360 | On a chessboard, fields are marked with a letter between a and h for the column and a number between 1 and 8 for the row. | Code Completion | On a chessboard, fields are marked with a letter between a and h for the column and a number between... | CodeCheck | Branches, Branches Without Functions |
| 361 | 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 |
| 362 | Turing Machines Deciding vs. Accepting Frameset | Programmed Instruction | Slideshow presenting the distinction between a Turing Machine that decides a language (always halts with a decision) vs. one that... | OpenDSA | Turing Machine |
| 363 | JLinkedListUtil | This LinkedListUtil class tests various usages of the LinkedList class. The single param is an array of string. You will... | PCEX | ||
| 364 | JLinkedListUtil Challenge | This LinkedListUtil class tests various usages of the LinkedList class. The single param is an array of string. You will... | PCEX | ||
| 365 | Letter frequency (percentage) | Code Completion | Write a method that computes the frequency (as a percentage between 0.0 and 1.0) of each letter A-Z or a-z... | CodeCheck | Arrays and Array Lists |
| 366 | Recursive toString for array | Code Completion | Complete the static mkString method in the MyMethods class so that it formats an array of int values, with the... | CodeCheck | Recursion |
| 367 | Balloon Filled Sky | Code Completion | Your task is to draw n balloons centered at random positions, each with a randomly colored circle and a white... | CodeCheck | Loops |
| 368 | Initials | Code Completion | Complete the initials method in the class below. For example, the call initials("Harry", "Joseph", "Hacker") should return the string "HJH". | CodeCheck | Fundamental Data Types |
| 369 | Using an Abstract Class | Code Completion | Light bulbs can be identified by type and can be measured by the amount of lumens produced per watt of... | CodeCheck | Inheritance |
| 370 | Check for Valid Answers | Code Completion | Consider a program that administers multiple-choice quizzes. The student needs to provide a response such as A or D. Your... | CodeCheck | Branches |
| 371 | On a chessboard, fields are marked with a letter between a and h for the column and a number between 1 and 8 for the row. | Code Completion | On a chessboard, fields are marked with a letter between a and h for the column and a number between... | CodeCheck | Branches, Branches Without Functions |
| 372 | On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. | Code Completion | On a chessboard, positions are marked with a letter between a and h for the column and a number between... | CodeCheck | Branches, Branches Without Functions |
| 373 | On a chessboard, positions are marked with a letter between a and h for the column and a number between 1 and 8 for the row. | Code Completion | On a chessboard, positions are marked with a letter between a and h for the column and a number between... | CodeCheck | Two-Dimensional Arrays, No Loops |
| 374 | Animal Class Hierarchy (Case 2) | Suppose we have a class Animal and we want to extend it to produce class Dog. An animal has a... | PCEX | inheritance | |
| 375 | Animal Class Hierarchy (Case 2) | Suppose we have a class Animal and we want to extend it to produce class Dog. An animal has a... | PCEX | inheritance | |
| 376 | 371t3 hack3rs | Code Completion | The "elite hackers" like to make their text look cool by replacing characters with similar-looking symbols: e becomes 3, i... | CodeCheck | Objects |
| 377 | 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 |
| 378 | Color codes for double-sized image | Code Completion | Consider an image that is composed of a number of colored small squares, each colored in one of these 8... | CodeCheck | Loops |
| 379 | 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 |
| 380 | 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 |