Suppose the dictionary is randomly ordered. Asymptotically (that is, in
terms of a likely Big-Oh running time), which of the following alterna
tives is the fastest if we assume that no words are longer than ten char
acters?
a. Sort the dictionary, and then use the algorithm in the text
b. Sort the dictionary, but then use interpolation search
c. Place the dictionary items in a binary search tree based map; the prefix test must be performed explicitly
d. Place the dictionary items in a hash table based map; the prefix test must be performed explicitly
e. Use a sequential search of the dictionary
D
You might also like to view...
Private browsing does not store data on
a. the computer itself b. the server c. both the computer itself and the server d. neither the computer itself or the server
What class does the Integer class inherit from?
What will be an ideal response?
The ____ multiprocessing configuration is an asymmetric system.
A. loosely coupled B. master processors C. start/end D. master/slave
Which of the following tools can be used prior to installing Windows Vista to find hardware compatibility issues?
A. Upgrade Advisor B. Window Aero C. Task Manager D. Device Manager