I want to know the maximum number of keys stored
In a B-tree of order m and depth d.
![]() |
I want to know the maximum number of keys stored
In a B-tree of order m and depth d.
Sounds like another homework question...
Hi, this sounds like a question I got asked in my Algorithms course in my computer science degree. I am not going to give you the answer, but an excellent [resource] for you to look at and gain more knowledge of a b-trees so that you'll be able to answer this question on your own.
You think that is judgemental you shouldn't look at what I posted about a person trying to get cheat a UA test for probationl; now that was judgemental.
The policy of this site, which you didn't read, is that we don't do your homework for you. We won't supply you answers. We will help you come you gain the knowledge required to answer the question. No one here will do otherwise. If you looked at the link I gave you, it would have answered this question.
I have been through the courses you're going through and gotten the degree. Having me give you the answer isn't going to help you when you write the exam. Reading, implementing, and understanding the B-Tree will help you at exam time and afterwards. I have seen the type of person who gets the answers, but doesn't understand the concepts. They flunk out in third year, if they make it that far. Take that as you will, but I ain't helping you any more.
Please post any further questions you may have on the subject on the Mathematics board rather than the Computers for Beginners section.
Mathematics board is here>>>>> https://www.askmehelpdesk.com/mathematics/
Ps I have removed a rather confrontational discourse that is unwelcome on this site.
We would prefer YOU to post what YOU think rather then simple copy & pasting the problem.
Least then we know were you have an issue with the question.
All times are GMT -7. The time now is 05:49 PM. |