Describe a stack data structure.

A stack is a LIFO (Last In First Out) data structure. 
Analogous to a stack of plates, every new data entry is placed (or pushed) onto the top of the stack, and to get the the data below it, you must first remove all the data above it.

Answered by Michael T. Computing tutor

2591 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Describe the process of a binary search.


When a stack is implemented using a 1-D array, adding a valid item can cause an execution error. Explain why an execution error can occur in this situation.


Simplify the following Boolean expression: ¬(AvB) v ¬(CvD) v ¬A^(BvC) v (¬A^A)


Outline the differences between how a compiler and an interpreter works, and explain the advantages and usage of of each [12 marks]


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2024

Terms & Conditions|Privacy Policy