361 views
0 votes
0 votes
Suppose a phone book contain 500 pages and each page can contain upto 500 records. Suppose we want to search for a particular name in a phone book. Give a worst case bound on  number of pages that must be looked to perform a search using an index for the name of the first entry of each page.

1 Answer

0 votes
0 votes
It will be 2 as the page containing the index have 500 entries this is selected to get the page reference, and one for the page to get the data.

Related questions

0 votes
0 votes
1 answer
1
Bishnu Agrawal asked Sep 20, 2015
1,387 views
Hello,If i have to insert an element after checking it's not in tree into binary heap then what would be the procedure ?What i know is heap is an abstract type which mean...
2 votes
2 votes
1 answer
3
radha gogia asked Jul 14, 2015
5,531 views
1. 2, 252, 401, 398, 330, 344, 350, 3602. 924, 220, 911, 244, 898, 258, 362, 3603. 925, 202, 911, 240, 950, 245, 3604. 2, 399, 387, 219, 266, 382, 381, 278, 360