Scribd Logo
Upload

Welcome to Scribd!

  • Data Structure and Algorithms Analysis Coel37E: 4 Units

    Uploaded by

    Gifted David Odesola
    5 views7 pages
    This document discusses queues as an abstract data type (ADT). It defines a queue as a list that allows insertions at one end (the rear) and deletions at the other end (the front). Items are added at the rear and removed from the front, giving queues a first-in, first-out (FIFO) property. Common queue operations are enqueue, dequeue, front, and isempty. Real-world examples where queues are used include printer queues and process scheduling in computing.

    Original Description:

    Hello

    Original Title

    Queue

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses queues as an abstract data type (ADT). It defines a queue as a list that allows insertions at one end (the rear) and deletions at the other end (the front). Items are added at the rear and removed from the front, giving queues a first-in, first-out (FIFO) property. Common queue operations are enqueue, dequeue, front, and isempty. Real-world examples where queues are used include printer queues and process scheduling in computing.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    5 views7 pages

    Data Structure and Algorithms Analysis Coel37E: 4 Units

    Uploaded by

    Gifted David Odesola
    This document discusses queues as an abstract data type (ADT). It defines a queue as a list that allows insertions at one end (the rear) and deletions at the other end (the front). Items are added at the rear and removed from the front, giving queues a first-in, first-out (FIFO) property. Common queue operations are enqueue, dequeue, front, and isempty. Real-world examples where queues are used include printer queues and process scheduling in computing.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 7

    Data Structure and Algorithms

    Analysis

    COEL37E
    4 units
    Sat 8:00 am 11:00 am
    Sat 12:00 nn 3:00 pm
    QUEUE
    Queue as ADT
    A list of elements with insertions permitted
    at one endcalled the rear, and deletions
    permitted from the other endcalled the
    front.
    a common example of a linear list or an
    ordered list where data can be inserted at
    and deleted from different ends.
    Items are added at one end and removed
    from the other.
    Queue as ADT
    A stack data structure exhibits a first in
    first out (FIFO) or last in last out (LILO)
    property.
    Application of Queue in
    Real Life
    Operations of Queue
    Enqueue
    Dequeue
    Front()
    IsEmpty()
    Computer Applications
    Printer Queue
    Process scheduling

    You might also like