Given two strings, s1 and s2, select only the characters in each string where the character in thesame position in the other string is in uppercase. Return these as a single string.To illustrate, given the strings s1 = "heLLo" and s2 = "GUlp", we select the letters "he" from s1,because "G" and "U" are uppercase. We then select "Ip" from s2, because "LL" is in uppercase.Finally, we join these together and return "help".ExamplesselectLetters("heLLO", "GUlp")"GUlp") → "help"selectLetters("1234567", "XxXxX") → "135"wwwwwwwwwww.selectLetters("EVERYTHING", "SomeThings")→ "EYSomeThings"

Algorithm - Take input from user Use that input into the method argument. use the below logic…

Answered: Given two strings, s1 and s2, select…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

For this project, you will be writing regular expressions that look for and find all instances of a date in any given string. Your program should: Find the following different formats for dates: August 2nd, 1994 august 2, 1994 08/02/1994 08/02/94 08-02-1994 Your program should be case insensitive using re.IGNORECASE Your program can only have a maximum of two different regexes. A special prize goes to those of you who can fit all of this into one regex Your program should be able to tell if the date is a valid date. For example, if the date says 99/99/99, then your program should ignore this as a date. HINT: this is not done within the regex. Try saving your dates to something like a list and going through that list after your regex runs. At the end of your program, it should print out all of the dates in the following format: mm/dd/yyyy. EX. 08/02/1994 Your program should use at least two character classes, you may need more. Feel free to make your own custom classes as well.…
On a piano, a key has a frequency, say f0. Each higher key (black or white) has a frequency of fo* r, where n is the distance (number of keys) from that key, and r is 21/12) Given an initial key frequency, output that frequency and the next 3 higher key frequencies. Output each floating-point value with two digits after the decimal point, then the units ("Hz"), then a newline, using the following statement: printf("$0.21f Hz\n", yourValue); Ex: If the input is: 440.0 (which is the A key near the middle of a piano keyboard), the output is: 440.00 Hz 466.16 Hz 493.88 Hz 523.25 Hz Note: To compute the next 3 higher key frequencies, use one statement to computer = 2(1/12) using the pow function (remember to include the math library). Then use that r in subsequent statements that use the formula f = f0 *r¹ with n being 1, 2, and finally 3. O Run v main.c 1 2 3 int main(void) { #include Reset Lab Tutorial Ⓡ
Given a string str, find the length of the longest substring without repeating characters. (a).For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, with length 6. (b).For “BBBB” the longest substring is “B”, with length 1.For “GEEKSFORGEEKS”, (c).there are two longest substrings shown in the below diagrams, with length 7 write code in python
For each item, write a single regular expression that matches that item. Note that in ALL cases, the entire string must match without additional characters. 1. A string of digits that contains only digits and contains exactly two fives. Examples of acceptable strings include: "15445", "55", "05563" o The string should be rejected if it contains anything other than a digits. 2. A regular expression that matches a time expressed in the form "1:45 PM". o The hours part must be a number from 1 to 12, the minutes range from 00 to 59, and the time must indicate either AM or PM (uppercase only and preceded by exactly one space). 3. A regular expression that matches a string representing a comma separated list of variable names such as: hello, get_max, sum3 o A variable name consists of letters, digits, and underscores but cannot start with a digit. o There is exactly one space after every comma. No other spaces are allowed. o Commas and spaces are not allowed before the first name and after…
Make a program that ask the user for information about a patient in a doctor's office. It should ask the user for the patient's first name, last name, month of birth, and country of birth. When done reading information from the user, it should print out all the information received. Use strings and each string should be 100 characters. The input should accept white spaces as well as the output (printing them). It can be done in main and you can use separate strings. The program does not have to check whether or not the user inputted more than 100 characters. Output: First name: Thomas Last name: Martin Smiths Month of birth: January Country of birth: United States of America Information about: Thomas Martin Smiths January United States of America
For each item, write a single regular expression that matches that item. Note that in ALL cases, the entire string must match without additional characters. A string of digits that contains only digits and contains exactly two fives. Examples of acceptable strings include: "15445", "55", "05563" The string should be rejected if it contains anything other than a digits. 2. A regular expression that matches a time expressed in the form "1:45 PM". The hours part must be a number from 1 to 12, the minutes range from 00 to 59, and the time must indicate either AM or PM (uppercase only and preceded by exactly one space). 3. A regular expression that matches a string representing a comma separated list of variable names such as: hello, get_max, sum3 A variable name consists of letters, digits, and underscores but cannot start with a digit. There is exactly one space after every comma. No other spaces are allowed. Commas and spaces are not allowed before the first name…

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS