Someone has attempted to censor my strings by replacing every vowel with a *, 1*k* th*s. Luckily, I've been able to find the vowels that were removed. Given a censored string and a string of the censored vowels, return the original uncensored string. Example uncensor("Wh*r* d*d my v*w*ls g*?", "eeioeo") "Where uncensor ("abcd", "") "abcd" uncensor("*pP*RC*S*", "UEAE") "UPPERCASE"

Someone has attempted to censor my strings by replacing every vowel with a , 1k* ths. Luckily, I've been able to find the vowels that were removed. Given a censored string and a string of the censored vowels, return the original uncensored string. Example uncensor("Whr* dd my vwls g?", "eeioeo") "Where uncensor ("abcd", "") "abcd" uncensor("pPRCS", "UEAE") "UPPERCASE"

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

Given a text string, create and return a new string of same length where all vowels have been reversed, and all other characters are kept as they were. For simplicity, in this problem only the characters aeiouAEIOU are considered vowels, and y is never a vowel. For example, given the text string "Uncle Sente lives in Russia", this method should create and return the string "Ancli Sunti levis en Resseu".Furthermore, to make this problem more interesting and the result look more palatable, this method must maintain the capitalization of vowels based on the vowel character that was originally in the position that each new vowel character is moved into. For example, "Ilkka Markus" should become "Ulkka Markis" instead of "ulkka MarkIs". Use the handy character classification methods in the Character utility class to determine whether some particular character is in upper or lower case, and convert some character to its upper or lower case version as needed. Here's the tester it must…
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
Consider the following implementation of the compareTo() method for String.How does the third line help with efficiency?public int compareTo(String that){ if (this == that) return 0; // this line int n = Math.min(this.length(), that.length()); for (int i = 0; i < n; i++) { if (this.charAt(i) < that.charAt(i)) return -1; else if (this.charAt(i) > that.charAt(i)) return +1; } return this.length() - that.length();}
Write regular expressions for the following languages. By “word”, we mean an alphabetic string separated from other words by whitespace, any relevant punctuation, line breaks, and so forth. (a) The set of all alphabetic strings;(b) The set of all lower case alphabetic strings ending with a letter b;(c) The set of all strings with two consecutive repeated words (e.g., “Humbert Humbert” and “the the” but not “the bug” or “the big bug”);(d) All strings that start at the beginning of the line with an integer and that end at the end of the line with a word;(e) All strings that have both the word grotto and the word raven in them (but not, e.g., words like grottos that merely contain the word grotto);
: Write a java program that count the number of letters in a String and find the first occurrence of S, U, I, T in the String and return indices of S, U, I, T. Join the three initialized Strings string1, string2, and string3. Count the number of white spaces in the complete string. Use toUpperCase() and replaceAll("\\s", "") methods to convert string into Upper Case and remove all white Spaces from the string. Count the number of letters in the string. Find the first occurrence of S, U, I, T in the String and return indices of S, U, I, T. Strings are given below: String string1 = "Globalization and Information Technology continue to process at a dramatic pace" String string2 = "To answer the demand of a changing society Pakistan higher education system needs to shift its focus from individuals who simply absorb knowledge to those who are able to creatively utilize knowledge to excel in unfamiliar situations"; String string3 = "These creative individuals should be able to track…
Implement a new concat method in the String class you worked on for HW2. The method should return a new String object that represents the text you would end up with if the argument String were "added onto the end of" this String. For example, in the code below, the String object answer should represent the text "bookstore" and true should be printed the screen. char[] bookA = {'b', 'o', 'o', 'k'}; char[] storeA = {'s', 't', 'o', 'r', 'e'}; char[] bookstoreA = {'b', 'o', 'o', 'k', 's', 't', 'o', 'r', 'e'}; String book = new String(bookA); String store = new String(storeA); String bookstore = new String(bookstoreA); String answer = book.concat(store); System.out.println(answer.equals(bookstore)); In the text area below, type in your definition of the concat method. (In other words, type in the code that should replace the //TODO comment.) Your code cannot call any methods. public class String { private char[] data; public String(char[] value) { data = new…
write a program that allows the input of a string from the user and prints the longest word in that string and its length. If there are multiple words with the same maximum length you must print the first one only.
Write a program that will analyze a string by counting the number of each alphabetic letter in the stringand then printing a vertical histogram showing the frequency of the letters in the string.For example, if text = "I love problem-solving.", your program should plot when thehistogram is printed: * * * * * * * * * * * * * * * * * * *---------------------------------------------------a b c d e f g h i j k l m n o p q r s t u v w x y zNote that all special characters including blanks are ignored and alphabet letters are caseinsensitive.Create your source code file named Lab10FirstnameLastname.java in NetBeans and add thefollowing menu to the main method in the Lab10FirstnameLastname class.T: Enter a text stringP: Plot alphabetic frequencies in the stringQ: QuitSelect an option:Add the following Histogram class to your source code file and complete the setText(Stringt) and drawHistogram() methods to do the work for options T and P in your main menu.The setText(String t)method changes…
Implement a mechanism for performing basic string compression using repeated character counts. The string aabccccaaa, for example, would become a2blc5a3. Your method should return the original string if the "compressed" string does not grow smaller than the original string. You can assume that the string only contains uppercase and lowercase letters (a-z).
Write a program that reads from stdin and filters out duplicate lines of input. It should read lines from stdin, and then print each unique line along with a count of how many times it appeared. Input is case-sensitive, so “hello” and “Hello” are not duplicates. There can be an arbitrary number of strings, of arbitrary length. Note that only adjacent duplicates count, so if the input were the lines “hello”, “world”, and “hello” again, all three would be treated as unique. ./uniqhellohellohelloworldworld^D # close stdin3 hello2 world ./uniqhelloworldhello^D # close stdin1 hello1 world1 hello
Write a Java method toDecimalString() that receives a string with hexadecimal symbols andreturns another string where every hexadecimal symbol is converted individually to its decimalrepresentation. If the received string contains a wrong hexadecimal value, it should return an errormessage.To test your method, write a main() method that enables the user to input a string in hexadecimalformat, removes eventual extra spaces from it, and makes all characters of the string in upper case.Then, sends this string to toDecimalString() and displays the returned string (decimal format orerror message).Hints:1. To declare an empty string use: String newString = "";2. The hexadecimal system is composed of 16 symbols: 0 to 9 and A to F.a. To check if a character c is a digit you can use: Character.isDigit(c);b. The decimal representation of A is 10, B is 11, C is12, D is 13, E is 14, and F is 15. Run Example 1:Enter a hexadecimal string: 2gkDecimal value is: Wrong hexadecimal value (g) Run…
can you solve this please? Adopt appropriate Java animation code to implement the video in the file “test4.wmv” and given that the parametric equation for a circle. x=r*cos(t) y=r*sin(t) with t in range [0, 2p] and r is the radius of the circle. (the circle goes in a loop like in the images, i did my best to try to explain it , please try to do it ) and here is a sample of what they want me to use : package javaapplication1;import java.awt.*;import java.awt.event.*;import javax.swing.*;import java.awt.geom.*;import java.util.Random;import javax.imageio.*;import java.io.File;import java.io.IOException;import java.awt.image.BufferedImage;import java.awt.event.*;import java.util.Calendar; public class JavaApplication1 extends JApplet { public static void main(String[] args) { JFrame frame=new JFrame(); frame.setTitle("hello"); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); JApplet applete =new JavaApplication1(); applete.init();…