It is to avoid plagiarizing someone else's work
Answer:
count_land = count_air = count_water = 0
while True:
s = input("Enter a string: ")
if s == "xxxxx":
break
else:
if s == "land":
count_land += 1
elif s == "air":
count_air += 1
elif s == "water":
count_water += 1
print("land: " + str(count_land))
print("air: " + str(count_air))
print("water: " + str(count_water))
Explanation:
*The code is in Python
Initialize the variables
Create a while loop that iterates until a specific condition is met. Inside the loop, ask the user to enter the string. If it is "xxxxx", stop the loop. Otherwise, check if it is "land", "air", or "water". If it is one of the given strings, increment its counter by 1
When the loop is done, print the number of strings entered in the required format
I would vote for D since you can adjust picture positioning and wrapping. A is BS, B and C are not true.
Answer:
Check below for answers and explanations.
Explanation:
The major reasons why computer processes are suspended or terminated are:
1. When there is insufficient memory for successful completion of the process
2. When there's an unauthorized access of any of the computer resources by the process.
It is possible that some processes are terminated why some are suspended because, when the system runs out of memory, the running processes are put on hold until the system is able to create free memory space for the completion of the process. In this case the process is suspended. But if the system cannot provide enough space for the process, the process is terminated.
In the example provided in this exercise, some of the processes were suspended because the system wants to create free memory space for their completion while others are terminated either because the available space is not sufficient for their completion or they want to access an unauthorized resources on the system.
Answer:
A linear search is one that scans every record/file until it discovers the value being searched for.
Binary search, on the other hand, is also known as <em>Logarithmic search</em>. It is used to locate the position of a value inside an array that has already been sorted.
The linear search will return the lowest value faster than the binary search when small arrays are involved.
This will only be feasible when the array is sorted prior.
Cheers!
