Answer:
c) it will always return with an answer of 7 or fewer comparisons of data.
Explanation:
As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.
A, because if not, there is nothing to say it exsists
Answer:
Explanation:
The code does not fail on the first step since 1900 divided by 4 is actually 475 and has no remainder, meaning that it should return True. The code won't work because the if statements need to be nested in a different format. The correct algorithm would be the following, which can also be seen in the picture attached below that if we input 1900 it would output is not a leap year as it fails on the division by 400 which gives a remainder of 0.75
input_year = int(input())
if input_year % 4 == 0:
if input_year % 100 == 0:
if input_year % 400 == 0:
print(input_year, "is a leap year")
else:
print(input_year, "- not a leap year")
else:
print(input_year, "is a leap year")
else:
print(input_year, "- not a leap year")
Opportunity cost is what you give up to do something else. Since she decided to play softball after school, she cannot work so the answer is B
Answer:
Trace topology is also referred to as tree bus topology.
Explanation: