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

We wish to cover a chessboard with dominoes,ロロ the number of black squares and the number of white squares covered by dominoes, respectively, placing a domino can be modeled by

(a)

b:= b + 2

(b)

w:= w + 2

(c)

b, w := b + 1, w + 1

(d)

b:= w

If m x a + n x b is an invariant for the assignment a, b: = a + 8, b + 7, the values of m and n are

(a)

m = 8, n = 7

(b)

m = 7, n = -8

(c)

m = 7, n = 8

(d)

m = 8, n = -7

Which of the following is not an invariant of the assignment? m, n := m+2, n+3

(a)

m mod 2

(b)

n mod 3

(c)

3 x m - 2 x n

(d)

2 x m - 3 x n

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