Department of Computer Science and Engineering

CSE 247 / 502N

Spring 2016


Lab 1: Priority Queue

Due: 24 February 2016 at 2:30 PM

Abstract: We have studied the Binary Heap data structure in class. Now it is your turn to implement one. In support of both sorting and the next programming assignment, we will implement a minimum priority queue, so that elements are extracted from smallest to largest.

Goals of this lab:


Introduction


Your work for this lab


Having trouble?

Post problems on piazza, but do not post code publicly there!

How to submit your work



Last modified 09:42:30 CST 20 February 2016 by Ron K. Cytron