This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Naive Printer Queue CSc 1254: Lab # 1 The Naive Printer Queue Out: 9/14 Due: 9/25 by 11:59 PM In this lab you will write functions to simulate the operations of a naive FIFO (first-in-first-out) printer queue. Learning Objectives Binary File Processing Manipulating an Array of Structures Working With A Personal Library Using the GNU Make Utility We will assume that the queue can hold at most 100 print jobs. Each job has an id 1, ... ,100. Initially when the program starts up, the jobs currently on the queue will be read from the jobs.dbf binary file into printq, an array of structures. The following operations are permissible (see the files for a description of the corresponding functions): Add job to the queue Cancel Print job Service job at the head of the queue Print the list of jobs on the queue Quit the program Copy the following files from the class directory: naivepq.h , naivepq.cpp , printq.cpp , jobs.dbf , and makefile . I have also included printqexe a working version of the lab. You may copy this file and run it to have a feel for how I expect the program to work when you are done. In the header file,for how I expect the program to work when you are done....
View Full Document
This note was uploaded on 01/17/2012 for the course CSC 1254 taught by Professor Blanks,l during the Fall '08 term at LSU.
- Fall '08