ECE 537 - Foundations of Computing
Prof. Sen
Homework #10
Due: Tuesday, November 27, 2007 in class
1. Draw a diagram which illustrates the arrangement of all the pointers and associated data struc-
tures needed in:
(a) A binomial heap implementation.
(b) A Fibonacci heap implementation.
2. Exhibit a sequence of MELDABLE PRIORITY QUEUE ADT operations that lead to the construction
of an n-vertex Fibonacci heap containing a single tree having a height of exactly n−1.
3. Prove that the number of children at a depth of iin binomial tree Bk,0≤i≤k, is k
i.
4. Read Chapter 21 in the Cormen et al. text, and then answer problem 21-1.
1
