6.2-queue - • Size How many elements currently on the...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
CMPT 225 Queue
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CMPT 225 Using Queue as part of Software Solution • Type of problem statements that would well be solved using a queue as part of software solution • Textbook examples: • Reading a string of characters • Recognizing Palindromes • When module A’s output is module B’s input in a asynchronous fashion or when module B reads its input at a lower rate than module A produces its output
Background image of page 2
CMPT 225 What is a Queue – In Real World?
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CMPT 225 What is a Queue – as a Data Structure?
Background image of page 4
CMPT 225 Queue Operations Enqueue : Insert an element into the queue Dequeue : Remove an element from the queue Peek : Retrieve an element from the queue (but do not remove the element)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Size : How many elements currently on the stack • also used as “IsEmpty()” CMPT 225 Queue Operations Time Efficiency • Enqueue • Dequeue • Peek • Size CMPT 225 Implementing Queue as an ADT • Part 1 • Public interface (or specification) • enqueue • dequeue • peek • size • dequeueAll CMPT 225 Implementing Queue as an ADT • Part 2 • Implementation #1 • Index-based CMPT 225 Implementing Queue as an ADT • Part 2 • Implementation #2 • Reference-based or pointer-based CMPT 225 Implementing Queue as an ADT • Part 2 • Implementation #3 • Using an ADT List CMPT 225 Comparing Implementations Lab Assignment 3...
View Full Document

This note was uploaded on 01/29/2012 for the course CMPT 225 taught by Professor Annelavergne during the Summer '07 term at Simon Fraser.

Page1 / 11

6.2-queue - • Size How many elements currently on the...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online