Answers>Computing>A Level>Article

Describe a queue data structure.

A queue is a FIFO (First In First Out) data structure.
Analogous to a production line, the first item in the list will be the first to be removed, the second the second and so on.

Answered by Michael T. • Computing tutor

3288 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

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

Explain the difference between lossless and lossy data compression techniques.

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.

Describe a queue data structure.

Related Computing A Level answers

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

Explain the difference between lossless and lossy data compression techniques.

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.

Project Euler Question 3: What is the largest prime factor of the number 600851475143?