DSA Lab 13 Program

-

 Program for dynamic implementation of queue.


#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 10

struct Queue {
    int queue[MAX_SIZE];
    int front;
    int rear;
};

int isEmpty(struct Queue *q) {
    return (q->front == -1);
}

int isFull(struct Queue *q) {
    return (q->rear == MAX_SIZE - 1);
}

void enqueue(struct Queue *q, int data) {
    if (isFull(q)) {
        printf("Queue is full\n");
        return;
    }
    if (isEmpty(q)) {
        q->front = 0;
    }
    q->rear++;
    q->queue[q->rear] = data;
    printf("Enqueued %d in queue\n", data);
}

int dequeue(struct Queue *q) {
    if (isEmpty(q)) {
        printf("Queue is empty\n");
        return -1;
    }
    int data = q->queue[q->front];
    if (q->front == q->rear) {
        q->front = -1;
        q->rear = -1;
    } else {
        q->front++;
    }
    printf("Dequeued %d from queue\n", data);
    return data;
}

void displayQueue(struct Queue *q) {
    if (isEmpty(q)) {
        printf("Queue is empty\n");
        return;
    }
    for (int i = q->front; i <= q->rear; i++) {
        printf("%d -> ", q->queue[i]);
    }
    printf("NULL\n");
}

int main() {
    struct Queue *q = malloc(MAX_SIZE * sizeof(struct  Queue));
    q->front = -1;
    q->rear = -1;
    enqueue(q, 10);
    enqueue(q, 20);
    enqueue(q, 30);
    printf("Queue: ");
    displayQueue(q);
    dequeue(q);
    printf("Queue after dequeue: ");
    displayQueue(q);
    return 0;
}
#Output Enqueued 10 in queue Enqueued 20 in queue Enqueued 30 in queue Queue: 10 -> 20 -> 30 -> NULL Dequeued 10 from queue Queue after dequeue: 20 -> 30 -> NULL

Comments

Post a Comment

Popular posts from this blog

Keyword , Identifier, Indentation, Comments & Documentation

-
Keyword : In Python, a  keyword  is a special word that has a specific meaning and purpose in the language. These words are reserved, which means you can’t use them for anything other than their intended purpose. For example, you can’t use a keyword as a variable name. Here are a few examples of Python keywords and what they do: if : Used to make a decision. For example,  if x > 0: . for : Used to create a loop. For example,  for i in range(10): . def : Used to define a function. For example,  def my_function(): . True  and  False : Represent boolean values.  I dentifier : In Python, an  identifier  is simply a name you give to things like variables, functions, classes, or modules. It’s like a label that helps you refer to these elements in your code. Here are some key points about identifiers: Must start with a letter or an underscore (_) : For example,  name ,  _value . Cannot start with a number : For example,  1name...
Read more

DSA Lab 8 program

-
 Program for implementing multiple stack. # include < stdio.h > # include < stdlib.h > struct stack {     int maxstack;     int * stack;     int top; }; int isEmpty ( struct stack * ptr ) {     if ( ptr -> top == - 1 ) {         return 1 ;     } else {         return 0 ;     } } int isFull ( struct stack * ptr ) {     if ( ptr -> top == ptr -> maxstack - 1 ) {         return 1 ;     } else {         return 0 ;     } } int peek ( struct stack * ptr ) {     return ptr -> stack [ ptr -> top ]; } int pop ( struct stack * ptr ) {     if ( isEmpty (ptr) ) {         printf ( " Stack Underflow! Cannot pop from the stack \n " ) ;         return - 1 ;     } else {         in...
Read more

DSA Lab 7 Program

-
 Program for implementing Stack using array # include < stdio.h > int maxstack = 10 ; int stack [ 10 ]; int top = - 1 ; int empty (){     if (top == - 1 ){         return 1 ;     }     else {         return 0 ;     } } int full (){     if (top == maxstack){         return 1 ;     }     else {         return 0 ;     } } int peek (){     return stack [top]; } int pop (){     int data;     if ( ! empty () ){         data = stack [top];         top -= 1 ;         printf ( " The data has been Deleted. Your data is %d \n " , data) ;         return data;     }     else {         printf ( " The data Can't be Deleted. Becouse stack is empty \n " ) ;   ...
Read more