Lecture Outline

• A queue is a first-in first-out (FIFO) data structure
• A queue can use either an array or linked list to hold its data
• The enqueue() method adds a new piece of data to the back of the queue
• The dequeue() removes the front element of the queue
• The Modulus operator (%) computes the remainder between two numbers (2%6 = 2, 10%6=4, 6%6 = 0)

Lecture Recording

• https://montana.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=bf85797e-1248-4b54-9534-b212015d63b6

Lecture Slides

• Queues (Array Implementation)

Code

• QueueArray
• QueueArrayDemo
• Order.java

Click here to return to the course schedule