Prof Ahtrap thinks of an n-bit boolean string in mind which is called the magic cipher....

 

Transcribed Image Text:

Prof Ahtrap thinks of an n-bit boolean string in mind which is called the magic cipher. Your objective is to discover the magic cipher by posing questions to him. You can question him in only one way: You can provide him with an n-bit Boolean string of your choice, and he will respond with how many bits in your question coincide with the corresponding bits in the magic cipher. Example: If magic cipher is '10101' and you question with '01100', he would respond with 2 (as 3rd and 4th bit position are matching). Prof Ahtrap is also on a time crunch and you 3 and 4th cannot ask him more than n questions. 232A) For the above game, devise & explain an magic cipher B) minimum Finding her in no more than in questions. 52.4 - algorithm that can identify any interactable problem? 2 26.5.24-20 algorithm 2012 time cri of questions needed for an arbitrary n is tractable or [4M+1M=5M] or02 Prof Ahtrap thinks of an n-bit boolean string in mind which is called the magic cipher. Your objective is to discover the magic cipher by posing questions to him. You can question him in only one way: You can provide him with an n-bit Boolean string of your choice, and he will respond with how many bits in your question coincide with the corresponding bits in the magic cipher. Example: If magic cipher is '10101' and you question with '01100', he would respond with 2 (as 3rd and 4th bit position are matching). Prof Ahtrap is also on a time crunch and you 3 and 4th cannot ask him more than n questions. 232A) For the above game, devise & explain an magic cipher B) minimum Finding her in no more than in questions. 52.4 - algorithm that can identify any interactable problem? 2 26.5.24-20 algorithm 2012 time cri of questions needed for an arbitrary n is tractable or [4M+1M=5M] or02