Scribd Logo
Upload

Welcome to Scribd!

  • Operahons o Sta (K.: Sperrcbrenrt Tdeeaei) PUSH

    Uploaded by

    Manjula G
    3 views2 pages
    The document discusses key concepts related to stacks including: 1) Stacks allow insertion and removal of elements from the top using PUSH and POP operations. PUSH adds an element and POP removes the top element. 2) ISEmpty and ISFull are boolean variables used to check if the stack is empty or full respectively. 3) A hash table is a data structure that maps keys to values and provides constant time performance for operations like insertion, deletion and searching. Hashing is used in various data structures and applications like message digests and cryptography.

    Original Description:

    Original Title

    question1@ManikantaMandala

    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
    The document discusses key concepts related to stacks including: 1) Stacks allow insertion and removal of elements from the top using PUSH and POP operations. PUSH adds an element and POP removes the top element. 2) ISEmpty and ISFull are boolean variables used to check if the stack is empty or full respectively. 3) A hash table is a data structure that maps keys to values and provides constant time performance for operations like insertion, deletion and searching. Hashing is used in various data structures and applications like message digests and cryptography.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    3 views2 pages

    Operahons o Sta (K.: Sperrcbrenrt Tdeeaei) PUSH

    Uploaded by

    Manjula G
    The document discusses key concepts related to stacks including: 1) Stacks allow insertion and removal of elements from the top using PUSH and POP operations. PUSH adds an element and POP removes the top element. 2) ISEmpty and ISFull are boolean variables used to check if the stack is empty or full respectively. 3) A hash table is a data structure that maps keys to values and provides constant time performance for operations like insertion, deletion and searching. Hashing is used in various data structures and applications like message digests and cryptography.

    Copyright:

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

    6uesthim :

    Operahons o sta(k. Stotk s a daio shuthure ehaly

    ubed
    ubed m cuMn he popurty or
    Stack LIPO (Layt im hot t)-
    Sperrcbrenrt tdeeaei) PUSH
    (ii) POP GisEmph iv) is FuJ ) Pak
    ush: i method which i usd to msrt an domen
    at the top HheSfack
    om elutmt
    mhod wwidh i wad t dlete
    t the
    top of Ha shk
    is Emphy: abooleam tyee varialt whith U uwed m Ppp
    method wi tha holp d frok vaniale whudh tel whtho
    th Stack i
    s Fall i is epty m»t
    also a bopleom type vaiab ith uusnd m
    PUSH method wit te help ot Pek vOnabe tohicL tells
    whath Hhe statkis tull or
    rot
    Pick Hhe vaial shidh stoe stheu Hhe

    inseing at he aom .

    movmet

    Maikanh Mandala

    200335
    AHash table adata structure used to implemed

    abstract data type ike associahue ara4

    provides Constent timp complerity O) a he best case


    COmpexiy
    nd the wovsk a Complexity oill be OCh).

    Hashing is sed m vanious data shucure and mamy


    wod appliations lke
    mesage digest, cypography
    ile Systems ek
    Hash tade has many odvantages like
    hme lomplexiy
    Constantt ime egordless .of

    tCnns in the tade

    god perfovmana
    Roaluy ovd
    Realuy
    uwhe performing
    Mawu kamta
    timgy
    Mandala 0perahios like inse tins, dale
    0013S

    You might also like