Add files via upload

Author: coderpheonix

queue1.cpp

@@ -0,0 +1,99 @@
+
+#include <iostream>
+#define MAX 5  // Define the maximum size of the queue
+
+using namespace std;
+
+class Queue {
+    int arr[MAX]; // Array to store queue elements
+    int front, rear; // Indices for the front and rear of the queue
+
+public:
+    // Constructor to initialize the queue
+    Queue() : front(-1), rear(-1) {}
+
+    // Function to check if the queue is full
+    bool isFull()
+
+
+     {
+        return (rear + 1) % MAX == front;
+    }
+
+    // Function to check if the queue is empty
+    bool isEmpty()
+
+
+    {
+        return front == -1;
+    }
+
+    // Function to add an element to the queue
+    void enqueue(int x)
+    {
+    if (isFull())
+        {
+            cout << "Queue is full" << endl;
+            return;
+        }
+
+        if (front == -1) front = 0; // Initialize front if queue is empty
+        rear = (rear + 1) % MAX; // Move rear to the next position
+        arr[rear] = x; // Insert the element
+    }
+
+    // Function to remove an element from the queue
+    int dequeue() {
+        if (isEmpty()) {
+            cout << "Queue is empty" << endl;
+            return -1;
+        }
+        int result = arr[front]; // Store the front element to return
+        if (front == rear) { // Check if the queue becomes empty after dequeue
+            front = rear = -1; // Reset front and rear
+        } else {
+            front = (front + 1) % MAX; // Move front to the next position
+        }
+        return result; // Return the dequeued element
+    }
+
+    // Function to get the front element of the queue
+    int getFront() {
+        if (isEmpty()) {
+            cout << "Queue is empty" << endl;
+            return -1;
+        }
+        return arr[front]; // Return the front element
+    }
+
+    // Function to get the rear element of the queue
+    int getRear() {
+        if (isEmpty()) {
+            cout << "Queue is empty" << endl;
+            return -1;
+        }
+        return arr[rear]; // Return the rear element
+    }
+};
+
+int main() {
+    Queue q; // Create a queue instance
+    q.enqueue(1); // Add elements to the queue
+    q.enqueue(2);
+    q.enqueue(3);
+    q.enqueue(4);
+    q.enqueue(5);
+    q.enqueue(6);  // This will show "Queue is full"
+
+    cout << "Front element: " << q.getFront() << endl; // Display the front element
+    cout << "Rear element: " << q.getRear() << endl; // Display the rear element
+
+    q.dequeue(); // Remove an element from the queue
+    q.enqueue(6); // Add another element to the queue
+
+    while (!q.isEmpty()) { // Print all elements until the queue is empty
+        cout << q.dequeue() << " ";
+    }
+
+    return 0;
+}

stack final.cpp

@@ -0,0 +1,80 @@
+#include <iostream> // Include the input-output stream library
+using namespace std;
+
+#define MAX 5 // Define the maximum size of the stack
+
+// Declare the stack and the top variable
+int stack[MAX], top = -1;
+
+// Function to check if the stack is empty
+bool isEmpty() {
+    // If top is -1, stack is empty
+    return top == -1;
+}
+
+// Function to check if the stack is full
+bool isFull() {
+    // If top is equal to the last index, stack is full
+    return top == MAX - 1;
+}
+
+// Function to push an element onto the stack
+void push(int x) {
+    // Check if the stack is full
+    if (isFull()) {
+        cout << "The stack is full." << endl; // Display a message if the stack is full
+    } else {
+        top++; // Increment the top index
+        stack[top] = x; // Add the new element to the top of the stack
+    }
+}
+
+// Function to pop an element from the stack
+void pop() {
+    // Check if the stack is empty
+    if (isEmpty()) {
+        cout << "The stack is empty." << endl; // Display a message if the stack is empty
+    } else {
+        cout << "Popped element: " << stack[top] << endl; // Display the popped element
+        top--; // Decrement the top index to remove the top element
+    }
+}
+
+// Function to peek the top element of the stack
+int peek() {
+    // Check if the stack is empty
+    if (isEmpty()) {
+        cout << "The stack is empty." << endl; // Display a message if the stack is empty
+        return -1; // Return -1 if the stack is empty
+    } else {
+        return stack[top]; // Return the top element of the stack
+    }
+}
+
+// Function to display the elements of the stack
+void display() {
+    // Check if the stack is empty
+    if (isEmpty()) {
+        cout << "The stack is empty." << endl; // Display a message if the stack is empty
+    } else {
+        cout << "Stack elements: " << endl; // Display a message indicating stack elements
+        // Loop through the stack from top to bottom
+        for (int i = top; i >= 0; i--) {
+            cout << stack[i] << endl; // Print each element of the stack
+        }
+    }
+}
+
+// Main function
+int main() {
+    push(1); // Push 1 onto the stack
+    push(2); // Push 2 onto the stack
+    push(3); // Push 3 onto the stack
+     push(4);
+    display(); // Display the stack elements
+    pop(); // Pop the top element from the stack
+    display(); // Display the stack elements after popping
+    cout << "Top element: " << peek() << endl; // Display the top element of the stack
+    return 0; // Return 0 to indicate successful execution
+}
+