Recurrence Relations Flashcards

1
Q

Consider the solution of given recurrence relation an + 7an–1 + 10an–2 = 0 where a0 = 2 & a1 = 3 by second order linear homogenous recurrence relations:

A

an = 13/3 (-2)^n + -7/5 (-5)^n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the general form of first order recurrence relation?

A

xn = cxn–1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

The relation defined as Xn+1 = Xn + Xn–1 is named as .

A

Fibonacci numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which among the following is a recurrence relation that defines the nth term in terms of the previous two terms?

A

Second order recurrence relation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Which among the following is an equation that characterises a sequence based on a principle that gives the next term as a relation with previous terms?

A

Recurrence relation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Classify the following as first order linear recurrence relation:

A

xn = 5xn–1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

he recurrence relation of the form Xan + Yan–1 + Zan–2 = 0 where X, Y & Z are

A

Real

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Consider the solution of following equation by characteristic root method: xn = 3xn–1, x0 = 1

A

xn = 1.3n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Determine the recurrence relation for the following function by iteration method: xn = 4xn–1, x0 = .2

A

xn = 4xn–1 = 4n-1.2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How many methods are used to solve a first order recurrence relation?

A

2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly