recategorized by
584 views
1 votes
1 votes

In a sorted file structure, let the cost of reading a page be $D=10$ milliseconds, the number of data pages be $B=1024$. Let the average time to process a record is $C=5$ milliseconds. Let the number of records per page be $R=16$. Find the time taken to perform a search with equality selection?

  1. $10$ milliseconds
  2. $120$ milliseconds
  3. $5$ milliseconds
  4. $50$ milliseconds
recategorized by

1 Answer

1 votes
1 votes
The time taken to perform a search with equality selection on a sorted file structure is:$ D \log_2^B +C \log_2^R$
Applying the given values into this formula, we get $120$ milliseconds.
Answer:

Related questions

1 votes
1 votes
1 answer
3
Applied Course asked Jan 16, 2019
504 views
Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed _____...