Read two strings that contain only alphabet (a' through 'z' and 'A' through 'Z'). Merge them based on the ASCII order of the alphabet. Remove all of the duplicated letters. See the example session below. Read "binarytriangle" and "ANSIStandard" -> "AINSabdegilnrty" Read "RabitRunNING" and "TurTLeSleepiNG" -> "GILNRSTabeinprtu" Bye... This is easily done by concatenating the two strings into one and finding the smallest letter and adding it to a new string until you consume all the letters in the concatenated string. No addition should be made if the letter is already added, i.e., if the letter at the tail of the new string has the same letter found as the smallest at the current round of iteration. Assimilate the above example. You need the exact same format for grading. The input must be formed like below used for this example. You should not include non-alphabet letter, you should send two strings "quit' and 'quit" to terminate program. binarytriangle ANSIStandard RabitRunNING TurTLeSLeepiNG quit quit.

Read two strings that contain only alphabet (a' through 'z' and 'A' through 'Z'). Merge them based on the ASCII order of the alphabet. Remove all of the duplicated letters. See the example session below. Read "binarytriangle" and "ANSIStandard" -> "AINSabdegilnrty" Read "RabitRunNING" and "TurTLeSleepiNG" -> "GILNRSTabeinprtu" Bye... This is easily done by concatenating the two strings into one and finding the smallest letter and adding it to a new string until you consume all the letters in the concatenated string. No addition should be made if the letter is already added, i.e., if the letter at the tail of the new string has the same letter found as the smallest at the current round of iteration. Assimilate the above example. You need the exact same format for grading. The input must be formed like below used for this example. You should not include non-alphabet letter, you should send two strings "quit' and 'quit" to terminate program. binarytriangle ANSIStandard RabitRunNING TurTLeSLeepiNG quit quit.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

python Write a Pig Latin converter. We will use a simple version of Pig Latin. To convert a word to Pig Latin: If the first letter of a word is a consonant: remove the first letter and place that letter at the end of the word. Then, append the string "ay" to the end of the word. If the first letter of the word is a vowel (a, e, i, o, u): Simply append "way" to the end of the word. Treat the letter "y" as a consonant. Make sure all letters in the Pig Latin word are lowercase. Ex: If the input is: Sleep the output is: leepsay Ex: If the input is: apple the output is: appleway
the string below comes from an alphabet consisting of only characters A and B. Accordingly, write the full code of the program (Use the given space below the question. If you struggle to fit then upload a file) that prints the permutation list that can be formed with the characters A or B, which can replace the question marks, into a text file. (Hint: give a go to into the space recursion) A?AA?BB?A? The output will be like the list below: ABAABBBBAB АВААВВBBAА АBAАВBBAAВ АВААВВBAAА ABAAABBBAB ABAAABBBAA
the string below comes from an alphabet consisting of only characters A and B. Accordingly, write the full code of the program (Use the given space below the question. If you struggle to fit into the space then upload a file) that prints the permutation list that can be formed with the characters A or B, which can replace the question marks, into a text file. (Hìnt: give a go to recursion) А?АА?ВВ?А? tle The output will be like the list below: АВААВВBBAВ ABAABBBBAA АВААВВBAAВ АВААВВBAAА ABAAABBBAB АВАAАВВBAА
Given the list of names "Abd Ar Rahman", "bin Muhammed", "ibn Khaldun", we want to get and display the string of the full name where the names are separated by comma "Abd Ar Rahman, bin Muhammed, ibn Khaldun", To answer the question, drag and drop the statements (below) to their correct position in the code (above). names = ["Abd Ar Rahman", "bin Muhammed", "ibn Khaldun"] ifi > 1: for i in range(len(names)+1): result = result + result = result + names[i] print(result) result = "" names = ["Abd Ar Rahman, bin Muhammed, ibn Khaldun"] for i in range(len(names)) : if i > 0:
Print the total number of words in the file. Print the total number of different words (case sensitive, meaning “We” and “we” are two different words) in the file. Print all words in ascending order (based on the ASCII code) without duplication. Write a pattern match method to find the location(s) of a specific word (a character string up to twelve characters, e.g. system). This method should return all line number(s) and location(s) of the word(s) found in the file. Print all line(s) with line number(s) of the file where the word is funds by invoking the method of 4). Under each output line indicate the location(s) of the first character of the matched word (refer to the output example below). Empty lines are lines, they also have their own unique line numbers. java Project mytext.txt The total number of word in the file is: 501 The total number of different words in the file is: 465 Words of the input file in ascending order without duplication: // here are output of all words in…
PLEASE NOTE: IT'S A TEXT BOOK EXERCISE. BOOK NAME: Fundamentals of Computer Programming with Programming Basics with C# (English) Problem: String Encryption Write a method Encrypt(char letter), which encrypts a given letter in the following way: It takes the first and the last digit from the ASCII code of the letter and concatenates them into a string, which will represent the result. In the beginning of the string, which represents the result, we will insert the symbol which matches the following condition: ASCII code of the letter + the last digit of the ASCII code of the letter. After that in the end of the string, which represents the result, you concatenate the character which matches the following condition: ASCII code of the letter - the first digit of the ASCII code of the letter. The method should return the encrypted string. Example: j → p16i ASCII code of j is 106 → First digit – 1, last digit – 6. We concatenate the first and the last digit → 16. At the beginning…
Use for loop in Java language Write the method stringSplosion().* * The method takes one parameter, a non-empty String str (such as "Code") and* returns a String in the form "CCoCodCode". Notice that this includes the* first character of the original String, followed by the first two characters,* and so on until the whole String is used.* * Examples: stringSplosion("Code") returns "CCoCodCode" stringSplosion("abc")* returns "aababc" stringSplosion("x") returns "x"* * @param str the input String to process.* @return a new String as described above.
Take the following Python code that stores a string: str = I**#ABC123*#*123*abc**: *#**** *##*****! Remove all the * or # in the string, and then output the result. Hint: You can use for loop to go through all charactors one by one . Or you can use string method str.replace.
Implement the OutputWithoutWhitespace() function. OutputWithoutWhitespace() outputs the string's characters except for whitespace (spaces, tabs). Note: A tab is '\t'. Call the OutputWithoutWhitespace() function in main
given the strings s1 and s2, not necessarily of the same lenght, create a new string consisting of alternating characters of s1 and s2 (that is, the first character of s1 followed by the first character of s2, followed by the second characters of s1, followed by the second character of s2, and so on. Once the end of either string is reached, the reminder of the longer string is added to the end of the new string. For example, if s1 contained "abc" and s2 contained"uvqxyz", then the new string should contain "aubvcwxyz". Assign the new string to the variable s3. using python and loops
please codee in python Write a script that prompts the user for two words (two, one-word strings). Print all the unique letters that are common to both words, in alphabetical order, using for loops in your solution. As shown below case does not matter. If there are no letters in common print There are no letters in common. Example: Enter one word: Home Enter another word: Meter Letters in common: em
The file words.txt on the book’s website contains 87,314 words from the English language. Write a program that reads through this file and finds the word that has the most consecutive vowels. For example, the word "bedouin" has three consecutive vowels.