06-28-2010, 08:16 PM
Question No: 1 Marks: 10
Show the result of inserting the following values into an empty AVL Tree.
You are required to show each step of insertion and rotation (to make the tree balance) in pictorial form with balance of each node.
19,21,22,17,18,23,27,25,30,34, 35
Question No: 2 Marks: 10
Find below some letters with their frequencies in a frequency table.
Frequency Table:
Character Frequency Character Frequency
A 1 O 4
C 1 R 2
D 3 J 1
E 7 N 6
F 2 S 1
G 1 T 3
W 1 NL 1
I 3 SP 6
a) Create a Huffman tree 4
b) Determine the binary code for each character 2
c) Encode the sequence ACDEF 2
d) Compare the Huffman encoded sequence of option c with the encoding of sequence with ASCII code. 2
Note:
More then one representations of Huffman encoding tree can be exist for the same data.
Show the result of inserting the following values into an empty AVL Tree.
You are required to show each step of insertion and rotation (to make the tree balance) in pictorial form with balance of each node.
19,21,22,17,18,23,27,25,30,34, 35
Question No: 2 Marks: 10
Find below some letters with their frequencies in a frequency table.
Frequency Table:
Character Frequency Character Frequency
A 1 O 4
C 1 R 2
D 3 J 1
E 7 N 6
F 2 S 1
G 1 T 3
W 1 NL 1
I 3 SP 6
a) Create a Huffman tree 4
b) Determine the binary code for each character 2
c) Encode the sequence ACDEF 2
d) Compare the Huffman encoded sequence of option c with the encoding of sequence with ASCII code. 2
Note:
More then one representations of Huffman encoding tree can be exist for the same data.