[F5-FORMATIVE] Fifth Formative Assessment

From the given array for merge sort use the Divide-and-Conquer method : 2,1,4,7,6,3

Group of answer choices

123674

132476

123467

No Answer

123467

The term about the subproblems by solving them recursively. If they are small enough, solve the subproblems as base cases.

Group of answer choices

No Answer

Conquer

Divide

Combine

Conquer

In solving recurrence, the recurrence relation Pn = (1.05)Pn-1is a linear homogeneous recurrence relation of degree one.

Group of answer choices

Invalid

Valid

Valid

The initial conditions give the first term(s) of the sequence, before the recurrence part can take over.

Group of answer choices

Invalid

Valid

Valid

From the given array for merge sort use the Divide-and-Conquer method : from the first strep:Divide the array into two parts: 8,5,6,2,4,3

Group of answer choices

No Answer

856 342

856 234

856 243

856 342

This technique is called _______________. It can use recurrence relations to analyze the complexity of such algorithms.

Group of answer choices

Divide and Conquer

No Answer

Combine

Recurrence

Divide and Conquer

The recurrence relation an = an-5 is a linear homogeneous recurrence relation of degree five.

Group of answer choices

Invalid

Valid

Valid

The recurrence relation an = an-5 is a linear homogeneous recurrence relation of degree four.

Group of answer choices

Valid

Invalid

Invalid

In Divide and Conquer, the algorithm divides a problem (input) of size n into a subproblems, where each subproblem is of size n/b.

Group of answer choices

Invalid

Valid

Valid

Find a recurrence relation and initial conditions for 4,6,8,10 and so on.

a. an=an-1 + 3 c. an=an-1 * 3

b. an=an-21 + 3 d. none of the above

Group of answer choices

B

C

D

A

D

The formula f(n) = f (n/5) + 5n2. The positive value by 5, and note f(1) = 8. Find the value of f(5).

Group of answer choices

135

144

133

No Answer

133

The divide and conquer is an algorithm design paradigm based on one branched recursion.

Group of answer choices

Invalid

Valid

Invalid

In conquer the subproblems by solving them recursively. If they are small enough, do not solve the subproblems as base cases.

Group of answer choices

Valid

Invalid

Invalid

The term about the subproblems by solving them recursively. If they are small enough, solve the subproblems as base cases.

Group of answer choices

Combine

Conquer

Divide

No Answer

Conquer

The _________________in programming breaks a problem into subproblems that are similar to the original problem.

Group of answer choices

Combine

Divide and Conquer

No Answer

Conquer

Divide and Conquer

From the following method below, which method was used in parting the value from the method?

Group of answer choices

Merging

Selecting

Partition

No Answer

Partition

The binary search algorithm recursively divides the input into two halves and eliminates the irrelevant half until only one relevant element remained.

Group of answer choices

Valid

Invalid

Valid

The divide and conquer algorithm allow that two comparisons are needed to perform this reduction.

Group of answer choices

Valid

Invalid

Valid

In divide-and-conquer algorithm it needs the proper balancing steps in solving the algorithm.

Group of answer choices

Valid

Invalid

Valid

The binary search algorithm recursively divides the input into two halves and it will not eliminate the irrelevant half until only one relevant element remained.

Group of answer choices

Valid

Invalid

Invalid

The divide and combine use in programming allows to cut a problem into subproblems that are similar to the original problem.

Group of answer choices

Valid

Invalid

Invalid

The divide and combine use in programming allows to cut a problem into subproblems that are not similar to the original problem.

Group of answer choices

Invalid

Valid

Invalid

Mr. Castillo invest 120,000 from his savings account and 5% per year with interest compounded annually. How much money will be in the account after 4 years?

Group of answer choices

142,000

No Answer

149,000

145,860.75

145,860.75

Mrs. Villanueva has a loan 30,000 in a bank yielding 5% per year with interest compounded annually. How much money she will pay for her loan after 5 years?

Group of answer choices

38,288.44

No Answer

38,300.44

38,000.55

38,288.44

The recurrence relation fn = fn-1 + fn-2 is a linear homogeneous recurrence relation of degree two.

Group of answer choices

Invalid

Valid

Valid

From the recurrence relation: a1=4, an=5n+a n-1. What is the value of a 32 is _____.

a.10399 c. 10500

b.10400 d. none of the above

Group of answer choices

B

C

A

D

D

A recurrence relation for the sequence {an} is an equation that expresses an is terms of one or more of the previous terms of the sequence.

Group of answer choices

Invalid

Valid

Valid

Mr. Reyes deposits 20,000 in a savings account at a bank yielding 5% per year with interest compounded annually. How much money will be in the account after 3 years?

Group of answer choices

23,152.50

23,500.70

No Answer

23,150.50

23,152.50

The formula that f satisfies the recurrence relation f(n) = af(n/b) + g(n).

This is called a ______________________recurrence relation.

a. greedy algorithm

b. divide and conquer

c. brute force

d. none of the above

Group of answer choices

D

C

A

B

B

In the algorithm of divide and conquer we don't need to divide the problem and then recombine the solution.

Group of answer choices

Invalid

Valid

Invalid

Mrs. Kim went to mall to shop and she use her credit card and total amount is worth 50,000 and 7% per year with interest compounded annually. How much money will be paid in her credit card account after 3 years?

Group of answer choices

62,255.60

No Answer

61,252.15

62,200.15

61,252.15

Mrs. Santiago has a loan 40,000 in a bank yielding 7% per year with interest compounded annually. How much money she will pay for her loan after 5 years?

a. 56,102.06

b.58,288.44

c. 59,600.00

d. none of the above

Group of answer choices

C

B

D

A

A

Some algorithms take a problem and successively divide it into one or more smaller problems until there is a trivial solution to them.

Group of answer choices

Valid

Invalid

Valid

From the given formula f(n) = f (n/5) + 3n2 ,take note that n is a positive of integer divisible by 5, and that f(1) = 4.

Compute for the the value of f(5).

Group of answer choices

79

80

85

No Answer

79

From the given array for merge sort use the Divide-and-Conquer method : 2,1,3,7,6,5

Group of answer choices

132567

No Answer

123675

123567

123567

Mrs. Lim shop at ABC Mall and use her credit card and total amount is worth 50,000 and 20% per year interest compounded annually. How much money will be paid in her credit card account after 2 years?

Group of answer choices

72,000.00

75,000.00

70,000.00

No Answer

72,000.00

A sequence is called a solution of a recurrence relation if its terms satisfy the recurrence relation.

Group of answer choices

Invalid

Valid

Valid

Mr. Tan deposits 10,000 in a savings account at a bank yielding 3% per year with interest compounded annually. How much money will be in the account after 5 years?

a. 11,595.00 c. 11,592.74

b. 11,560.75 d. none of the above

Group of answer choices

C

D

A

B

C

A sequence is not part of the solution of a recurrence relation if its terms satisfy the recurrence relation.

Group of answer choices

Valid

Invalid

Invalid

Find the value of a3 for the recurrence relation: an=2an-1 * 3 with a0=5?

Group of answer choices

No Answer

1080

1400

1600

1080

From the following method below, which method was used in sorting in merge sort?

Group of answer choices

Selecting

Merging

No Answer

Partition

Merging

From the given array for merge sort use the Divide-and-Conquer method : 8,2,6,4,5,1

Group of answer choices

No Answer

124568

124865

142568

124568

From divide and conquer algorithm we need to divide the problem until the element becomes single and sort them by combining the proper way through conquer and combine.

Group of answer choices

Valid

Invalid

Valid

Mrs. Santos has a loan 25,000 in a bank yielding 3% per year with interest compounded annually. How much money she will pay for her loan after 5 years?

Group of answer choices

29.,500.54

27,980.90

28,981.85

No Answer

28,981.85

Find the value of a4 for the recurrence relation: an=2an-1 + 3 with a0 = 6.

Group of answer choices

141

No Answer

150

155

141

Find the value of a2 for the recurrence relation: an =2a n-1 * 5 with a0 =4.

Group of answer choices

400

440

No Answer

200

400

A recurrence order is called a solution of a recurrence relation if its terms satisfy the recurrence relation.

Group of answer choices

Valid

Invalid

Invalid

The divide and conquer is an algorithm design paradigm based on multi-branched recursion.

Group of answer choices

Valid

Invalid

Valid

The term about the problem into a number of subproblems that are smaller instances of the same problem.

Group of answer choices

Divide

Combine

No Answer

Conquer

Conquer