vault backup: 2025-03-16 18:59:42

Data Structures/AI Notes/Queues.md

@@ -7,41 +7,38 @@ A queue is an important abstract data type (ADT) characterised by its FIFO (Firs
 ## Key Concepts of Queues
 
 - **Structure:** A queue consists of two primary ends:
-    
-    - _Front:_ The position from which elements are removed.
-        
-    - _Rear:_ The position where elements are added.
-        
+
+    - *Front:* The position from which elements are removed.
+
+    - *Rear:* The position where elements are added.
+
 - **Core Operations:** The basic operations associated with a queue are:
-    
+
     - **isEmpty():** Checks if the queue is empty.
-        
+
     - **peek():** Returns the front element without removing it.
-        
+
     - **put(x):** Adds an element x at the rear of the queue.
-        
+
     - **remove():** Removes and returns the front element.
-        
 
 ## Queue Applications
 
 Queues have various applications due to their structure, such as:
 
 - CPU and disk scheduling, where resources are shared among multiple consumers.
-    
+
 - Buffering in asynchronous data transfers like I/O operations, where data may not be received at the same rate as it is sent.
-    
+
 - Handling jobs in a network printer which generally follows a FIFO order.
-    
 
 ## Queue Representation
 
 Queues can be implemented in two ways:
 
 - **Linear Array Queue:** Uses a one-dimensional array along with pointers for front and rear.
-    
+
 - **Circular Array Queue:** Employs a circular structure to efficiently utilize array space, preventing the needs of shifting elements when the array is full.
-    
 
 ## Linear Queue Representation
 
@@ -56,20 +53,18 @@ Queue:   A B C D   (front = 1, rear = 4)
 A circular queue, uses the following logic:
 
 - Front points 'anti-clockwise' from the first element while rear points to the last inserted element.
-    
+
 - Utilizes the modulo operator to wrap around the indices as elements are added or removed.
-    
 
 ## Implementation of a Circular Queue
 
 The implementation comprises several stages:
 
 1. **Initialization:** Set front and rear to 0.
-    
+
 2. **Insertion:** Update the rear index with a modulo operation. For example, rear=(rear+1)\%queue.length.
-    
+
 3. **Removal:** Increment the front index to remove an element.
-    
 
 ## Challenges with Circular Queues
 
@@ -77,26 +72,25 @@ One of the critical issues with circular queues is distinguishing between a full
 
 ## Queue Implementation Using Array
 
-The _ArrayQueue_ class illustrates array-based implementation:
+The *ArrayQueue* class illustrates array-based implementation:
 
 ``` java
 public class ArrayQueue implements Queue { ... }
 ```
 
-This class defines data members like _front_ and _rear_, along with methods for manipulating the queue.
+This class defines data members like *front* and *rear*, along with methods for manipulating the queue.
 
 ## Queue Methods Overview
 
 Here are key methods defined in the Queue interface:
 
 1. **isEmpty():** Returns true if the queue is empty.
-    
+
 2. **peek():** Returns the front element or null if the queue is empty.
-    
+
 3. **put(Object theObject):** Adds an element to the queue and may increase array length if the queue is full.
-    
+
 4. **remove():** Removes the front element and updates the front pointer to the next element.
-    
 
 ## Queue Implementation Using Linked List
 
@@ -111,10 +105,9 @@ This structure provides constant time complexity for insertions and deletions, o
 ## Summarizing Queue Operations
 
 - **Adding Elements:** In a linked implementation, a new node is created and linked appropriately.
-    
+
 - **Removing Elements:** The front element is removed and the front pointer is updated.
-    
 
 ## Conclusion
 
-Queues are fundamental data structures in computer science with a range of applications spanning from scheduling tasks to implementing buffers. Their efficient management of elements through well-defined operations supports numerous algorithms and data handling strategies in programming.
+Queues are fundamental data structures in computer science with a range of applications spanning from scheduling tasks to implementing buffers. Their efficient management of elements through well-defined operations supports numerous algorithms and data handling strategies in programming.