Show Bid Request
|
|
Description:
I have a class "BinarySTringTree" that requires a method and a constructor as follows:
CONSTRUCTOR: It takes a String parameter and it convertes it to a BinaryStringTree. A binaryStringTree is one string "0" OR two such strings concatenated together preceded by a 1. Also, it must have one more 0 bit than 1 bit, with the additional constraint that, at any position k, the number of 0 bits that appear strictly to the left of k is no larger than the number of 1 bits strictly to the left of k. For example "0", "100", "11000", 110011000" and "1110010110001011000" are binary string trees but "1", "1000", "01100" are not. THIS PART MUST BE DOME RECURSIVELY WITH A THE HELPER METHOD.
METHOD: void draw(Graphics g) ) that draws the BinaryTree object. Modifying the inorderIterator class in the BinaryTree class is a good way to calculate the (x,y) coordinates and the depth of each node. The x and y coordinates of each node are assigned as follows:
The diameter field is the diameter of the ovals that are drawn (filled) for each node.
The font size for drawing the name (number) of each node should be diameter also
The x coordinate is its position in the inorder listing of the nodes multiplied by a factor (for example 2*diameter works OK).
The y coordinate is the depth of the node multiplied by a factor (for example 4*diameter works OK).
Draw the filled ovals at the (x, y) coordinates of each node. The lines from a node to each of its children must be drawn also. Just connect the ovals to do this. A way to do this is to do an inorder iteration of the tree to calculate the (x, y) coordinates of each node and then do another iteration (possibly a preorder iteration) and draw the ovals and lines to the children
I have s class that can be used to test the program.
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.
4.) Comments that can allow me to understand the logic of the code
5.)The constructot must use the helper method getTree.
6.)The getTree method must be done recursively and hence must have a base case.
7.) Thre ouput with the tester must be identical to the one shown in the picture in the attached file called "Instructions". The tester is attached and is called "DrawStringTree"
8.) The class to be modified is attached and the name is "BinaryTree"
8.)
Platform:
in all Windows
The code must be done using Java
JDK 1.3 or higher
Additional Files:
This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding.
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 please help out the site and report it. Thanks for your help.
|
|
|
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!
|
$15 (USD)
|
Nov 1, 2002
5:47:26 PM EDT
|
9.7
(Excellent)
|
|
|
Hello,
I am an experienced and Sun certified Java programmer. I will be glad to work on this project for you. I will provide a fully commented code. I can do this work within 24 hours after you selected my bid.
Best regards,
Eric.
|
|
|
|
|
|
|
