Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | (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 | |
| 2 | (Strings) String length - CSEdPad | Given a string, this program finds out the length of a string. | AnnEx | string | |
| 3 | Strings Review Quiz | Question, Battery | Strings introduction for CS1 review questions. | OpenDSA | String |
| 4 | String Formatting V1 | Python PredictingFinalResult for demonstrating String Formatting V1 | QuizPET | strings | |
| 5 | String Formatting | Python PredictingFinalResult for demonstrating String Formatting | QuizPET | strings | |
| 6 | String Formatting 1 | Python PredictingFinalResult for demonstrating String Formatting 1 | QuizPET | strings | |
| 7 | String Formatting 2 | Python PredictingFinalResult for demonstrating String Formatting 2 | QuizPET | strings | |
| 8 | string reference | Python PredictingFinalResult for demonstrating string reference | QuizPET | aliasing, value vs reference | |
| 9 | String Index Search | Python BehaviorExample for demonstrating String Index Search | WebEx | search algorithms, strings | |
| 10 | String Variables | Java PredictingFinalResult for demonstrating String Variables | QuizJET | data types, primitive data types, string operations, strings, variables | |
| 11 | Strings 1 | Java PredictingFinalResult for demonstrating Strings 1 | QuizJET | string, string operations, strings | |
| 12 | Strings 2 | Java PredictingFinalResult for demonstrating Strings 2 | QuizJET | string operations, strings | |
| 13 | Strings 3 | Java PredictingFinalResult for demonstrating Strings 3 | QuizJET | string operations, strings | |
| 14 | Strings 4 | Java PredictingFinalResult for demonstrating Strings 4 | QuizJET | string operations, strings | |
| 15 | Strings 5 | Java PredictingFinalResult for demonstrating Strings 5 | QuizJET | string operations, strings | |
| 16 | String Concat | Java PredictingFinalResult for demonstrating String Concat | QuizJET | strings | |
| 17 | String (equals) | Java PredictingFinalResult for demonstrating String (equals) | QuizJET | string operations, strings | |
| 18 | String (replace) | Java PredictingFinalResult for demonstrating String (replace) | QuizJET | string operations, strings | |
| 19 | String Concatenation (Case 1) | Construct a program that prints the text "24 and 45 concatenated: 2445" and "24 and 45 added: 69". | PCEX | ||
| 20 | String Concatenation (Case 2) | Construct a program that prints the text "333", "63", and "36". | PCEX | ||
| 21 | String Concatenation (Case 1) | Construct a program that prints the text "24 and 45 concatenated: 2445" and "24 and 45 added: 69". | PCEX | ||
| 22 | String Concatenation (Case 2) | Construct a program that prints the text "333", "63", and "36". | PCEX | ||
| 23 | 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 | ||
| 24 | String Comparison (Case 2) | Construct the program that modifies the string "hexxo worxd!" so that it matches (ignoring case) the string "HELLO WORLD!". | PCEX | ||
| 25 | 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 | ||
| 26 | String Comparison (Case 2) | Construct the program that modifies the string "hexxo worxd!" so that it matches (ignoring case) the string "HELLO WORLD!". | PCEX | ||
| 27 | String With Escape Characters (Case 1) | Construct a program that prints the following output:\n"Quotes"\nSlashes\n\//\nHow '"confounding' "\" it is! | PCEX | ||
| 28 | 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 | ||
| 29 | String With Escape Characters (Case 3) | Construct a program that prints the following output:\n"Slashes"\\//\n \\//\nHow '"confounding' "\" it is! | PCEX | ||
| 30 | String With Escape Characters (Case 1) | Construct a program that prints the following output:\n"Quotes"\nSlashes\n\//\nHow '"confounding' "\" it is! | PCEX | ||
| 31 | 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 | ||
| 32 | String With Escape Characters (Case 3) | Construct a program that prints the following output:\n"Slashes"\\//\n \\//\nHow '"confounding' "\" it is! | PCEX | ||
| 33 | string_compare | C++ BehaviorExample for demonstrating string_compare | AnnEx | ||
| 34 | string_lib_func1 | C++ BehaviorExample for demonstrating string_lib_func1 | AnnEx | ||
| 35 | string_to_integer | C++ BehaviorExample for demonstrating string_to_integer | AnnEx | ||
| 36 | String Comparison | String Comparison | AnnEx | if-else statement | |
| 37 | String Length | String Length | AnnEx | strings | |
| 38 | String Equals | Java BehaviorExample for demonstrating String Equals | AnnEx | boolean expressions, strings, variables | |
| 39 | String Example | StringExample | AnnEx | strings | |
| 40 | String Operation | String Operation | AnnEx | pattern matching | |
| 41 | String Operation pt | This is the portuguese version. | AnnEx | pattern matching | |
| 42 | String Indexing | Construct a program that first prints out strings "Py", "th", "o", and "n" | jsParsons | strings | |
| 43 | String join | Construct a program that prints out a sentence from a given list of words. | jsParsons | strings | |
| 44 | String Example | Java CodeVisualization for demonstrating String Example | JSVEE | string operations, strings | |
| 45 | 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 |
| 46 | f-string formatting 1 | Python PredictingFinalResult for demonstrating f-string formatting 1 | QuizPET | strings | |
| 47 | f-string formatting 2 | Python PredictingFinalResult for demonstrating f-string formatting 2 | QuizPET | strings | |
| 48 | f-string formatting 3 | Python PredictingFinalResult for demonstrating f-string formatting 3 | QuizPET | strings | |
| 49 | f-string formatting 4 | Python PredictingFinalResult for demonstrating f-string formatting 4 | QuizPET | strings | |
| 50 | Finding character in a string | Python BehaviorExample for demonstrating Finding character in a string | WebEx | strings | |
| 51 | Strings 6 | Java PredictingFinalResult for demonstrating Strings 6 | QuizJET | conditionals, data types, string operations, strings, variables | |
| 52 | Char Strings (Memphis) | Some demos of working with the char and String data types. | AnnEx | strings | |
| 53 | Creating String | Creating String | AnnEx | strings | |
| 54 | f-string format 1 | Python CodeVisualization for demonstrating f-string format 1 | JSVEE | strings | |
| 55 | f-string format 2 | Python CodeVisualization for demonstrating f-string format 2 | JSVEE | strings | |
| 56 | 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 |
| 57 | 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 |
| 58 | 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 |
| 59 | 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 |
| 60 | 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 |
| 61 | 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 |
| 62 | 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 |
| 63 | 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 |
| 64 | 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 |
| 65 | 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 |
| 66 | 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 |
| 67 | 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 |
| 68 | 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 |
| 69 | 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 |
| 70 | 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 |
| 71 | 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 |
| 72 | 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 |
| 73 | 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 |
| 74 | 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 |
| 75 | 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 |
| 76 | 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 |
| 77 | 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 |
| 78 | 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 |
| 79 | 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 |
| 80 | 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 |
| 81 | q_py_concat_strings1_es | Python PredictingFinalResult for demonstrating q_py_concat_strings1_es | QuizPET | strings | |
| 82 | concatenate strings | Python PredictingFinalResult for demonstrating concatenate strings | QuizPET | strings | |
| 83 | Strings Basics | Python BehaviorExample for demonstrating Strings Basics | WebEx | strings | |
| 84 | Sub-Strings | Python BehaviorExample for demonstrating Sub-Strings | WebEx | strings | |
| 85 | Adding Strings | Python BehaviorExample for demonstrating Adding Strings | WebEx | strings | |
| 86 | strings.addition | PCEX Set of activities for strings.addition | PCEX | ||
| 87 | strings.addition | PCEX Set of activities for strings.addition | PCEX | ||
| 88 | strings.charAt | PCEX Set of activities for strings.charAt | PCEX | ||
| 89 | strings.charAt | PCEX Set of activities for strings.charAt | PCEX | ||
| 90 | strings.equals | PCEX Set of activities for strings.equals | PCEX | ||
| 91 | strings.equals | PCEX Set of activities for strings.equals | PCEX | ||
| 92 | strings.escape_chars | PCEX Set of activities for strings.escape_chars | PCEX | ||
| 93 | strings.escape_chars | PCEX Set of activities for strings.escape_chars | PCEX | ||
| 94 | strings.substring | PCEX Set of activities for strings.substring | PCEX | ||
| 95 | strings.substring | PCEX Set of activities for strings.substring | PCEX | ||
| 96 | 2-21_StringDemos | Java BehaviorExample for demonstrating 2-21_StringDemos | AnnEx | strings | |
| 97 | Strings (charAt) | Java BehaviorExample for demonstrating Strings (charAt) | AnnEx | strings | |
| 98 | Strings (Concatenation) | Java BehaviorExample for demonstrating Strings (Concatenation) | AnnEx | ||
| 99 | Strings (equalsIgnoreCase) | Java BehaviorExample for demonstrating Strings (equalsIgnoreCase) | AnnEx | strings | |
| 100 | Strings (parse) | Java BehaviorExample for demonstrating Strings (parse) | AnnEx | strings | |
| 101 | Strings (replace) | Java BehaviorExample for demonstrating Strings (replace) | AnnEx | strings | |
| 102 | Strings | Python CodeVisualization for demonstrating Strings | JSVEE | strings | |
| 103 | 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 |
| 104 | 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 |
| 105 | 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 |
| 106 | Comparing Strings | Java PredictingFinalResult for demonstrating Comparing Strings | QuizJET | boolean expressions, control flow, string operations | |
| 107 | Comparing Strings | Java PredictingFinalResult for demonstrating Comparing Strings | QuizJET | boolean expressions, conditionals, data types, string operations, strings, variables | |
| 108 | Converting String to double | Java PredictingFinalResult for demonstrating Converting String to double | QuizJET | primitive data types, strings | |
| 109 | Converting String to int | Java PredictingFinalResult for demonstrating Converting String to int | QuizJET | primitive data types, strings | |
| 110 | Accessing String Characters (Case 1) | Construct a program that prints the 1st, 9th, and the last character of the string "String Example!". | PCEX | ||
| 111 | Accessing String Characters (Case 2) | Construct a program that prints the 7th, 11th, and 14th character of the string "Second Example!". | PCEX | ||
| 112 | Accessing String Characters (Case 1) | Construct a program that prints the 1st, 9th, and the last character of the string "String Example!". | PCEX | ||
| 113 | Accessing String Characters (Case 2) | Construct a program that prints the 7th, 11th, and 14th character of the string "Second Example!". | PCEX | ||
| 114 | find_string | C++ BehaviorExample for demonstrating find_string | AnnEx | ||
| 115 | DEPRECATED_String Comparison | Java BehaviorExample for demonstrating DEPRECATED_String Comparison | AnnEx | ||
| 116 | DEPRECATED_String Length | Java BehaviorExample for demonstrating DEPRECATED_String Length | AnnEx | ||
| 117 | 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 |
| 118 | Concatenating Strings and Numbers (Case 1) | Construct a program that uses variables x, y, and z to print "Python was invented in 1989.". | PCEX | ||
| 119 | Concatenating Strings and Numbers (Case 2) | Construct a program that uses variables x, y, and z to print "x * 2 = 4". | PCEX | ||
| 120 | Concatenating Strings and Numbers (Case 3) | Construct a program that uses variables x, y, and z to print "10 + 20 = 30". | PCEX | ||
| 121 | Slanje stringova u funkcije | PCEX Set of activities for Slanje stringova u funkcije | PCEX | ||
| 122 | DEPRECATED_StringExample | Java BehaviorExample for demonstrating DEPRECATED_StringExample | AnnEx | ||
| 123 | list reference (string) | Python PredictingFinalResult for demonstrating list reference (string) | QuizPET | aliasing, value vs reference | |
| 124 | q_py_q_py_string_formatting1_es | Python PredictingFinalResult for demonstrating q_py_q_py_string_formatting1_es | QuizPET | ||
| 125 | q_py_q_py_string_formatting2_es | Python PredictingFinalResult for demonstrating q_py_q_py_string_formatting2_es | QuizPET | ||
| 126 | Objects 4 (String) | Java PredictingFinalResult for demonstrating Objects 4 (String) | QuizJET | classes, object, objects, strings | |
| 127 | Objects 5 (String) | Java PredictingFinalResult for demonstrating Objects 5 (String) | QuizJET | classes, objects | |
| 128 | Concatenating Characters of Two Strings (Case 1) | Construct a program that has a function that receives two strings and returns a string formed from the given strings... | PCEX | ||
| 129 | Concatenating Characters of Two Strings (Case 2) | Construct a program that has a function that receives two strings and returns a string formed from the given strings... | PCEX | ||
| 130 | Concatenating Characters of Two Strings (Case 1) | Construct a program that has a function that receives two strings and returns a string formed from the given strings... | PCEX | ||
| 131 | Concatenating Characters of Two Strings (Case 2). | Construct a program that has a function that receives two strings and returns a string formed from the given strings... | PCEX | ||
| 132 | 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 | ||
| 133 | 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 | ||
| 134 | Repeating Characters of a String (Case 1) | Construct a program that has a function that receives a string and creates a new string that has each character... | PCEX | ||
| 135 | Repeating Characters of a String (Case 2) | Construct a program that has a function that receives a string and creates a new string that has every other... | PCEX | ||
| 136 | 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 | ||
| 137 | Ubacivanje karaktera u string | PCEX Set of activities for Ubacivanje karaktera u string | PCEX | ||
| 138 | DEPRECATED_Creating String | Java BehaviorExample for demonstrating DEPRECATED_Creating String | AnnEx | ||
| 139 | 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 |
| 140 | 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 |
| 141 | PDA Exercise: String and Reverse | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage WcW^R. | OpenDSA | Pushdown Automata |
| 142 | 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 |
| 143 | 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 |
| 144 | Variable type: Strings | Python BehaviorExample for demonstrating Variable type: Strings | WebEx | operators, variables | |
| 145 | Brisanje dijelova stringa | PCEX Set of activities for Brisanje dijelova stringa | PCEX | ||
| 146 | csedpad.04.StringClass.no_topic | PCEX Set of activities for csedpad.04.StringClass.no_topic | PCEX | ||
| 147 | csedpad.04.StringClass.no_topic_1 | PCEX Set of activities for csedpad.04.StringClass.no_topic_1 | PCEX | ||
| 148 | csedpad.04.StringClass.no_topic_1 | Given a person name, the program finds out the length, i.e., the number of characters, of the name. | PCEX | ||
| 149 | csedpad.04.StringClass.no_topic_1 | Given two names of two places, the program checks if they are equal in length. | PCEX | ||
| 150 | csedpad.04.StringClass.strings | PCEX Set of activities for csedpad.04.StringClass.strings | PCEX | ||
| 151 | csedpad.04.StringClass.strings | Given a person name, this program converts the name into uppercase and lowercase. | PCEX | ||
| 152 | csedpad.04.StringClass.strings_1 | PCEX Set of activities for csedpad.04.StringClass.strings_1 | PCEX | ||
| 153 | csedpad.04.StringClass.strings_1 | Given a first name and last name of a person, the program concatenates them to form a full name. | PCEX | ||
| 154 | Detektovanje granica unutar stringa | PCEX Set of activities for Detektovanje granica unutar stringa | PCEX | ||
| 155 | Mijenjanje karaktera u stringu | PCEX Set of activities for Mijenjanje karaktera u stringu | PCEX | ||
| 156 | c_trazenje_karaktera_u_stringu | Napisati program koji provjerava da li se u datom stringu nalazi određeni karakter. | PCEX | ||
| 157 | 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 | ||
| 158 | c_spajanje_dva_stringa | Napisati program koji dodaje sadržaj drugog stringa prvom stringu. | PCEX | ||
| 159 | 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 | ||
| 160 | 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 |
| 161 | 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 |
| 162 | Regular Expression Exercise: Strings Containing aba | RegEx Writing Exercise | User writes an regular expression for the language of strings containing aba. | OpenDSA | Regular Expression |
| 163 | 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 |
| 164 | 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 |
| 165 | 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 |
| 166 | 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 |
| 167 | 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 |
| 168 | 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 |
| 169 | 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 |
| 170 | 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 | ||
| 171 | 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 | ||
| 172 | Counting the Occurrences of One String in Another (Case 1) | Construct a program that has a function that receives a string and returns the number of times that the string... | PCEX | ||
| 173 | Counting the Occurrences of One String in Another (Case 2) | Construct a program that has a function that receives a string and returns the number of times that the string... | PCEX | ||
| 174 | Counting the Occurrences of One String in Another (Case 1) | Construct a program that has a function that receives a string and returns the number of times that the string... | PCEX | ||
| 175 | Counting the Occurrences of One String in Another (Case 2). | Construct a program that has a function that receives a string and returns the number of times that the string... | PCEX | ||
| 176 | 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 | ||
| 177 | 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 | ||
| 178 | 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 | |
| 179 | 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 | |
| 180 | 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 | |
| 181 | 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 | |
| 182 | Turing Machine Exercise: Reverse a String | Automata Construction Exercise | User creates a Turing machine that, given string W, outputs WW^R. | OpenDSA | Turing Machine |
| 183 | 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 |
| 184 | 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 | ||
| 185 | 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 |
| 186 | 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 |
| 187 | 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 |
| 188 | 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 |
| 189 | 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 |
| 190 | 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 |
| 191 | simple format | Python PredictingFinalResult for demonstrating simple format | QuizPET | string formatting, strings | |
| 192 | format with one argument | Python PredictingFinalResult for demonstrating format with one argument | QuizPET | string formatting, strings | |
| 193 | format with two arguments | Python PredictingFinalResult for demonstrating format with two arguments | QuizPET | string formatting, strings | |
| 194 | format with three arguments | Python PredictingFinalResult for demonstrating format with three arguments | QuizPET | string formatting, strings | |
| 195 | Output Formatting | Python BehaviorExample for demonstrating Output Formatting | WebEx | string formatting, strings | |
| 196 | Output Formatting 2 | Python BehaviorExample for demonstrating Output Formatting 2 | WebEx | string formatting, strings | |
| 197 | Concat Demo | Java CodeVisualization for demonstrating Concat Demo | JSVEE | string operations, strings | |
| 198 | ToString Demo | Java CodeVisualization for demonstrating ToString Demo | JSVEE | string operations, strings | |
| 199 | Format 1 | Python CodeVisualization for demonstrating Format 1 | JSVEE | string formatting, strings | |
| 200 | Format 2 | Python CodeVisualization for demonstrating Format 2 | JSVEE | string formatting, strings | |
| 201 | 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 |
| 202 | q_py_aliasing3_es | Python PredictingFinalResult for demonstrating q_py_aliasing3_es | QuizPET | strings | |
| 203 | q_py_output2_es | Python PredictingFinalResult for demonstrating q_py_output2_es | QuizPET | strings | |
| 204 | q_py_str_ref1_es | Python PredictingFinalResult for demonstrating q_py_str_ref1_es | QuizPET | strings | |
| 205 | q_py_substring1_es | Python PredictingFinalResult for demonstrating q_py_substring1_es | QuizPET | strings | |
| 206 | substring | Python PredictingFinalResult for demonstrating substring | QuizPET | strings | |
| 207 | Different Ways to Print | Python BehaviorExample for demonstrating Different Ways to Print | WebEx | strings, variables | |
| 208 | Escape Characters | Python BehaviorExample for demonstrating Escape Characters | WebEx | strings | |
| 209 | Substring | Substring | AnnEx | strings | |
| 210 | 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 | |
| 211 | 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 | |
| 212 | Practicar el corte de cadenas (slicing) | Construye un programa que primero imprima las cadenas "Py", "th", "o" y "n" | jsParsons | strings | |
| 213 | Palindrome | Python CodeVisualization for demonstrating Palindrome | JSVEE | strings | |
| 214 | q_py_output1_es | Python PredictingFinalResult for demonstrating q_py_output1_es | QuizPET | operators, strings, variables | |
| 215 | q_py_output3_es | Python PredictingFinalResult for demonstrating q_py_output3_es | QuizPET | operators, strings, variables | |
| 216 | Practicar métodos de cadenas | Construye un programa que imprima una oracion a partir de una lista dada de palabras. | jsParsons | list, strings | |
| 217 | if-else 1 | Java PredictingFinalResult for demonstrating if-else 1 | QuizJET | boolean expressions, conditionals, if-else statement, strings | |
| 218 | Simple Printing | Printing strings and numbers | AnnEx | variables | |
| 219 | csedpad.19.ExceptionHandling.exceptionhandling_1 | You have an empty string. You are trying to find out whether you can find | PCEX | ||
| 220 | (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 | |
| 221 | Characterizing Languages Exercise 2: Alternate | Question | Users characterize the strings in the language for a given grammar on palindromes. | OpenDSA | Language, Grammar |
| 222 | csedpad.20.Recursion.recursion | This program checks whether a string is palindrome or not (meaning the second half of the string is the reverse... | PCEX | ||
| 223 | 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 | ||
| 224 | 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 | ||
| 225 | 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 | ||
| 226 | 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 | ||
| 227 | 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 | ||
| 228 | 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 | ||
| 229 | c_ubacivanje_rijeci | Napisati program koji u datom stringu zamjenjuje svaku cifru 1 sa tekstom "jedan". Pretpostaviti da je primljeni string dovoljno velik... | PCEX | ||
| 230 | 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 | ||
| 231 | Huffman Coding Tree Slideshow: Decoding | Algorithm Visualization | Slideshow visualizing the process of decoding a string of Huffman Codes. | OpenDSA | Huffman Coding Tree |
| 232 | 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 | ||
| 233 | 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 | ||
| 234 | c_brisanje_samoglasnika | Napisati program koji iz datog stringa briše sve samoglasnike. | PCEX | ||
| 235 | 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 | ||
| 236 | c_funkcija_podstring | Napisati funkciju podstring koja prima dva stringa s1 i s2, te provjerava da li je s2 podstring stringa s1. Ako... | PCEX | ||
| 237 | 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 |
| 238 | 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 |
| 239 | 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 |
| 240 | 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 |
| 241 | 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 |
| 242 | 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 |
| 243 | 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 |
| 244 | 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 |
| 245 | Characterizing Languages Exercise 2 | Question | Exercise on how to characterize the strings in the language for a given grammar on palindromes. | OpenDSA | Language, Grammar |
| 246 | Context-Free Language Derivations Frameset | Programmed Instruction | Programmed Instruction Frameset discussing derivations of strings from Context-Free Grammars. | OpenDSA | Context-Free Language |
| 247 | Creating an Array of User Inputs | Construct a program that creates an array of eight string values received from the user. | PCEX | ||
| 248 | Creating an Array of User Inputs | Construct a program that creates an array of eight string values received from the user. | PCEX | ||
| 249 | 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 | ||
| 250 | 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 | ||
| 251 | Creating a Dictionary of Character-Count Pairs | Construct a program that has a function which receives a string from the user and creates a dictionary that maps... | PCEX | ||
| 252 | Creating a Dictionary of Character-Words Pairs | Construct a program that has a function which receives a string and creates a dictionary that maps each character to... | PCEX | ||
| 253 | Creating a Dictionary of Character-Count Pairs | Construct a program that has a function which receives a string from the user and creates a dictionary that maps... | PCEX | ||
| 254 | Creating a Dictionary of Character-Words Pairs. | Construct a program that has a function which receives a string and creates a dictionary that maps each character to... | PCEX | ||
| 255 | 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 | ||
| 256 | 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 | ||
| 257 | 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 | ||
| 258 | 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 | ||
| 259 | Updating an Element in the List (Case 3) | Construct a program that initializes a list with four string values, changes the last element in the list, and finally,... | PCEX | ||
| 260 | Updating an Element in the List (Case 3). | Construct a program that initializes a list with four string values, changes the last element in the list, and finally,... | PCEX | ||
| 261 | Add Values to an Empty List (Case 2) | Construct a program that creates a list of eight string values received from the user. | PCEX | ||
| 262 | Add Values to an Empty List (Case 2). | Construct a program that creates a list of eight string values received from the user. | PCEX | ||
| 263 | Letter frequency | Construct a program which counts the frequency of each character in string 'Summer' and stores it in a dictionary. Finally,... | jsParsons | dictionaries | |
| 264 | 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 |
| 265 | 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 |
| 266 | 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 |
| 267 | 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 |
| 268 | CFG Ambiguity 2 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 269 | CFG Ambiguity 3 Exercise | Question | A question where users determine whether a given string is parsed ambiguously or not. | OpenDSA | Context-Free Grammar, Ambiguity |
| 270 | 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 |
| 271 | 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 |
| 272 | 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 | ||
| 273 | 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 | ||
| 274 | 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 | ||
| 275 | 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 | ||
| 276 | 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 | ||
| 277 | 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 |
| 278 | 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 |
| 279 | 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 |
| 280 | 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 |
| 281 | 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 |
| 282 | 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 |
| 283 | 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 |
| 284 | 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 |
| 285 | 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 |
| 286 | 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 |
| 287 | 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 |
| 288 | 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 |
| 289 | 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 |
| 290 | 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 |
| 291 | 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 |
| 292 | 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 |
| 293 | 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 |
| 294 | 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 |
| 295 | 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 |
| 296 | Jison Grammar Exercise 2 | Calculation Exercise | A question where users calculate the number of strings parsed successfully by a given grammar. | OpenDSA | Parser Generator |
| 297 | 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 |
| 298 | Number of vowels | Write a program that counts how many vowels there are in a string (each one separately). | PCEX | ||
| 299 | Plain Old Java Object | Class named Book that represents a book with two properties: title (a String) and numberOfPages (an int). | PCEX | ||
| 300 | (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 | |
| 301 | Letter frequency | Construct a function which counts the frequency of each character in the string given as a parameter and returns a... | jsParsons | dictionaries | |
| 302 | 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 |
| 303 | 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 |
| 304 | 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 |
| 305 | 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 |
| 306 | 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 |
| 307 | 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 |
| 308 | 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 |
| 309 | 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 |
| 310 | 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 |
| 311 | Annotating Jison Exercise | Tracing Exercise | A question where users determine the results of parsing a given collection of strings. | OpenDSA | Parser Generator |
| 312 | 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 |
| 313 | 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 | ||
| 314 | 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 | ||
| 315 | 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 |
| 316 | 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 |
| 317 | 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 |
| 318 | 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 |
| 319 | 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 |
| 320 | 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 |
| 321 | 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 | ||
| 322 | 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 | ||
| 323 | Array-Based Queue Positions Slideshow | Algorithm Visualization | Slideshow presenting an initial design for storing a queue in an array. | OpenDSA | Array-Based Queue |
| 324 | 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 |
| 325 | 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 |