If a bit string contains {0, 1} only, having length 5 has no more than 2 ones in it. Then how many such bit strings are possible?
(a) 14
(b) 12
(c) 15
(d) 16
This question was addressed to me by my school principal while I was bunking the class.
This interesting question is from Logic and Bit Operations in section The Foundation: Logics and Proofs of Discrete Mathematics