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

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

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

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

View Full Document Right 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
Image of page 2
CMPT 225 What is a Queue In Real World?
Image of page 3

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

View Full Document Right Arrow Icon
CMPT 225 What is a Queue as a Data Structure?
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)
Image of page 5

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

View Full Document Right Arrow Icon
Image of page 6
Image of page 7

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

View Full Document Right Arrow Icon
Image of page 8
Image of page 9

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

View Full Document Right Arrow Icon
Image of page 10
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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern