This homework has two parts, each contributing half of the grade for this assignment.
Due: part I due on Tuesday 3/30 in class, Part II on Wednesday 3/31/2004 by 12:00 a.m.
Part I: QT exercise
- Go to Homework 1 from
CSC 220 module.
- Do dilligently the steps indicated by the tutorial, as requested by the homework.
- There is nothing to submit, but you should be
prepared to show to me in class, on Tuesday, the result of your work.
- The grade for this part of the homework is
as follows: A, C, E.
- A (=100) for projects that work and that implement at least 50% of the features asked for.
- E (= 0) for unsubmitted projects.
- C (= 50) for all the others (that will include submitted projects that do not work).
Part II: Queue class
Under Linux, develop a C++ program to implement and test a queue data structure (for integers).
The Queue data structure has the basic queue
operations In and Out, Full and Empty, plus a function Print for testing and has to be implemented
as a C++ class. The queue implementation is circular, and the allocated size is
EXACTLY 3 (to allow for easy testing). IN and OUT should print error messages when the queue
is full (resp. empty). The testdriver should be menu-based, with one option for each of the five operations
(IN, OUT, EMPTY,FULL and PRINT).
- in Hw7
- 5 files: Queue.h, Queue.cpp, testQueue.cpp, Makefile
Grading guidelines (for the TA)
- Part II: compile and test on the following sequence: IN 1, Print, IN 2, Print, IN 3, Print, OUT, Print,
IN 4, Print, IN 5, Print, OUT, Print, OUT, Print, IN 6, Print, OUT, Print, OUT, Print, OUT, Print, OUT, Print