GoConqr has a new look! Let us know what you think.

Flashcards

[Almost Done] Stacks | Data Structures - OCR Computer Science A Level

Malachy Moran-Tun Computer Science A level English 5 cards

Cards in this deck (5)

  1. 1What is a Stack?> Last in, first out (LIFO) data structure
    > Contains multiple elements, similar to a one-dimensional array
    > New elements can only be added to the top
    > Elements can only be retrieved from the top
    > Sequence of elements is determined by the order in which they are inserted
  2. 2What are some Examples of Stacks being Used?> Back buttons in web browsers
    > Undo functions in various applications (e.g.: word processors, music software, etc.)
    > Hold return addresses when subroutines are called
    > Calculations (apparently)
  3. 3What Operations can be Performed on a Stack?> push(item) - Adds a new item to the top of the stack
    > pop() - Removes the top item from the stack and returns it
    > peek() - Returns the top item from the stack (does not remove it)
    > isEmpty() - Returns true if the stack is empty, false if not
    > isFull() - Returns true if the stack is full, false if not
  4. 4How can a Stack be Implemented with Static Data Structures?> Two additional variables are created
    > One pointer variable, which points to the top of the stack
    > One being the maximum size of the array, which is used to stop overflow in the stack
  5. 5Why would isFull() or isEmpty() need to be Called when Adding or Popping an Item to a Stack?> If the stack is static, there will be a maximum size determined by the array size
    > If the pointer exceeds this size, an overflow error would occur, which could potentially crash the program, or write to unwanted memory, affecting it elsewhere
    > If the pointer goes below 0, an underflow error would occur if an attempt is made to pop an item, potentially causing a crash

Information

Description
A level Computer Science (Data Structures) Flashcards on [Almost Done] Stacks | Data Structures - OCR Computer Science A Level, created by Malachy Moran-Tun on 08/10/2021.
Views
5
History
  • Created by Malachy Moran-Tun · Oct 6, 2021
  • Copied by Malachy Moran-Tun · Oct 8, 2021
Rating

Feedback

What is it about?

What do you think of the new look?

How do you like it?