Question 1 N. yet .nswed Marked out of s oo t• Flag question The Dictionary ADT can be implemented by means of an unsorted sequence. Denoting the size of a dictionary by n , which of the following staterni remove in such an implementation?
Select one: A- get : 0(n)• Put constant remove • 0,n) B. Each of these operations takes 0(n log n)tune. C. get – constant, put – 00). remove – 00) D. Each of these operations takes constant time. 0 E. Each of these operations takes 0(n) tirne.
Clear my choice
Question 2 Not yet answered Marked ou, of 5 00 Flag question
Which of the following Is one of the advantages of the asymptotic running-time analysis of algorithms?
Select one: A. not necessary to give precise descriptions of algorithms.
B. Such analysis can be used to identify errors in algorithms. C. It is a sufficient to implement only two algorithms and compare them. D. Such analysis is independent of a programming language. O. Such analysis gives the actual running times of the algorithm for all sizes of input.
