Skip to main content

SIMPLE QUEUE

/**
    Program Name: SIMPLE QUEUE

    Description: This program is for Implementing Simple QUEUE

    Author:  Tauqirul Haque
       
*/


#define SIZE 3

int front = -1;
int rear = -1;


int queue[SIZE];

void deleteElement();
void insertElement();
void displayElement();

void main()
{
    int ch;
    while(ch !=4)
    {
        printf("\n\t\t1. Insert into queue..\n");
        printf("\t\t2. Delete From Queue...\n");
        printf("\t\t3. Diplay Queue...\n");
        printf("\t\t4. Exit Program ...\n");
       
        printf("Enter Your Choice #  ");
        scanf("%d",&ch);
       
        switch(ch)
        {
            case 1:
                    insertElement();
                    break;
            case 2:
                    deleteElement();
                    break;
            case 3:
                    displayElement();
                    break;
            case 4:
                    exit(0);
        }
    }
}

void insertElement()
{
    int item;
   
    printf("Enter The Item You want to Insert :  ");
    scanf("%d",&item);
   
    if(rear == SIZE -1)
    {
        printf("\n Queue OVERFLOW ... \n\n");
        return ;
    }
   
    rear++;
    queue[rear] = item;
   
    if(front == -1)
    {
        front++;
    }
}

void deleteElement()
{
    if(front == -1)
    {
        printf("\n\nQueue Empty... UNDERFLOW\n\n");
        return;
    }
   
    printf("\n The Element to be Deleted is :  %d ",queue[front]);
    if(front == rear)
    {
        front = rear = -1;
    }
    else
    {
        front++;
    }
}

void displayElement()
{
    int i;
    if(front == -1)
    {
        printf("\n QUEUE is EMPTY .. no item to display...\n");
        return;
    }
    else
        {
        printf("\nTHE ELEMENTS ARE ... \n ");
        for(i=front; i<=rear; i++)
        {
            printf("%5d",queue[i]);
        }
    }
    printf("\n\n");
}
       
       

Comments

Popular posts from this blog

Singly Linked List

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...

SWAP Two Values without using temporary variable

/**     Program Name: Swap Two Numbers     Description: This Program swaps two number, using XOR     Author:  Tauqirul Haque        */ #include <stdio.h> #include <conio.h> int main() {     int firstNumber, secondNumber;        printf("Enter The First Number :  ");     scanf("%d",&firstNumber);        printf("\nEnter The Second Number :  ");     scanf("%d",&secondNumber);        printf("\n\nNumbers Before Swapping :  %d  <-> %d \n",firstNumber, secondNumber);        firstNumber = firstNumber^secondNumber;     secondNumber = firstNumber^secondNumber;     firstNumber = firstNumber^secondNumber;        printf("\nNumbers After Swapping : ...

Linux User Survey

The most popular distro is Mandriva, with 17.9% of the respondents using it, followed by Suse, with 16.2%. The most popular application is Firefox, with 47.9% of the respondents using it, followed by OpenOffice, with 31.6% and Thunderbird, with 12.0%. Also appended below is a table with the break-down of the survey participants by country. Top Distros 1 Mandriva 17.9% 2 Suse 16.2% 3 Fedora 11.1% 4 Debian 7.7% 5 Red Hat 6.8% 6 Xandros 5.1% 7 Slackware 5.1% 8 Ubuntu 3.4% 9 Centos 3.4% 10 Mepis 3.4% 11 Gentoo 3.4% 12 Knoppix 2.6% 13 Linspire 1.7% 1...