Discussion
A question paper had 10 questions. Each question could only be answered as true(T) of False(F). Each candidate answered all the questions, Yet no two candidates wrote the answers in an identical sequence. How many different sequences of answers are possible?
Answer: D
Each of the ten questions is answered independently as T or F.
\[ 2^{10} = 1024 \]
Since no two candidates matched, at most 1024 candidates could sit the paper. The 512 on offer is \( 2^{9} \), one question short.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development