Scribd
Upload
3 views2 pages

Quiz 07

The document contains a series of multiple-choice questions (MCQs) related to recurrence relations in mathematics. It includes questions about methods for solving first-order recurrence relations, characterizing sequences, and specific examples of recurrence relations. The responses provided indicate correct answers for most questions, with a few incorrect responses noted.

Uploaded by

JINESH VARIA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Quiz 07

The document contains a series of multiple-choice questions (MCQs) related to recurrence relations in mathematics. It includes questions about methods for solving first-order recurrence relations, characterizing sequences, and specific examples of recurrence relations. The responses provided indicate correct answers for most questions, with a few incorrect responses noted.

Uploaded by

JINESH VARIA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Home

1. Mathematical Foundation for Computer Application (B)


Recurrence Relations

Unit7 :Practice Multiple Choice Questions (MCQs)


Submissions
Here are your latest answers:

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

Response: 2

Correct answer: 2

Score: 1 out of 1 Yes

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

Response: Real

Correct answer: Real

Score: 1 out of 1 Yes

Question 3
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:

Response:

Correct answer:

Score: 0 out of 1 No

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

Response: xn = 4xn–1 = 4n-1.2

Correct answer: xn = 4xn–1 = 4n-1.2

Score: 1 out of 1 Yes

Question 5
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?

Response: Recurrence relation

Correct answer: Recurrence relation

Score: 1 out of 1 Yes

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

Response: xn = 1.3n

Correct answer: xn = 1.3n

Score: 1 out of 1 Yes


Question 7
The relation defined as xn+1 = xn + xn–1 is named as .

Response: Fibonacci numbers

Correct answer: Fibonacci numbers

Score: 1 out of 1 Yes

Question 8
Classify the following as first order linear recurrence relation:

Response: xn = 5xn–1

Correct answer: xn = 5xn–1

Score: 1 out of 1 Yes

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

Response: Second order recurrence relation

Correct answer: Second order recurrence relation

Score: 1 out of 1 Yes

Question 10
What is the general form of first order recurrence relation?

Response: xn = cxn–1

Correct answer: xn = cxn–1

Score: 1 out of 1 Yes

You might also like