Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
Question
Book Icon
Chapter 20.6, Problem 20.6CP
Program Plan Intro

Queue:

The queue is a linear data structure used to store a set of data and is the collection of data that uses FIFO (first-in-first-out) order for performing operations.

  • The queue is opened at its both ends. One end is for inserting items to the queue called a “rear” end and the other end is for removing the items from the queue called a “front” end.
  • The two basic operations done on a queue data structure are,
    • enqueue() – add an item to queue.
    • dequeue() – remove an item from the queue.
  • When the “enqueue()” method is invoked, it checks whether the queue is full or not. If the queue is full, it throws an exception.
    • If the queue has slots available, then element is added at the rear end.
  • When the “dequeue()” method is invoked on a queue, it checks whether the queue is empty or not. If queue is empty, it throws the exception.
    • If the queue is not empty, then elements are deleted from the front end in first-in-first-out order.

Blurred answer
Students have asked these similar questions
What operations are possible with queues?
What Operations Can Be Performed On Queues?
What are the two steps involved in deleting a node from a linked list?
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning