Register

#self doubt

473 views

1 Answer

1 votes
1 votes

For this question u can use this formula

In S(h) = S(h-1) + S(h-2) + 1,

S(h) is a recursive function/formula. 

Note that a recursive function must have some base cases, in this case:

S(0) = 1
S(1) = 2

So let's say h = 10, then S(h = 10)

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
himgta asked Sep 11, 2018
266 views
#Self doubt
User Avatar
0 votes
0 votes
0 answers
2
Shubham Aggarwal asked Aug 30, 2018
253 views
#self doubt
1) How many stacks are needed to implement a queue . 2) How many queue are needed to implement a stack.
1) How many stacks are needed to implement a queue .2) How many queue are needed to implement a stack.
User Avatar
0 votes
0 votes
0 answers
3
Çșȇ ʛấẗẻ asked Feb 16
322 views
#Self doubt COA
User Avatar
0 votes
0 votes
0 answers
4
Dknights asked Feb 6
134 views
#self doubt
Can someone please verify it ? isn't should be 8. https://www.toppr.com/ask/question/the-cardinality-of-the-power-set-of-left-phi-left-phiright-left-phi-left/ Let S={ϕ,{ϕ},{ϕ,{ϕ}}} P(s)= Power Set of set S P(s)={ϕ,{ϕ},{ϕ,{ϕ}},{ϕ,{ϕ,{ϕ}}},{{ϕ},{ϕ,{ϕ}}},{ϕ,{ϕ},{ϕ,{ϕ}}}} n(P(s))=6.
Can someone please verify it ? isn't should be 8. https://www.toppr.com/ask/question/the-cardinality-of-the-power-set-of-left-phi-left-phiright-left-phi-left/Let S={ϕ,{�...
User Avatar
Link Copied!