Answer:
1. save and save as
2. save as
3. save as
4.save as
5. save and save as
Explanation:
just took did the question
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.
Answer:
def recursive_func():
x = input("Are we there yet?")
if x.casefold() == 'Yes'.casefold():
return
else:
recursive_func()
recursive_func()
Explanation:
We define the required function as recursive_func().
The first line takes user input. The user input is stored in variable x.
The next line compares the user input to a string yes. The function executes the else block if the condition isn't met, that is a recursive call is executed.
IF condition returns the function. The string in variable X is compared to a string 'Yes'. the casefold() is a string function that ignores the upper/lower cases when comparing two strings. (This is important because a string 'yes' is not the same yes a string 'Yes' or 'YES'. Two equal strings means their cases and length should match).
In computers we use: decimal constantly, hexadecimal daily, octal weekly and binary monthly. Decimal is base 10, hexadecimal is base 16, octal is base 8 and binary is base 2.
To convert binary to decimal, simply add the magnitudes of the digits that are set.
The answer is (a) Intake, Compression, Power, Exhaust.
The fourth-stroke engine cycle or the commonly known as the four cycle is a type of engine that completes four separate strokes while turning a crankshaft. First is the Intake where the piston begins at TDC. Second is the compression where it begins at BDC and the piston compresses the air-fuel mixture for ignition. Third is combustion where the second revolution of the cycle starts. Last is the exhaust where the piston once again returns to TDC from BDC.
