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 .
The manager has provided the following requirements <u>Password cracker: </u>
E. Password cracker
<u>Explanation:</u>
MITM is used to protect from hackers where they can hack the web site and misused the data. Basically man is in middle that monitors the network traffics between to tcpip and address and login as unauthorized person.
As RFP is a bidding process for purchase new product or new platform with complete document in details.
End user has to take care of hackers attack and make sure it is protected with all security holes.
Fuzzer is tool where send user data and check the security vulnerabilities and make sure it is protected.
It is not considered as high accuracy.
