Unformatted text preview: Question 1 Put the terms, node, ﬁeld and data set in size order from small to large: (page 11-12)
Selected Answer: C. Field, node, data set Question 2 Prooedural abstraction is:
Selected Answer: B. We do not need to know the implementation details of the method in order to use it Question 3 The Binary Search algorithm speed at the worst case is:
Selected Answer: A. O(logzn) Question 4 The following is not true about Binary Search :
Selected Answer: C. Binary Search algorithm can be applied on the unsorted arrays Question 5 Which one is not correct about encapsulation?
Selected Answer: D. Encapsulation provides the code such that all the ﬁelds can be aocus from everywhere outside the class Question 6 There are two Aocus Modes that are used to specify the node to be accused:
Selected Answer: e. a and c Question 7 Algorithm speed will oonsider the following factors:
Selected Answer: D. a and b Question 8 A = 23n + 35n2 B = 6 + nlogz(n) + n c = logzn + 35n2 Which one of the following is oorrect? Select“ Answer: B. TA = 0(n2) T3 = 0(n|092(n)) TC = 0("2) ...
View Full Document
- Spring '16
- Binary Search, English-language films