COMPSCI 187
Programming with Data Structures
Programming with Data Structures
This week we will be focusing on the Queue ADT. We will look at the formal specification of queues using three different interfaces – a generic queue and bounded and unbounded forms that extend the generic queue. We will explore two different implementations using arrays and linked lists for both bounded and unbounded versions. We will study two different applications using queues (and stacks): palindromes and the card game of war. We will discuss concurrent programming in Java using threads and the synchronization of variables. You will investigate a program using queues to determine average waiting times.