Interested to Buy Any Domain ? << Click Here >> for more details...
why don't we allow a minimum degree of t=1? in B-tree
- 4 Answers
- 14946 Views
- TCS, I also Faced
- E-Mail Answers
Answer Posted / chanu
Minimum degree =t => Minimum t-1 keys , Maximum 2t-1 keys
=> Minimum t child , Maximum 2t child
so,
Minimum degree =1 => Minimum 0 keys , Maximum 1 key
=> Minimum 1 child , Maximum 2 child
Minimum case doesn't exist i.e., no node exists with o keys and no node with only 1 child exists because a node with 1 key has 2 child .......
| Is This Answer Correct ? | 20 Yes | 2 No |
Post New Answer View All Answers
what is fact finding methods
what do you mean by Foreign exchange domain
why is testing neccessary?
Where we have to use RCVF and where we have to use SNDRCVF. Basically what is difference between RCVF and SNDRCVF?
If Web site developer want to evaluate their current authoring tool, where would they start?
What are the advantages Information System Architecture Framework in term of analysis and system design
What are virtual platforms for software development?
How would you create a footprint in your PCB designer software (say, Altium)?
How to Design a Good Ad?
One of our potential future investors ask us for following: "We also wanted to see the high level algorithm diagrams". I have searched the Web a lot and have found a lot of types of diagrams. I will not list them here. I'm not sure that the definition "high level algorithm diagrams" exists at all. Any way, if you know it is - where I can find it on Web. The more general question. If one need to create (let us define it this way) high level algorithm diagrams - where to find types, descriptions and templates on Web. Thanks a lot. Valery
What is Make to Order, and what is the difference between Make to order and Make to Cash
Can you explain why software is called a product?
What is the role of the W3C in Web accessibility?
What was the architecture or design of your last project? what were the pros and cons of the design?did it scale well?
Write a command to find all of the files which have been accessed within the last 30 days. Output should be stored in a file “December.files”
