linktool.h and linktool.c.
You should use the linked list operations defined in this library to implement the queue operations enqueue,
dequeue, and isEmpty. You should demonstrate that
your implementations work by defining a short test program that
allows the user to enqueue and dequeue items, and to test to see if a queue is empty or not.
I suggest you follow these steps:
cp /cs/cs2301-b07/hw/hw6/* .Compile
linktool.c.
Make sure you understand the code in the files linktool.h and
linktool.c
before proceeding.
queue.h and queue.c.
queue.h should contain the pre- and post-conditions, and the
prototypes, for the three queue operations enqueue, dequeue, and isEmpty.
queue.c should contain the function definitions for the
three queue operations. Your functions should be defined in terms of
linked list operations as much as possible (in other words, make calls
to the functions defined in linktool.h and linktool.c
instead of duplicating that code in your queue function definitions).
Compile queue.c.
hw6.c that calls each of the queue operations.
Your test program should show that the queue behaves
properly (for example, if you enqueue several items, then dequeue and print
each item, the items should be printed in the same order as they
were enqueued).
Compile hw6.c.
/cs/bin/turnin submit cs2301 hw6 makefile queue.h queue.c hw6.c
Programs submitted after 11:59pm on December 11 will be tagged as late, and will be subject to the late homework policy.