next up previous
Next: About this document

CSE 5311 Section 501 Fall 1998
Homework 4
Due: March 25, 1998, in class

  1. A sequence of n operations is performed on a data structure. The ith operation costs i if i is a power of 3 (i.e., tex2html_wrap_inline43 where a is a nonnegative integer); otherwise, the cost is 1.

  2. Show the binomial heap that results after each operation listed below:

  3. Show the Fibonacci heap that results after each operation listed below:

  4. Implement code for inserting and deleting integer keys into a B-tree with minimum degree t=3 following the algorithms in chapter 19 of the textbook. You may assume that the entire tree resides in memory, so calls to Disk-Read and Disk-Write are unnecessary. The details are given below.

    Once you have successfully compiled and executed your program on omega, send the code to cs5311-turnin@cse. The source code must be submitted by 5:30 p.m. on the due date. In addition to identifying yourself and the homework number in a comment at the top of your code, also include a ``Compile Using'' comment line so we know how to compile your program. Be sure to use good programming and documentation style.




next up previous
Next: About this document

Diane J. Cook
Sat Feb 21 09:51:38 CST 1998