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:
Capture Data, Refine the Model, and then Manufacture it.
Explanation:
Answer:
Using python programming language.
Explanation:
#to define the function write as below
def equal():
#to get the two integers from the user
#The user is asked for input in the code below.
x = int(input("Enter the value for X"))
y= int(input("Enter the value for y"))
if x==0 and y==0:
print("both numbers are ", "0")
elif: x==1 and y==1: #This test if both x and y are 1
print("true")
elif: x==y: #this line test if both values are equal
print("true")
else:
print("False")
equal() #end of the function
