QUESTION 1 = Given two algorithms with growth rate functions:f(N) MogzN +N3 and g(N) = N2log N, the execution time of the algorithm with growth rate g(N) grows faster than that with growth rate f(N). True False QUESTION 2 The tightest upper bound for f(N) = Mog2N+10002 + N is O(MogN). True False QUESTION 3 A stack is a LIFO (Last In, First Out) structure, and items are added and removed only from the top of the stack. True False QUESTION 4 Dos A queue is an abstract data type with the special property that elements are always added at one end (the rear) and are removed from the other end (the front). It is a FIFO (First In, First Out) structure. O True QUESTION 5 We can draw or identify a unique binary tree from an in-order traversal sequence. True False QUESTION 6 If the level of the root of a non-empty binary tree is level O, the level of the root's children is level 1, etc., the maximum number of nodes on level jis 21+1 -1. True False QUESTION 7 A non-empty binary tree has N nodes, the possible minimal height of the binary tree is floor(log2N)- True False QUESTION 8 A complete binary tree is a binary tree in which each node is either a leaf or has exactly two child nodes. True O False