Give an upper bound on the number of pages that must be fetched to perform a binary search for a particular name in the phone book for your city or town.
What will be an ideal response?
If the phone book has 1,000 pages, an upper bound on the number of pages that would have to be fetched is log2 1000= 10.
You might also like to view...
A ________ query is utilized when we want the user to enter the criteria for a specific field each time the query is run
A) foreign B) primary C) parameter D) secondary
Thedata type that can store up to 65,535 characters in each record
a. Short text b. Paragraph c. Long text
Which of the following is not a good strategy for securing a WAP?
A. Use NAT filtering. B. Turn off the SSID. C. Place it in a Faraday cage. D. Use PNAC.
When a module is processed:
a. The computer jumps to the module, executes the instructions in the module, and then quits. b. The computer jumps to the module, executes the instructions in the module, and then returns to the next executable instruction. c. The computer jumps to the module, executes the instructions in the module, and then jumps to another module according to the structure chart. d. The computer ignores the module and returns later to execute the instructions.