A loop invariant need not be true

(a)

at the start of the loop

(b)

at the start of each iteration

(c)

at the end of each iteration

(d)

at the start of the algorithm

If Fibonacci number is defined recursively as
\(F(n)= \begin{cases}0 \ \mathrm{n}=0 \\ 1 \ \mathrm{n}=1 \\ \mathrm{~F}(\mathrm{n}-1)+\mathrm{F}(\mathrm{n}-2) \text { otherwise }\end{cases}\)
to evaluate F(4), how many times F() is applied?

(a)

3

(b)

4

(c)

8

(d)

9

Which of the following algorithm design techniques to execute the same action repeatedly?

(a)

Assignment

(b)

Iteration

(c)

Recursion

(d)

Both b and c

Which of the following is updated when each time the loop body is executed?

(a)

Data

(b)

Variables

(c)

Function

(d)

All of these

How many cases are there a recursive solver has_______.

(a)

2

(b)

3

(c)

4

(d)

many

How many important points the loop variant is true?

(a)

1

(b)

2

(c)

3

(d)

4

___________is an algorithm design technique, closely related to induction.

(a)

Iteration

(b)

Invariant

(c)

Loop invariant

(d)

Recursion

In a loop, if L is an invariant of the loop body B, then L is known as a __________

(a)

recursion

(b)

variant

(c)

loop invariant

(d)

algorithm

The loop invariant need not be true at the __________.

(a)

Start of the loop

(b)

end of the loop

(c)

end of each iteration

(d)

middle of algorithm

The input size to a sub problem is __________ than the input size to the original problem.

(a)

equal

(b)

smaller

(c)

greater

(d)

no criteria