TCS
Exam
Numerical Ability
Permutation and Combination
In a staircase , there are 10 steps . A child is attempting to climb the staircase. Each time, she can either make 1 or 2 steps. In how many different ways can she climb the staircase?
option
a)10 b)21 c)26 d)None of these
Read Solution (Total 10)
-
- Formula for this 10C1+10C2=10+45 Gives 55 is not in answer option
- 8 years agoHelpfull: Yes(12) No(2)
- She can clim in a+2b=10 ways (a is 1 step and b is taking 2 steps)
So she if she is making 0 1steps den she has take 5 2steps for reaching 10th step den combination is 5c5 =1
Again for (2,4) : 6c4 =15
And for (4,3) : 7c3=35
For (6,2) : 8c2= 28
For (8,1) : 9c1 =9
For (10,0) 10c10=1
So total 1+15+35+28+1 = 89 that is option d) none of these - 8 years agoHelpfull: Yes(7) No(2)
- Use fibonnacci series, with starting two terms as 1, 2. So next terms are 3, 5, 8, 13, 21, 34, 55, 89
- 8 years agoHelpfull: Yes(3) No(0)
- 1, 2, 5,7,9..... this is a Fibonacci series . to consider this series to clime the staircase using 10 steps in no of different ways is not matched to the given 3 option values. ....
hence answer is none of this. - 8 years agoHelpfull: Yes(2) No(4)
- 10C1+10C2=10+45
=55 - 8 years agoHelpfull: Yes(2) No(0)
- d)none of these
- 8 years agoHelpfull: Yes(1) No(2)
- 10C1+10c2=55
- 8 years agoHelpfull: Yes(1) No(0)
- none of these
- 8 years agoHelpfull: Yes(0) No(1)
- c)26 as 1 or 2 steps , there is 10 stairs
so 1 case becomes of 1 step all and 25 cases become acorrding to different 2steps so answer is 26. - 8 years agoHelpfull: Yes(0) No(0)
- In 89 ways she can climb.so answer is None of These...
- 8 years agoHelpfull: Yes(0) No(0)
TCS Other Question