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? $10$ milliseconds $120$ milliseconds $5$ milliseconds $50$ milliseconds Algorithms applied-course-2019-mock1 algorithms searching + – Applied Course asked Jan 16, 2019 recategorized Jul 4, 2022 by Lakshman Bhaiya Applied Course 584 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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. Applied Course answered Jan 16, 2019 Applied Course comment Share Follow See all 0 reply Please log in or register to add a comment.