In olden days, one could encounter the following attraction at a fair. A light b
ID: 3571207 • Letter: I
Question
In olden days, one could encounter the following attraction at a fair. A light bulb was connected to several switches in such a way that it lighted up only when all the switches were closed. Each switch was controlled by a push button; pressing the button toggled the switch, but there was no 1 way to know the state of the switch. The object was to turn the light bulb on. Design an algorithm to turn on the light bulb with the minimum number of button pushes needed in the worst case for n switches
Explanation / Answer
Now to solve this problem we consider Even and Odd concept .i.e., first even number switches will be checked then odd number switches. Since it needs an alogrithm at the worst case where all the buttons are open at the first then we will apply the below algorithm to complete the process of switching on the bulb....
Algorithm:
If in the case of switches open at random number we cannot consider the above algorithm in that situation we need to follow few more rules....
By using the above defined steps we are able to switch on the bulb in minimum number of button pushes....
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.