Queues 1 (using array, abstract version)
by Vangelis Livadiotis
•Queues operate on a First In First Out (FIFO) basis
•A queue is a commonly occurring data structure with the properties that we can:
The applet represents the more abstract representation of a queue. The code based representation is shown in this applet.
The full Pascal code for a queue is given here.
The following applet represents a simple queue at a shop. You just enter a customers name and click Add to add him to the queue. Suppose each customer is new information in a system. The first information going in is the first one to leave.
Next Applet on Queues (based on the code provided) ->
Home | Arrays | Arrays2 | Queues1 | Queues2 | Stacks | Arguments | Pointers |
Binary Search Tree
* Code taken from Lecture 2 in Data Structures Semester 2 2005 by Mr. Chris Cox for Oxford Brookes University.
Copyright © June 2005 - Author Vangelis Livadiotis