Time complexity is O(nlogn) and Space complexity is O(n).
What is huffman coding and what would be huffman code for the following characters?
Character Frequency a 10 l 15 i 12 o 3 u 4 s 13 t 1
Explain with suitable diagram?
Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix.
What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)?
