CS1027b Computer Science Fundamentals II

Lab 6

General lab instructions to help labs run smoothly

Overview and preparation

Upon completion of this lab, you should be able to understand the linked list and circular array implementations of the Queue ADT. For prepation, review the corresponding lecture notes (make sure you understand what a queue looks like when implemented as a linked list, as an array, and as a circular array).

Exercise 1

Exercise 2