Show Bid Request
3 part assignment
Bid Request Id: 35772
|
|
|
|
Posted by: |
prognewbie (0 ratings)
|
|
Posted: |
Nov 16, 2002
11:50:48 PM EDT
|
|
Bidding Closes: |
Nov 26, 2002
11:55:34 PM EDT
|
|
Viewed: |
127 times
|
|
Deadline: |
11/27/2002
TIME EXPIRED
|
|
|
|
|
Description:
My assignment consists of three parts. I have included the text straight from my textbook with all code and charts referenced. Time is something I do not have and would like bids on having someone else do this for me, since I am already working on 2 other projects for other classes. Thanks
Part 1:
Implement the three self-organizing list heuristics count, move-to-front and transpose (see attachment for full details)
Part 2:
Implement the dictionary ADT of section 4.2 (given below) by means of a hash table with linear probing as the collision resolution policy. (see attachment for full details)
Part 3:
Implement the 2-3+ tree, that is, a 2-3 tree where the internal nodes act only as placeholders. (see attachment for full details)
Deliverables:
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Complete ownership and distribution copyrights to all work purchased.
Platform:
I use Windows 2000 professional and MSVC++ for all of my coding and compiling. The source must compile and run in MSVC++ using the functionality available through MSVC++ and no special advanced headers or programming code, since I am a beginner and need to be able to understand and explain the program.
Must be 100% finished and received by buyer on:
Nov 27, 2002 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:
This must be in (3) seperate .cpp files, one for each Part.
Availability, if needed, of the programmer to answer any questions after delivery so in case I need some understanding of the code for flowcharting purposes and explaining algorithm results of each operation, which I must depict results for part 1 graphically and narratively, and have the ability to discuss the results in Part 2 and 3.
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 |
|
|
This bid was accepted by the buyer!
|
$65 (USD)
|
Nov 17, 2002
1:02:49 AM EDT
|
10
(Excellent)
|
|
|
Hello ,
I am John, I can do your program for $65.You can check my profile and rating in my coder biodata page though I am a new coder in this site.
You will get a very good program , complete source and as per your specifications and WELL COMMENTED.
Here are a detailed list of things that you will get, if you accept the bid:
1. Program Executable,
2. Program Source,
3. Program will be kept very SIMPLE, NO FANCY STUFF.
4. Source will be amply COMMENTED for your understanding.
5. Any queries regarding my this program will be answered by me through email promptly.
I know the seriousness of maintaining privacy and importance of submitting
assignments on time to get better grades so your program will be done in time.
You will appretiate a good working program completely commented for better
understanding.
Looking forward to do business with you,
Regards
john.
|
|
|
|
|
|
|
