एक सुरक्षित कोड में (6) द्विआधारी स्थान हैं। कोई भी तीन लगातार स्थान (1) नहीं हो सकते। कुल कितने कोड बनेंगे?
A secure code has (6) binary positions. No three consecutive positions can be (1). How many codes are possible?
Explanation opens after your attempt
Correct Answer
B. (44)
Concept
Subtract the cases containing three consecutive (1)'s from total \(2^6\) by organized counting. For short strings, position-based counting is reliable.
Why this answer is correct
The correct answer is B. (44). Subtract the cases containing three consecutive (1)'s from total \(2^6\) by organized counting. For short strings, position-based counting is reliable.
Exam Tip
कुल \(2^6\) से लगातार तीन (1) वाले मामलों को व्यवस्थित गिनकर घटाएँ। छोटे अनुक्रमों में स्थिति आधारित गिनती सुरक्षित रहती है।
Login to save your score, XP, coins and progress.