Answer:
"cost, schedule, technical, and organizational feasibility schedule" is the correct option.
Explanation:
A technical feasibility is the study of the concerned about the specifying software and tools which satisfy the users' need. It is also the process of thinking for which business technologies are important to bring labours, transportation, and materials.
An organizational feasibility is the study of the information of the professional background and about the skills which are necessary for the contribution in the business.
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
Answer:
word = str("Enter a word: ")
if "mold" in word:
print("Mold is in the variable word.")
else:
print("Mold is not in the variable word.")
