The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 406 Weeks Ago, 1 Day Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
Problem:
5. Construct a B-tree for the file on 9 cylinders of the disk. The highest key values on
the 9 cvlinders are:
cylinder 1:1234
cylinder 2: 2345
cylinder 3: 3456
cylinder 4: 4567
cylinder 5: 5678
cylinder 6: 6789
cylinder 7: 7890
cylinder 8: 8991
cylinder 9: 9992
a) Each index record has 4 key-value-pointer pairs, and the number of index records at the lowest level of the tree is the minimum.
b) Each index record has 2 key-value-pointer paks, and the number of index records at the lowest level of the tree is the minimum.
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll