The number of ways in which a TRUE or FALSE examination of $n$ statements can be answered on the asumption that no two consecutive questions are answered in the same way is

2^{n - 1}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

2^{n}

No worries! We‘ve got your back. Try BYJU‘S free classes today!

1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

2

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is A $2$
There will be only $2$ ways by which we can answer $n$ statements in True or False taking into account no two consecutive answer is same.
1) $T, F, T, F, T . . . . . . .$
2) $F, T, F, T, F . . . . . . . . . . . .$

Suggest Corrections

Similar questions

Q. There are

10

true-false questions is an examination. The number of ways in which these questions can answered is given by

Q. There are

10

true-false questions. The number of ways in which they can be answered is

Q. There are

8

true/false questions in an examination.The number of ways in which this questions can be answered, is

Q. In an examination, a student has to answer

4

questions out of

5

questions; Questions

1

and

2

are however compulsory. The number of ways in which the student can make a choice is :

In an examination, a student has to answer 4 questions out of 5 questions ; questions 1 and 2 are however compulsory, Determine the number of ways in which the student can make the choice.

Join BYJU'S Learning Program

The number of ways in which a TRUE or FALSE examination of n statements can be answered on the asumption that no two consecutive questions are answered in the same way is

The correct option is A 2There will be only 2 ways by which we can answer n statements in True or False taking into account no two consecutive answer is same.1) T,F,T,F,T.......2) F,T,F,T,F............

The number of ways in which a TRUE or FALSE examination of $n$ statements can be answered on the asumption that no two consecutive questions are answered in the same way is

The correct option is A $2$
There will be only $2$ ways by which we can answer $n$ statements in True or False taking into account no two consecutive answer is same.
1) $T, F, T, F, T . . . . . . .$
2) $F, T, F, T, F . . . . . . . . . . . .$