Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Two
(week 4)
Question 1. In the linear-time selection algorithm, the elements in the input sequence are divided into groups of size 5. Does the algorithm
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Three
(Week 6)
Question 1.
Show how to reconstruct the Longest Common Subsequence from the completed
table c and the original sequence X = hx1 , x2 , . .
Australian National University
Research School of Computer Science
Computer Science COMP3600/COMP6466
Answers to Tutorial One (2016)
In the following we provide some reference answers to the problems of Tutorial 1.
The relevant sections of the textbook sh
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Four
(Week 8)
Question 1.
Insert the keys 5, 2, 8, 9, 1, 6, 3 into a max-heap that was initially empty once a time,
then remove the key in the root repea
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Two
Solutions
Question 1. In the linear-time selection algorithm, the elements in the input
sequence are divided into groups of size 5. Does the algorith
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial five
(Week 10)
Question 1.
(i) What are essential differences between the binary search tree and the red-black
tree?
(ii) What is the left/right rotation
Computer Science COMP3600/COMP6466 in
2016 Tutorial One
Question 1. (i) Study the definitions of the basic notations such as , O, , o,
(ii) Rank the following functions in the order
p of growth:
2
2
3/2 4
0.5n
1.44
n lg n, n lg n, 3 , lg n lg n, n , n1/
Australian National University
Research School of Computer Science
Computer Science COMP3600/COMP6466 in
2016 Answer to Tutorial Five
Question 1.
(i) What are essential differences between the binary search tree and the red-black
tree?
(ii) What is the le
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Four
Question 1.
Insert the keys 5, 2, 8, 9, 1, 6, 3 into a max-heap one at a time, then remove the key in
the root repeatedly until the heap is empty. W
Australian National University
Research School of Computer Science
COMP3600/COMP6466 in 2016 Tutorial Three
Solutions
Question 1.
Show how to reconstruct an LCS from the completed c table and the original sequence X = hx1 , x2 , . . . , xm i and Y = hy1 ,