New
#1
In Java Final Right Now, Need Urgent Help
1. Show the binary search tree created by CreateBinSrchTree for the keys 22,11,0,72,27,55,23,108,1
2. demonstrate the action of CreateMaxHeap on the set of elements (5,23,6,5,108,2,73,41,52,34)
fill the state of the array after each insertion, and only show as a figure the final heap.
i Insert 0 1 2 3 4 5 6 7 8
A[/] 5 23 65 108 2 73 41 52 34
A[/]
A[/]
A[/]
A[/]
A[/]
A[/]
A[/]
A[/]
3. Trace the action of BingoSort for the list 2, 1, 1, 5, 1, 2, 4, 4, 4, 7, 1, 1, 1, 3, 3, 5, 5, 5, 1, 7, 7, 4.
4. Demonstrate the action of ShellSort on the list (33, ....) with increments (5, 3, 1)
Original List 33, 2, 56, 23, 55, 78, 2, 98, 61, 108, 14, 60, 56, 77, 5, 3, 1
After 5-subsort
after 3-subsort
after 1-subsort
5. demonstrate the action of RadixSort for the following sample list, where each element is a seven-digit binary string
1011101, 0100011, 1010110, 1111101, 0011101, 0000001, 1000000, 1010101
Pass 1 Bucket 0:
Bucket 1:
Extract list
Pass 2 Bucket 0:
Bucket 1:
Extract list
Pass 3 Bucket 0:
Bucket 1:
Extract list
Pass 4 Bucket 0:
Bucket 1:
Extract list
Pass 5 Bucket 0:
Bucket 1:
Extract list
Pass 6 Bucket 0:
Bucket 1:
Extract list
Pass 7 Bucket 0:
Bucket 1:
Extract
sorted list
6. Trace the action of HuffmanCode for the letters (a, b, c, d, e, f, g, h) occuring with frequencies (10, 7, 3, 5, 9, 2, 3, 2).
He gave us a few days to do it.
Last edited by IMAyNeed; 05 Dec 2011 at 23:41.