A problem about binary trees in java

A problem about binary trees in java. Please see attachment. The original course website where the problem comes from is here, I think it will be helpful if you take a look at it first: www.student.math.uwaterloo.ca/~cs134

A problem about ADT table in Java

Question: (a) Based on the following scenario, describe one advantage and one disadvantage of each implementation of the ADT Table (using a binary search tree, ordered vector, or unordered vector). (Note that there is certainly more than one acceptable answer for this question.) "Consider an implementation of the University of Waterloo staff telephone directory system as a dictionary. Given the high turnover of university staff and the unreliability of the telephone system, the addition and removal of persons to the dictionary is quite frequent and needs only occasional retrievals." (b) Based on your analysis, what would be the most appropriate implementation of the three (a binary sea... click for more

A problem about Sorting in Java

Part (A) Sort the array 15 80 35 25 60 30 into descending order using a) the selection sort. b) the buble sort. Part (B) A first year student attempted to write mergesort in pseudocode as follows. mergesort(theArray, n) { if (n > 1){ // more than one item to sort mergesort(left half of theArray, n/2) mergesort(right half of theArray, n/2) } } a) The above algorithm has a fundamental flaw. As written, how does it change theArray? b) What is the worst-case runtime of this incorrect algorithm? Give as tight an asymptotic upper bound as possible, using Big-Oh notation as a function of n. Justify your answer. The orig... click for more

A problem about Verification in Java

A problem about Verification in Java. Please see attachment. The original course website where the problem comes from is here, I think it will be helpful if you take a look at it first: www.student.math.uwaterloo.ca/~cs134

A problem about data structure in Java

Question: You have a computer where multiplication is an enormously expensive operation compared to addition. Consider an algorithm for computing cubes using only addition (FYI: the first 5 cubes are 13 = 1, 23 = 8, 33 = 27, 43 = 64 and 53 = 125). This computation can be made using a two-pass (i.e. two loop) algorithm: public int cube(int n) { int result = 0; int square = 0; for (int i = 0; i < n; i++) { square += n; } for (int j = 0; j < n; j++) { result += square; } return result; } Write (in Java) an elegant single-pass (one loop) algorithm for computing cubes using only additi... click for more