String 1. From a given string, print the string in all uppercase if the number of uppercase letters is more than lowercase letters. Otherwise, if lowercase is greater or equal to uppercase letters, print all lowercase. The inputs will contain letters (A-Z, a-z) only. Sample Input Sample Output HOUSE HOUSE ApplE apple BaNaNa banana 2. Given a string, print whether it is a number, word or mixed with digit and letters. If all the characters are numeric values, print NUMBER. If they are all letters, print WORD. If it is mixed, print MIXED. Sample Input Sample Output 213213 NUMBER jhg231j213 MIXED Hello WORD 3. In a given string, there will be two uppercase letters in between some lowercase letters. Print the substring from the first uppercase letter to the last uppercase letter excluding them. If there are no letters in between them, print the word BLANK. It is guaranteed that there will be only two uppercase letters in the string. Sample Input baNgladEsh Sample Output glad coDIng BLANK

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...
icon
Related questions
Question
String
1. From a given string, print the string in all uppercase if the number of uppercase
letters is more than lowercase letters. Otherwise, if lowercase is greater or equal
to uppercase letters, print all lowercase. The inputs will contain letters (A-Z, a-z)
only.
Sample Input
Sample Output
HOusE
HOUSE
АpplE
apple
BaNaNa
banana
2. Given a string, print whether it is a number, word or mixed with digit and letters.
If all the characters are numeric values, print NUMBER. If they are all letters, print
WORD. If it is mixed, print MIXED.
Sample Input
Sample Output
213213
NUMBER
jhg231j213
ΜΙXED
Hello
WORD
3. In a given string, there will be two uppercase letters in between some lowercase
letters. Print the substring from the first uppercase letter to the last uppercase letter
excluding them. If there are no letters in between them, print the word BLANK. It
is guaranteed that there will be only two uppercase letters in the string.
Sample Input
baNgladEsh
coDIng
Sample Output
glad
BLANK
Transcribed Image Text:String 1. From a given string, print the string in all uppercase if the number of uppercase letters is more than lowercase letters. Otherwise, if lowercase is greater or equal to uppercase letters, print all lowercase. The inputs will contain letters (A-Z, a-z) only. Sample Input Sample Output HOusE HOUSE АpplE apple BaNaNa banana 2. Given a string, print whether it is a number, word or mixed with digit and letters. If all the characters are numeric values, print NUMBER. If they are all letters, print WORD. If it is mixed, print MIXED. Sample Input Sample Output 213213 NUMBER jhg231j213 ΜΙXED Hello WORD 3. In a given string, there will be two uppercase letters in between some lowercase letters. Print the substring from the first uppercase letter to the last uppercase letter excluding them. If there are no letters in between them, print the word BLANK. It is guaranteed that there will be only two uppercase letters in the string. Sample Input baNgladEsh coDIng Sample Output glad BLANK
4. Write a Python program to find the first appearance of the substring 'too' and
'good' from a given string. If 'good' follows the 'too', replace the whole 'too" good'
substring with 'excellent' and print the resulting string. If the above does not
appear, print the string as it is.
Sample Input
The book is not too good!
Sample Output
The book is not excellent!
This book is good too!
This book is good too!
5. Create a string from two given strings by concatenating common characters of
the given strings.
Sample Input
harry, hermione
Sample Output
hrrhr
dean, tom
Nothing in common.
Transcribed Image Text:4. Write a Python program to find the first appearance of the substring 'too' and 'good' from a given string. If 'good' follows the 'too', replace the whole 'too" good' substring with 'excellent' and print the resulting string. If the above does not appear, print the string as it is. Sample Input The book is not too good! Sample Output The book is not excellent! This book is good too! This book is good too! 5. Create a string from two given strings by concatenating common characters of the given strings. Sample Input harry, hermione Sample Output hrrhr dean, tom Nothing in common.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY