University of Florida COP 5536 Exam02 copy 12 - Instructor: Dr. Sartaj Sahni Spring 2005 Advanced Data Structures COP 5536 Exam 2 CLOSED BOOK 60 Minutes Name: NOTE: 1. For all
1. (10) For min Fibonacci heaps:
(a) (5) Perform the following sequence of operations on an initially empty min Fibonacci
heap in this order:
Insert(18), Insert(10), Insert(16), Insert(6), Insert(4), Insert(15), Remo
...[Show More]
University of Florida COP 5536 Exam02 copy 12 - Instructor: Dr. Sartaj Sahni Spring 2005 Advanced Data Structures COP 5536 Exam 2 CLOSED BOOK 60 Minutes Name: NOTE: 1. For all
1. (10) For min Fibonacci heaps:
(a) (5) Perform the following sequence of operations on an initially empty min Fibonacci
heap in this order:
Insert(18), Insert(10), Insert(16), Insert(6), Insert(4), Insert(15), RemoveMin
Draw min Fibonacci heaps before and after performing the remove min operation.
(b) (5) For the min Fibonacci heap shown in Figure 1, perform a DecreaseKey operation
by changing 33 to 4. T represents a ChildCut of TRUE and F represents FALSE.
[Show Less]