(No Login on Secured Page)
|
|
Show Bid Request
EASY Binary Tree questions
Bid Request Id: 13259
|
|
|
|
Posted by: |
Brickle (4 ratings)
(Software buyer rating 10)
|
|
Posted: |
Apr 11, 2002
6:33:47 PM EDT
|
|
Bidding Closes: |
Apr 12, 2002
9:00:00 PM EDT
|
|
Viewed (by coders): |
148 times
|
|
Deadline: |
4/12/2002 9:00:00 PM
TIME EXPIRED
|
|
|
|
|
Description:
1. A B+ tree structure is generally superior to a B-tree for indexed sequential access. Since B+ trees incorporate B trees, why not use a B+ trees whenever a hierarchical indexed structure is called for?
2. Consider the sequence set shown in Fig. 10.1(b). Show the sequence set after the keys DOVER and EARNEST are added; then show the sequence set after the key DAVIS is deleted. Did you use concatenation or redistribution for handling the overflow?
3. If the key BOLEN in the simple prefix B+ tree in Fig. 10.7 is deleted from the sequence set node, how is the separator BO in the parent node affected?
Fig 10.7 and 10.1 enclosed in .zip file
4. Consider the simple prefix B+ tree shown in Fig. 10.7. Suppose a key added to block 5 results in a split of block 5 and the consequent addition of block 8, so block 5 and 8 appears as follows:
… -> FABER-FINGER -> FINLEY-FOLK -> …
5 5 8
a. What does the tree look like after the insertion?
b. Suppose that, subsequent to the insertion, a deletion causes underflow and the consequent concatenation of the block 4 and 5. What does the tree look like after the deletion?
c. Describe a case in which a deletion results in redistribution rather than concatenation, and show the effect it has on the tree.
5. Why it is often a good idea to use the same block size for the index set and the sequence set in a simple prefix B+ tr
Deliverables:
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
Complete copyrights to all work purchased.
Platform:
Must be in Microsoft Word format
Must be 100% finished and received by buyer on:
Apr 12, 2002 9:00:00 PM EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Special Conditions / Other:
must have by 4/12/02 pm
Additional Attached Files
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation, you can report it to: abuse@rentacoder.com.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
No bidding allowed, because this bid request was cancelled.
|
| Cancelled Date: |
4/19/2002 12:36:00 PM
|
|
|
|
|
Credentials
|
Rent A Coder upholds the rigorous business practices required to be both a BBB member and Square Trade vendor.
- All customer issues addressed within 2 days
- Openly disclosed pricing and return policies
- Participation in mediation at buyer request
- Superior selling track record
This site is verified through its parent company, Exhedra Solutions, Inc.
|
|
See all top coders...
(What makes a top coder?)
Top Exam Scorers
Created in partnership with:
|
|