printer to be available queue also stores keystroke data as you type at the keyboard this wayif you're using word processor but the computer is briefly doing something else when you hit keythe keystroke won' be lostit waits in the queue until the word processor has time to read it using queue guarantees the keystrokes stay in order until they can be processed the queue workshop applet let' use the queue workshop applet to get an idea how queues work when you start up the appletyou'll see queue with four items preinstalledas shown in figure figure the queue workshop applet this applet demonstrates queue based on an array this is common approachalthough linked lists are also commonly used to implement queues the two basic queue operations are inserting an itemwhich is placed at the rear of the queueand removing an itemwhich is taken from the front of the queue this is similar to person joining the rear of line of movie-goers andhaving arrived at the front of the line and purchased ticketremoving herself from the front of the line the terms for insertion and removal in stack are fairly standardeveryone says push and pop standardization hasn' progressed this far with queues insert is also called put or add or enquewhile remove may be called delete or get or deque the rear of the queuewhere items are insertedis also called the back or tail or end the frontwhere items are removedmay also be called the head we'll use the terms insertremovefrontand rear