CS 302 - Data Structures & Algorithms - Spring 2008
Programming Assignment 1

Loyola College > Department of Computer Science > CS 302 > Programming Assigngments > Programming Assignment 1

Due

Part 1: Monday, January 28th at the beginning of class
Part 2 & 3: Monday, February 4th at the beginning of class
Be sure to include the Honor Code Statement:
"I hereby declare that I have abided by the Honor Code during this assignment."

Assignment

Part 1: Create a design for a priority queye using an array and a linked list.
Part 2: Using C under Linux implement the design of the priority queue first using an array and then a linked list.
Part 3: For each of the functions in each of your implementations, determine the the expected running time using Big-O notation.

What to hand in

  1. A 1 page (or envelope back) program design (hard written ok). (unless otherwise stated all work handed in should be typed.) Due: 1/25/08 [[ Resubmit an updated version with code ]]
  2. A well formated 2-up listing of your code. (see a2ps(1)1).
  3. The output from the execution of your program on well chosen test data (script(1)). Don't know what "well chosen" means? Ask :)
  4. Big-O analysis of each of your priority queue functions for each implementation of the priority queue.

Notes

Check out http://cslibrary.stanford.edu/106 and definitely http://cslibrary.stanford.edu/104
1 Courier terms followed by a number refer to linux man(ual) page entries. To access the online manual type, in the case, man 1 a2ps.