Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Algorithm to insert a key in B-tree is as follows:
1. First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into the proper order.
2. If the node can contain the new record, insert the new record at the appropriate pointer so that number of pointers remains one more than the number of records.
3. If the node overflows due to there is an upper bound on the size of a node, splitting is needed. The node is divided into three parts; the middle record is passed upward and inserted into parent, leaving two children behind. If n is odd (n-1 keys in full node and the new target key), median key int(n/2)+1 is placed in parent node, the lower n/2 keys are put in the left leaf and the higher n/2 keys are put in the right leaf. If n is even, we might be have left biased or right biased means one key may be more in left child or right child correspondingly.
4. Splitting may propagate up the tree because the parent, into which divided record is added, may overflow then it may be split. If the root is needed to be split, a new record is formed with just two children.
Q. Illustrate about FAT structure? DOS file system maintains a table of pointers known as FAT (File allocation table) that comprises an array of 16-bit values. There is one ent
What is a Region? A Region is a continuous area of a process's address space (like text, data and stack). The kernel in a "Region Table" that is local to the process mainta
System is a word which is derived from the Greek word 'Systema' which means an organized relationship among components. A System can be defined as orderly grouping of interdepen
Q. Illustration of parallel programming environments? Let's discuss illustrations of parallel programming environments of Intel paragaon XP/S and Cray Y-MP software. The Cra
what is java?
Nyquist''s sampling theorem says "if you have a signal that is perfectly band limited to a bandwidth of f0 then you can collect all the information there is in that signal by sampl
Problem a) Distributed network architecture is whereby services are executed and distributed among various computers. Give two advantages and two disadvantages of the distrib
Q. Explain the type of micro-operations? Let's first discuss type of micro-operations. Most common micro-operations performed in a digital computer can be categorized into 4 ca
What are advantages and disadvantages of using EEPROM? The benefits are that EEPROM do not have to be removed for erasure. Also it is possible to delete the cell contents selec
Q. Explain arithmetic shift Micro-operations? In arithmetic shift a signed binary number is shifted to right or to the left. So an arithmetic shift-left causes a number to be m
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd