Answer to Practical 2 Data Management and Handling (CP2016)
1. (Exercise C-3.5)
Lean B be an array of size n 6 containing integers from 1 to n 5, inclusive, with exactly
ve repeated. Describe a good algorithm for nding the ve integers in B that are repeat
Answer to Practical 6 Data Management and Handling (CP2016)
1. (Exercise R-7.12)
Let T be an ordered tree with more than one node. Is it possible that preorder traversal of
T visits the nodes in the same order as the postorder traversal of T? If so, give
Answer to Practical 8 Data Management and Handling (CP2016)
1. (Exercise R-9.7)
Draw the 11-entry hash table that results from using the hash function h(i) = (3i + 5) mod 11
to hash the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, and 5, assuming collisio
Answer to Practical 10 Data Management and Handling (CP2016)
1. (Exercise R-11.2)
Suppose S is a list of n bits, that is, n 0 s and 1 s. How long will it take to sort S with the
merge-sort algorithm? What about quick-sort?
Answer:
Merge-sort takesw )(n lg
Answer to Practical 9 Data Management and Handling (CP2016)
1. (Exercise R-10.3 modied)
Insert, into an empty binary search tree, entries with keys 30, 40, 24, 58, 48, 26, 25 (in this
order). Draw the tree after each insertion.
Answer:
See Figure 1
30
30
Answer to Practical 12 Data Management and Handling (CP2016)
1. (Exercise R-13.5)
Bob loves foreign languages and wants to plan his course schedule for the following years. He
is interested in the following nine language courses: LA15, LA16, LA22, LA31, L
Answer to Practical 11 Data Management and Handling (CP2016)
1. (Exercise R-13.2 modied)
Draw an adjacency list and an adjacency matrix representation of the undirected graph shown
in Figure 1.
V
U
X
Z
W
Y
Figure 1: An undirected graph for question 1.
Ans
Answer to Practical 7 Data Management and Handling (CP2016)
1. (Exercise R-8.9)
Give an example of a worst-case sequence with n elements for insertion-sort, and show that
insertion-sort runs in (n2 ) time on such a sequence.
Answer:
A worst-case sequence
Answer to Practical 5 Data Management and Handling (CP2016)
1. (Exercise R-6.20)
Suppose we are maintaining a collection C of elements such that, each time
Answer to Practical 1 Data Management and Handling (CP2016)
1. (Exercise R-1.10)
Write a short Java function, isMultiple, that takes two long values, n and m, and returns true
if and only if n is a multiple of m (i.e. n = m * i for some integer i).
Answer
Answer to Practical 4 Data Management and Handling (CP2016)
1. (Part of Problem 3.4, Cormen et al.)
Let f (n) and g(n) be asymptotically positive functions. Prove or disprove each of the following
conjectures:
(a) f (n) = O(g(n) implies g(n) = O(f (n).
(b
Answer to Practical 3 Data Management and Handling (CP2016)
1. (Exercise R-4.7)
The number of operations executed by algorithms A and B is 8n lg n and 2n2 , respectively.
Determine n0 such that A is better than B for n n0 .
Answer:
Setting two equations e
* We aren't endorsed by this school
