Scribd Logo
Upload

Welcome to Scribd!

  • Displet: Inmet

    Uploaded by

    Ujjwal Kumar
    7 views3 pages
    This document describes a simple queue program with functions to push, pop, and display items in the queue. The program uses a deque data structure to store items and provides a menu interface for users to select pushing, popping, or displaying the queue. It uses a while loop to continuously prompt the user for input and call the appropriate function until the user exits the program.

    Original Description:

    na

    Original Title

    aaa

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a simple queue program with functions to push, pop, and display items in the queue. The program uses a deque data structure to store items and provides a menu interface for users to select pushing, popping, or displaying the queue. It uses a while loop to continuously prompt the user for input and call the appropriate function until the user exits the program.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views3 pages

    Displet: Inmet

    Uploaded by

    Ujjwal Kumar
    This document describes a simple queue program with functions to push, pop, and display items in the queue. The program uses a deque data structure to store items and provides a menu interface for users to select pushing, popping, or displaying the queue. It uses a while loop to continuously prompt the user for input and call the appropriate function until the user exits the program.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    e ehe =

    3:
    Peek )
    e ehe = =
    4

    ese
    dispLet
    pri inmet ide Cheiee ")
    naueat () "))
    dr engueinc
    d mt/inpu (ndr
    cpp emd iden)
    d deaurue (
    i em e) ")
    Gueue
    mdey dle
    Prin
    etye
    Ilem", idcm)
    queied
    rimt (D
    ded peekla):
    i e )
    d (imder f l " )
    Prin (G ueue
    else
    dem caloj

    (peeh idems",
    iden)
    Print
    det dispta
    p r i m t ( u c e u m d e r f l e s )

    lem()=

    ( L t m (a)
    TEnge
    fori im
    i n d e[il)

    Choite\n>
    emque
    whle True Cemdey jcu
    Cho ind (inputDequeuc\m3prek\nA-> pDisptry
    ne

    Che 1
    engue e)
    e l i ehe = = 2

    dequeue( )
    A W a
    Pe preaTam do peri eY
    peroim on a sdeu. puSh, poP, Dis
    det push Yaluc) \
    a
    ppem d (veltu)
    d poP )
    Prim (r°ped I de " idemn)
    de eek ()
    Lasd Lena)-I
    Primd ("pe ek el emmem ">
    def
    lxsa)
    disple (C ):
    tor i im Tange
    (ien a)-1,-I,-1):
    prind leali])

    while True
    imdlimPut (em der aour eheoiee:1-psh\m2-;
    he
    m3peelk\m4-> Dispte)
    Cho == 1 do irshe

    value int(impud ( emdey muun ber


    Push a valuue)
    snd pushed sueeeJS#ull"
    prme (" elene

    eher-E 2

    f 2 ek uderlew
    eLe
    Popt)

    et he m d e r t l n "

    iLem
    primt
    ("
    Steek
    >Cseint (invalrd e
    eselpu

    You might also like