Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › queue-data-structureQueue Data Structure - GeeksforGeeks

   www.geeksforgeeks.org › queue-data-structure

   • Cached

   Nov 3, 2024 · A Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed.

2. www.geeksforgeeks.org › introduction-to-queue-dataIntroduction to Queue Data Structure - GeeksforGeeks

   www.geeksforgeeks.org › introduction-to-queue-data

   • Cached

   Aug 16, 2024 · A Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed.

3. www.javatpoint.com › data-structure-queueQuene (Data Structures) - Javatpoint

   www.javatpoint.com › data-structure-queue

   • Cached

   Queues are used in asynchronous transfer of data (where data is not being transferred at the same rate between two processes) for eg. pipes, file IO, sockets. Queues are used as buffers in most of the applications like MP3 media player, CD player, etc.

4. www.programiz.com › dsa › queueQueue Data Structure and Implementation in Java, Python and C/C++

   www.programiz.com › dsa › queue

   • Cached

   A queue is an object (an abstract data structure - ADT) that allows the following operations: Enqueue: Add an element to the end of the queue. Dequeue: Remove an element from the front of the queue. IsEmpty: Check if the queue is empty. IsFull: Check if the queue is full. Peek: Get the value of the front of the queue without removing it.

5. www.tutorialspoint.com › data_structures_algorithmsQueue Data Structure - Online Tutorials Library

   www.tutorialspoint.com › data_structures_algorithms

   • Cached

   Queue Data Structure - A queue is a linear data structure where elements are stored in the FIFO (First In First Out) principle where the first element inserted would be the first element to be accessed.

6. www.w3schools.com › dsa › dsa_data_queuesDSA Queues - W3Schools

   www.w3schools.com › dsa › dsa_data_queues

   • Cached

   Queues can be implemented by using arrays or linked lists. Queues can be used to implement job scheduling for an office printer, order processing for e-tickets, or to create algorithms for breadth-first search in graphs. Queues are often mentioned together with Stacks, which is a similar data structure described on the previous page.

7. www.geeksforgeeks.org › introduction-and-arrayIntroduction and Array Implementation of Queue - GeeksforGeeks

   www.geeksforgeeks.org › introduction-and-array

   • Cached

   May 25, 2023 · In This article, we will be implementing Queue data structure in JavaScript. A Queue works on the FIFO(First in First Out) principle. Hence, it performs two basic operations which are the addition of elements at the end of the queue and the removal of elements from the front of the queue. Like Stack, Queue is also a linear data structure. Note: As