Problem 1. Input three strings s1, s2, and s3 from the keyboard such that s1 "Hello out there. How are you this morning?" s2 = "Did you watch the movie that was on TV last night?" s3= "Yes, we didd!" a. correct the spelling errors in s1 and s3 (find and replace) and re-display the strings. Also, replace "TV" with Netflix"!. b. concatenate all 3 strings but insert "**" between them. c. Print each string on a separate line d. print string s2 and s3 on the same line.

Problem 1. Input three strings s1, s2, and s3 from the keyboard such that s1 "Hello out there. How are you this morning?" s2 = "Did you watch the movie that was on TV last night?" s3= "Yes, we didd!" a. correct the spelling errors in s1 and s3 (find and replace) and re-display the strings. Also, replace "TV" with Netflix"!. b. concatenate all 3 strings but insert "**" between them. c. Print each string on a separate line d. print string s2 and s3 on the same line.

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

The expressions string[0] and string[:1] are the same. Select one: True False
can you help me with this questin because I don't understand it and I am having trouble with this can you do this step. by step and explain it in great detail and can you do something visual to help me understand it better. question:1.40 Recall that string x is a prefix of string y if a string z exists where xz = y, and that x is a proper prefix of y if in addition x 6= y. In each of the following parts, we define an operation on a language A. Show that the class of regular languages is closed under that operation. b. NOEXTEND(A) = {w ∈ A| w is not the proper prefix of any string in A}
I NEED HELP AT THIS QUESTION . Please solve accurately and carefully.
Need help with example 10 please and thank you
Under all code in check.
Program 1: Find whether two given strings are permutations of each other Write a program to find whether two given strings are permutations of each other. A string str1 is a permutation of str2 if all the characters in str1 appear the same number of times in str2 and str2 is of the same length as str1. Input: Two strings S1 and S2Output:yes - if they satisfy given criteriano - otherwise Constraints:1 <= len(S1), len(S2) <= 100.Characters from ASCII range 0 to 127.White space will not be given in the string.
2- Write a program to enter(15) numbers by using inputbox function and then find the average of positive numbers and the summation of negative numbers, print the results in textboxes.
18. Which of the following are not regular?(A) Strings of even number of a’s.(B) Strings of a’s, whose length is a prime number.(C) Set of all palindromes made up of a’s and b’s.(D) Strings of a’s whose length is a perfect square. a. (A) and (B) only b. (A), (B) and (C) only c. (B), (C) and (D) only d. (B) and (D) only