FinalF08TTh - 1/7 EE 322C Fall 2008 Final Exam Dr. Ramesh...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1/7 EE 322C Fall 2008 Final Exam Dr. Ramesh Yerraballi TTh Full Name : Duration : 3 hrs 1. [ 15 points ] Show the Huffman tree that results from the following frequencies (table below) of characters; Give the Huffman codes that each character will be assigned. Char u r n i a e s m t o Freq 14 50 4 60 35 25 18 7 16 42 Code
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2/7 2. [ 10 points ] Given the following array of items 9 3 2 1 5 8 4 6 7 Assuming the two recursive calls to the MergeSort algorithm to sort the two halves have been called, show the contents of the array after the calls have returned. Now show the working of the merge step that merges the two halves.
Background image of page 2
3. [12 pts] The following questions pertain to Heaps (Prority Queues) i. [6 pts] Give the Heap that results from executing buildHeap on the following array of items: 3, 12, 5, 6, 4, 10, 9, 1, 8, 2 . ii. [4 pts] Show the tree that would result from removing the root element from the heap. Show your steps. iii.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

FinalF08TTh - 1/7 EE 322C Fall 2008 Final Exam Dr. Ramesh...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online