Answer:
def str_analysis(s):
if s.isdigit():
s = int(s)
if s > 99:
message = str(s) + " is a pretty big number"
else:
message = str(s) + " is a smaller number than expected"
elif s.isalpha():
message = s + " is all alphabetical characters!"
else:
message = "There are multiple character types"
return message;
s = input("enter word or integer: ")
while s != "":
print(str_analysis(s))
s = input("enter word or integer: ")
Explanation:
- Check if the string is digit, alphabetical, or mixed inside the function
- Ask the user for the input
- Call and print the result of the <em>str_analysis</em> function inside the while loop
- Keep asking for the input until the given string is empty
Answer:
Depending on the amount of files there are, the operating system will run slower because these files take up space on the hard drive, slowing it down.
Explanation:
Answer:
1. A high level algorithm for cooking a cheeseburger could be:
- Heat fry pan
- Cook one side of the hamburger
- Wait
- Turn hamburger upside down
- Put cheese over hamburger
- Wait
- Cut hamburger bread in half
- Put cooked hamburger inside bread
- End (eat)
2. A detailed algorithm for cooking a cheeseburger could be:
- Place fry pan over the stove heater
- Turn on heater (max temp)
- IF fry pan not hot: wait, else continue
- Place raw hamburger on fry pan
- IF hamburger not half cooked: Wait X time then go to line 5, else continue
- Turn hamburger upside down
- Put N slices of cheese over hamburger
- IF hamburger not fully cooked: Wait X time then go to line 8, else continue
- Turn off heater
- Cut hamburger bread in half horizontally
- Put cooked hamburger on one of the bread halves.
- Put second bread half on top of hamburger
- End (eat)
Explanation:
An algorithm is simply a list of steps to perform a defined action.
On 1, we described the most relevant steps to cook a simple cheeseburger.
Then on point 2, the same steps were taken and expanded with more detailed steps and conditions required to continue executing the following steps.
In computational terms, we used pseudo-code for the algorithm, since this is a list of actions not specific to any programming language.
Also we can say this is a structured programming example due to the sequential nature of the cooking process.
Answer:
From the given diagram, consider a MIN node whose children are terminal nodes, if MIN plays
suboptimal. MIN will never be lower than the utility obtained playing against an optimal MIN
MIN will always select a move having minimax utility greater than or equal to the move that is
predicted by the minimax that is the MIN-played optimal value.
Then the MIN node's value is increased to MAX. This is done by induction.
One can do better than the minimax strategy, if the suboptimal play is predicted by MIN.
If MIN always falls for certain for certain kind of trap and losses, then setting up a trap guarantees a win.
Explanation:
See attached picture also.
