Answer:
?
Explanation:
We have a set of wildcard characters. And they are the? and *. We use * for multiple characters, and ? for the single character. / is used for an escape sequence. like if we want to use it? as a symbol and not as wildcard characters, then we will make use of the /. And suppose we want to find all the words that are of type ?ard like the card and hard, then we will make use of ? which means that place can be replaced by one character.
Answer:
Option C is the correct answer for the above question.
Explanation:
A system flowchart is a picture form of all the processes of the system or software for which this flowchart is designed. It is used for the detailed design of the input, process, and output of the system. The above question asked about the type of flowchart which is used to tell the relationship between output, processing, and input of the system, which is the system flowchart which is described above. Hence the answer is option c while the other is not correct because--
- Option 'a' states about an internal control flowchart, which is not the type of the flowchart.
- Option b states about a document flowchart, which is used to describe the document flow.
- Option d states about a program flowchart, which is used to describe the flow of the program.
Answer : Monitor may be in sleep/hibernate mode.
Answer:
lst = []
n = int(input("Input an array size for you words array: "))
print("Now please enter " + str(n) + " words")
max = 0
min = 1000
index_min = 0
index_max = 0
for i in range(n):
s = input("Input a word: ")
lst.append(s)
if len(s) >= max:
max = len(s)
index_max = i
if len(s) <= min:
min = len(s)
index_min = i
print("The longest word is :" + lst[index_max])
print("The shortest word is :" + lst[index_min])
Explanation:
Create an empty list, lst
Get the size from the user
Create a for loop that iterates "size" times
Inside the loop, get the strings from the user and put them in the lst. Find the longest and shortest strings and their indices using if structure.
When the loop is done, print the longest and shortest
