Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
A vertical group of cells are called (C) column
Answer:
Post-mortem.
Explanation:
It refer to the discussion or analysis of event like here disaster why it doesn't work like plan based and through whole discussions what we learn so in future avoid such type of issue or mistakes.
Answer:
c. Type 1 hypervisor installed directly on server hardware.
Explanation:
The customer plans to replace the old network services to ensure that the operation and service of the company is fast and up-to-date. The old servers will slow down the activities of the company and can also affect the overall company's output. The best option is to use and type 1 hypervisor and it should be installed on the server hardware directly.
number = float(input("Enter a number: "))
if number >= 0:
print(number**0.5)
I hope this helps!
