{"id":734,"date":"2020-06-08T06:24:48","date_gmt":"2020-06-08T06:24:48","guid":{"rendered":"http:\/\/learnlearn.uk\/alevelcs\/?page_id=734"},"modified":"2021-04-22T03:11:30","modified_gmt":"2021-04-22T03:11:30","slug":"stack","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/alevelcs\/stack\/","title":{"rendered":"Stack"},"content":{"rendered":"
\n

Introduction<\/h2>\n
\n\n

Introduction to Stacks<\/h3>\n

What is a stack?<\/h4>\n

A stack is a First In Last Out (FILO) data structure that is commonly used for a variety of purposes in computer systems.<\/p>\n

Example usage:<\/p>\n

    \n
  • Recursion<\/li>\n
  • Expression Evaluation<\/li>\n
  • Parsers<\/li>\n
  • Backtracking Algorithms<\/li>\n<\/ul>\n

    A common analogy of a stack is when you are washing dishes. As more dishes are brought in to wash they are added to the top of the stack of dishes. When you have finished washing a plate you take the next plate from the top of the pile<\/p>\n

     <\/p>\n

    \n

    What do you need to know for AS Level?<\/strong><\/p>\n

    You need to be able to:<\/p>\n

      \n
    • Describe the key features of a stack, queue and linked list and justify their use<\/strong> for a given situation<\/li>\n
    • Candidates will not be required to write pseudocode for these structures, but they should be able to add, edit and delete<\/strong> data from these structures.<\/li>\n<\/ul>\n<\/div><\/div>\n\n<\/div>

      Stack Methods<\/h2>\n
      \n\n

      Stack Methods<\/h3>\n

      Stacks have three main methods:<\/p>\n

        \n
      • Push<\/li>\n
      • Pop<\/li>\n
      • Peak<\/li>\n<\/ul>\n

        Push<\/strong><\/p>\n

        This is where an item is added to the top of the stack. If the stack is full and the item cannot be added then an error is raised.<\/p>\n

        Pop<\/strong><\/p>\n

        This is where an item is removed from the top of the stack and returned to the program for further processing. If the stack is already empty then an error is raised.<\/p>\n

        Peek<\/strong><\/p>\n

        This is where the value contained at the top of the stack is returned to the program without removing the item from the stack. If the stack is empty then an error is raised.<\/p>\n

         <\/p>\n\n<\/div>

        Python Stack<\/h2>\n
        \n\n

        Python Implementation<\/p>\n

        Python (Functional Programming)<\/strong><\/p>\n