Construct the Huffman code tree for the set of frequencies in the table below:
| Character | Frequency |
| A | 5 |
| B | 1 |
| C | 6 |
| D | 3 |
| E | 4 |
____ _____ ________ _____ _______ ______.
____ ____ ________ ________ _____.
_____ _____ ____ _________ _____ __________.
______ _____ ___ _________ ___ ____ __________ ___ ________ ___ ______.
_________ ______ _____ ________ _________ __________ ____ ____ _________.
_________ ____ ____ ______ __________ _________ ___.
_________ _________ __________ __________ ____ ________ ________.
_____ ______ _____ _________ _______ _______ _________ _____ ______.
_________ _________ ______ _____ _____ ____ ________ ___.
_____ ___ ___ ______ ______.
______ __________ _____ ____ ________ ________ ______ ____.
______ ________ __________ ____ ___ __________ _______.
_________ _______ ____ ___ ___ __________.
________ ___ ______ ____ __________ _________ _____ _____ ________ ________.
________ ______ ____ _______ ______ _____ ______ ______ _____.
__________ _______ ____ ________ _______ ________ __________ ___ ___.
______ __________ ________ ____ ________.
_________ ________ ________ ____ _________ _____ __________ ___ __________ _________.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
✓ Unlock up to 60% of the answer
✓ No payment required
Apply DFS algorithm to find a spanning tree of the following graph. Also find all the fundamental cycles of the spanning tree.
Write an algorithm to find the first two largest numbers in an in array of integers. For example, given the input ,2 ,3 ,7 − ,4 ,1,5 the algorithm should output ,7 .5 State precisely a loop invariant for you algorithm. Prove that your loop invariant holds and hence conclude that your algorithm works.
Use Dijkstra's algorithm to find the shortest paths in the graph given below with a as the source vertex.
Use Kruskal's algorithm to find a minimal spanning tree in the graph given below
Construct a MAXHEAP tree on the following list of numbers
15, 22, 7, 10, 43, 52 13, 16,
Show step by step how the merge procedure of merge sort will merge the arrays ,1 ,3 ,4 ,7 11,9 13, 14, and ,2 ,5 ,6 10,8 12, .
Show step by step how you will construct a binary search tree by inserting keys in the order 12, 6, 4, 7, 8, 10, 7, 5, 13, 16, 11, starting from an empty binary tree. Explain step by step how you will delete the node with the key 13 from the binary tree. (5)
b) Illustrate the operations of performing counter sort on the array .