1.

How many bit strings of length 4 do not have two conseqtive 0s?​

Answer»

Answer:

Then COUNT the number of STRINGS that don't have any x. That'll be 254 SINCE each of the LETTERS can be any of 25 possibilities. A string will have at least one x if it's one of the 264 strings of length 4, but not one of the 254 strings that don't have an x in them. Thus, the answer is 264 − 254.



Discussion

No Comment Found

Related InterviewSolutions