This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: EEL 4851 Midterm Summer 1999 T, R 8:00 to 9:50 AM NAME_____________________________ SS#_____________________________ 1. (15%, 3% each) Short questions. For each question you must explain your answer. Write neatly. I can not give you credit if I can not read your answer. a. What is the best searching algorithm to use if the list of data is not sorted (random). b. What aspect of the execution time duration does the big-O analysis of an algorithm measure? c. Suppose you wanted an ADT that can insert, remove and search quickly. What is the best ADT that we have covered so far. d. Suppose you wanted an ADT that can insert and remove quickly and are not interested in searching. What is the best ADT that we have covered so far. e. Suppose you wanted an ADT that can insert, remove and search quickly (like in part c ) but the platform that you are working on does not support dynamic memory allocation. How can we implement the ADT from (c ) on this platform. implement the ADT from (c ) on this platform....
View Full Document
- Summer '09
- Big O notation, Array data structure, best ADT