00:01
Hello student, here a room has the n computer less than half of which are damaging, others are good.
00:06
So, it is possible to query a computer about the status of any computer.
00:11
A damaged computer could give the wrong answer.
00:14
The goal is to discover a good computer in as few queries as possible.
00:20
So here is a randomized algorithm to discover a good computer in a room with an n computer less than half of which are damaged as few queries as possible.
00:32
So, as few queries as possible.
00:38
So here now, number one, pick a computer at the random.
00:43
So now pick the computer randomly.
00:45
Number two, ask the computer whether it is a good.
00:48
So this is the second step.
00:49
Number third step, if the computer says it is a good, then we are done because we are only interested in the good one.
00:55
Fourth, otherwise, ask the computer to pick another computer at random and ask that computer whether it is a good.
01:06
So now this is the fourth step...