COSC 2011 Section N
Tuesday, April 10 2001
This lecture will focus primarily on
Heaps. The lecture will begin with a
brief introduction to heaps (properties etc.) followed by their implementation.
It is recommended you review the material covered in the last lectures
regarding Priority Queues. Time permitting, Dictionaries
will be introduced.
Here are the sections of the textbook:
| Pages |
Section |
| 219 - 230 |
6.3.1 - 6.3.3 |
| 246 - 250 |
7.1 |
| Pages |
Section |
| 301 - 315 |
7.3.1 - 7.3.4 |
| 334 - 339 |
8.1 |
Additional Material:
-
Proof of Proposition 6.5 (first edition) Proposition 7.5 (second edition)
in PDF
format (by Professor Franck van Breugel).
-
Source Code Related to Priority Queues: (written
by Professor Franck van Breugel)
-
Implementation of a priority queue with a un-sorted
sequence in pseudo code (PDF
format) (written by Professor Franck van Breugel).
-
Implementation of a priority queue with a heap in
pseudo code: (PDF
format) (written by Professor Franck van Breugel).
-
Source Code Related to Heaps: (written by Professor
Franck van Breugel).
-
Dictionary Related Source Code: (written by Professor
Franck van Breugel).