Data Structure/Java
$10-30 USD
Paid on delivery
This all needs to be down through a jsfiddle account
1. Tower of Hanoi [login to view URL]
demonstrate computational complexity
Write a computer program that calculates the number of moves necessary to solve Tower of Hanoi given a number of disks.
Question: Should we be concerned with concerned with the legend of the world
ending when the 64 disk solution is physically solved?
2. Chain and Links code from (See attachment) You will need to fork your JSFiddle into a new Fiddle. In this Fiddle we are going to add a Chain function - Sort(). I would like you to add 2 sort functions, you can use any sort method that you desire for each of the sort functions. You can also delineate the functions by the name of the Sort function - so your functions might be QuickSort() and MergeSort() - if you chose to implement those 2 algorithms.
Once the Chain is sorted - we want to keep it sorted. You have a couple of ways to do that; (1) insert elements into the correct location in the Chain based on sort order or (2) re-sort the chain after every insertion. If you choose (2) you will need to pick an algorithm that is highly efficient for a pre-sorted array with one item out of place (look at all the algorithms - it is there).
You will now need an interface to add Links to your chain. Just create either a text box and a button or a button and any type of input. I should be able to add elements to your chain and see the new chain output each time I add an element.
3.
If you look at some compression techniques (such as LZW Compression [login to view URL] ) they make use of the concept of hashing techniques to compress files. We are going to do something similar. Consider the phrase
To be or not to be, that is the question.
Even though it does not make much sense to do this as the phrase is short. We are going to create bins for each word, and record the position of the instances of the words in the proper bins. So write a program that first has a series of bins
to
be
or
not
etc....
Because the word to occurs in positions 1 and 5, the bin for the word to will contain 1 and 5
to: 1 5
be: 2 6
or: 3
Write an program that will take the phrase, create bins for each word, and then record the instance position of each word in the bin. It will then output each bin (word) and the locations of the word in the phrase. So if the input was;
I want what I want and I know what I want.
The output would be;
I: 1 4 7 10
want: 2 5 11
what: 3 9
and: 6
know: 8
Project ID: #8124190
About the project
9 freelancers are bidding on average $53 for this job
Hi, I have strong background in JAVA and experience in Programming. Let me help you. I am ready to start.
Hello, I have many project on data structure and have 3 years wxpericence in Java, just hire me and it'll be done
Hi. I have experience in some international programming competition like ACM-ICPC. I work with algorithm and data structure for more than 5 years. Pls pm me for a chat, I'm glad to help you.
The project seems very basic and shouldn't require much effort to do. If you want it done exactly as described, and within two days, pick me.