Answer:
Hello
Explanation:
Hello profile picture of a nub how are you doing today?
Answer:
Explanation:
The following Python code asks the user for inputs for the name to remove and add in the set. It then tries to remove the given name from the list. If it fails it prints out to the user saying that the name does not exist. If it does exist then it removes the name and adds the new name. Finally it prints out the current list of names.
male_names = {'oliver', 'Declan', 'Henry'}
name_to_remove = input("Enter name to remove: ")
name_to_add = input("Enter name to add: ")
try:
male_names.remove(name_to_remove)
male_names.add(name_to_add)
except:
print("Name that you are trying to remove does not exist")
print("List of Names: ")
print(male_names)
Answer:
One of them is OnClick, but there are more.
Explanation:
I took my post test and only clicked OnClick and I missed this one and it says "not all correct answers chosen"
Answer:
b) The elevator prioritizes the requests that are on the way where it’s going, but also based on a first come first served principle.
Explanation:
Elevator routing often looks complex, as the elevator has to decide whether to go to the person who has waited the longest or the one who is closest? There are also issues of how long should the rider spend.
A simple algorithm can be designed where the elevator prioritizes the requests that are on the way where it’s going, but also based on a first come first served principle. Once it exhausts the request in its current direction, it then switches directions if there are requests in that direction. This way the elevator is able to tackle the complex issue based on the simple algorithm.