Suppose the inventory is unordered (!) and a sequential search is done to locate a specific artifact. Given that the search is executed on a computer that can do 12,000 comparisons per second, about how much time on the average would the search require? Assuming the inventory is sorted, about how much time would a binary search require?

Question

24-02-2020
Computers and Technology

contestada

Suppose the inventory is unordered (!) and a sequential search is done to locate a specific artifact. Given that the search is executed on a computer that can do 12,000 comparisons per second, about how much time on the average would the search require? Assuming the inventory is sorted, about how much time would a binary search require?

Respuesta :

Otras preguntas

Which sentence uses a verb that agrees with its pronoun subject? a. One of the assistants in the shop don't work very hard. b. Many of the monster in Ezra's dra

what is 0.08 as a fraction

Speaker A: I do not agree with what you have to say, but I’ll defend to the death your right to say it. Speaker B: Government has no other end, but the

Lena horne died of what

What Questions would you ask Kwame Nkrumah if you could actually talk to him?

In "My Father Is a Simple Man," what do the lines "and we too will come back / like the orange trees" contain? a. alliteration b. an allusion c. onomatopoeia d.

How many women Pharaohs were there through all of Egypt's existence?

Jayden has been asked to wear a protective vest while his dentist takes an X-ray. Why is this?

Francois Jacob and Jacques Monod studied Escherichia coli (E. coli) bacteria by using lab experimentation. What revision to their initial hypothesis did they co

which strategy is a way to determine an author's perspective in a text

problemsolver2019 problemsolver2019 · Answer 1 · 2020-03-01T06:42:14+01:00

Answer:

The computer can do 12000 searches per second. Suppose there are 60000 inventory items. And we need to search one item from it in a sequential manner. The computer can do 12000 searches in one second. Hence it can search in a list of 60000 inventory in 5 seconds, as 12000 x 5 =60000 searches, in the worst case. And if the item is below 12000 on the list, it will take less than 1 second(1/12000 sec in best case), and so on.

And if we assume that the list is sorted, and perform a binary search. then in the worst case, the number of searches required in the worst case will be 60000/2= 30000. And the time required will be 30000/12000= 5/2=2.5 seconds, and (1/24000) seconds in the best case. Its 1/24000 as its binary search.

Explanation:

Please check the answer section.