Queue (Bounded Buffer) Demonstration Program
Items are inserted and removed from the queue implemented
as a bounded buffer.
-
An item can be inserted into the slot next to the one currently being pointed
to by the tailpointer if that slot is empty.
-
The item in the slot being pointed to by the head pointer
can be removed if that slot is not empty.
-
You may just press the Step button when the applet is started
without providing any command sequence.
-
You can also provide
a sequence of add and remove commands as
add 10 add 20 remove add 30 remove remove,
Source Code of the Queue Program
Source Code of the QueueG Program
(Graphical Version)
Back
Home