3. How might the heap implementation of priority queues be used to solve the following problems?...

Transcribed Image Text:

3. How might the heap implementation of priority queues be used to solve the following problems? How do your answers change when the inputs are sorted? a. Construct a Huffman code (such codes are dis- cussed in most books on information theory and many books on data structures). b. Compute the sum of a large set of floating point numbers. c. Find the 1000 largest of ten million numbers stored on a magnetic tape. d. Merge many small sorted files into one large sorted file (this problem arises in implementing a disk-based Mergesort program). 3. How might the heap implementation of priority queues be used to solve the following problems? How do your answers change when the inputs are sorted? a. Construct a Huffman code (such codes are dis- cussed in most books on information theory and many books on data structures). b. Compute the sum of a large set of floating point numbers. c. Find the 1000 largest of ten million numbers stored on a magnetic tape. d. Merge many small sorted files into one large sorted file (this problem arises in implementing a disk-based Mergesort program).

Answer rating: 100% (QA)

a Construct a Huffman code The heap implementation of a priority queue can be used to construct a Huffman code efficiently Huffman coding is a technique used for data compression where each character ... View the full answer