Scribd Logo
Upload

Welcome to Scribd!

  • Stacks - Lesson

    Uploaded by

    Rhoxette Nazi Pedroza
    11 views11 pages
    Stacks are a dynamic data structure that follow the last-in, first-out (LIFO) principle, where the last element added is the first removed. Stacks are used to keep track of function calls by storing return addresses. Basic stack tasks include adding and removing values, emptying the stack, transferring between arrays and stacks, and counting elements. The document provides an overview of stacks and lists common stack operations and problems to practice.

    Original Description:

    Original Title

    Stacks - lesson

    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
    Stacks are a dynamic data structure that follow the last-in, first-out (LIFO) principle, where the last element added is the first removed. Stacks are used to keep track of function calls by storing return addresses. Basic stack tasks include adding and removing values, emptying the stack, transferring between arrays and stacks, and counting elements. The document provides an overview of stacks and lists common stack operations and problems to practice.

    Copyright:

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

    Stacks - Lesson

    Uploaded by

    Rhoxette Nazi Pedroza
    Stacks are a dynamic data structure that follow the last-in, first-out (LIFO) principle, where the last element added is the first removed. Stacks are used to keep track of function calls by storing return addresses. Basic stack tasks include adding and removing values, emptying the stack, transferring between arrays and stacks, and counting elements. The document provides an overview of stacks and lists common stack operations and problems to practice.

    Copyright:

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

    Stacks

    https://www.crazygames.com/game/stack-online
    Stacks
    Dynamic Data Structure
    LIFO (Last in First Out) - the last element
    to be “pushed” (inserted) into the stack
    is the first to be removed (“popped”)
    Used to keep track of function calls.
    Stacks
    Dynamic Data Structure
    LIFO (Last in First Out) - the last element
    to be “pushed” (inserted) into the stack
    is the first to be removed (“popped”)
    Used to keep track of function calls.
    Stacks - Basic Tasks

    ▪ Add and remove values from a stack


    ▪ Completely empty a stack
    ▪ Transfer from array to stack and vice-versa
    ▪ Count the number of values in a stack
    Stacks
    Practice Problems

    You might also like