What is a B-Tree? Show how the letters A to P English alphabet can be entered into a B-tree of order 4.
B-Tree
Definition: A B-Tree of order 'm' is an “m" way tree such that
1. All leaf nodes are at the same level.
2. All leaf nodes (except the root) have at most m and at least m/2 children.
3. The number of keys is one less than the number of children for non-leaf node and at most m “1” and at least m/2 for leaf nodes.
4. The root may have as few as 2 children unless the tree is the root alone.
Example: The letters A to P English alphabet can be entered into a B-tree of order 4.
What is a B-Tree? Show how the letters A to P English alphabet can be entered into a B-tree of order 4.
Define the ADT for stack. Show the implementation of the stack data structure using linked list.
a) Sort the following list using the Radix Sort :
189, 205, 986, 421, 97, 192, 535, 839, 562, 674
Describe Dimension of Software Quality
Write short notes on:
