Answer:
Here is the Python program:
#the method acronym that takes an argument phrase
def acronym(phrases):
acronym = "" #to store acronym of a phrase
#loop to split the input phrase and return its acronym in upper case letters
for phrase in phrases.split():
acronym = acronym + phrase[0].upper()
return acronym
#main function that takes input phrase from user and display its acronym
def main():
phrases = input("Enter a phrase: ")
print("The acronym for your phrase is ",acronym(phrases))
main()
Explanation:
First let me explain the method acronym. This method takes a parameter phrase to return its corresponding acronym. First the phrase is split using split() method which is used to return the list of words in a phrase. For loop is used that will keep splitting the words in the string (phrase) entered by the user.
In this statement: acronym = acronym + phrase[0].upper() the acronym is computed. phrase[0] means the first character of each word in the phrase which is found out by the split() method is converted to upper case by using upper() function and then stored in acronym variable. Each time the acronym is found and its first character is converted to upper case and added to the acronym variable.
Then the main() function prompts the user to enter a phrase and then calls the acronym function and passed that phrase as parameter to that function. Then the computed acronym for the phrase is printed on the screen.
Answer:
1. store data and software programs that can be used by client computers on the network.
Explanation:
Answer:
Option (D) i.e., s1.getClassRank( ); is the correct option to the following question.
Explanation:
Here, in the following option, the object "S1" is the object of the class "rank" and "getClassRank( )" is the function of that class "rank". so, in the following code the function "getClassRank( )" is called through the class object which computes and returns the class rank of the students.
So, that's why the following option is the correct way to call the function.
Answer:
a. True
Explanation:
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list.