Subject: Discrete Mathematics and its Application

True or false questions and two multiple choice questions.

a. A greedy algorithm considers only its current choices, rather than looking at the bigger picture or goal. (t/f)

b. f(x) = 2x2+ 2x + 1 can be said to be O(n2). (t/f)

c. Is the following program segment correct with respect to the initial assertion y = 5 and the final assertion z = 7?

x := 2

z := x + y

if y > 0 then

z := z + 1

else

z := 0

1) The diagram below depicts the result of which of the following operations?

A C