What is the main difference between the Stack and the Queue abstract data types?

Queues are FIFO (first in, first out) data types. That is, the first object to be queued is the first objected to be dequeued. Stacks are LIFO (last in, first out) data types, meaning that the last object pushed onto the stack is the first object to be popped from the stack.

RH
Answered by Rob H. Computing tutor

3487 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

A common construct found in many algorithms is a loop. Using pseudocode, write a pre-condition loop to output all of the even numbers between 99 and 201.


Describe a stack data structure.


Given an unlimited number of light bulbs (that break at a certain height), and a building with 100 floors, how do you determine the height that the light bulb breaks?


Explain indexed addressing including the benefits when traversing certain data structures (4 Marks)


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences