C PROGRAM - Queue Implementation using Array

 

// Queue Implementation using Array

 

#include<stdio.h>

int rear,front,queue[20],n;

void create()

  {

     rear=0,front=0;

     printf("Enter the capacity of the queue: ");

     scanf("%d",&n);

     printf("Queue is created \n");

  }

 

  void insert()

  {

     if(rear >= n)

            printf("Queue is full\n");

     else

            printf("Enter the element to insert: ");

            scanf("%d",&queue[rear]);

            rear++;

  }

 

  void del()

  {

     if(front == rear)

            printf("Queue is empty\n");

     else

            printf("%d is deleted from Queue\n", queue[front]);

            front++;

  }

 

  void list()

  {

     int i;

     if(front == rear)

            printf("Queue is empty\n");

     else

     {

            printf("Element of the Queue is\n");

            for(i=front; i<rear; i++)

               printf("%d\t",queue[i]);

     }

  }

 

 

  void modify()

  {

     int key;

     printf("Enter the element to be modified: ");

     scanf("%d",&key);

     queue[rear-1] = key;

     printf("Modification is done\n");

  }

 

void main()

{

  int ch;

  clrscr();

 

  printf("Queue Implementation using Array\n");

  printf(“-------------------------------------------\n”);

  printf("\t Main Menu \n");

  printf("\t ********* \n");

  printf("\t 1. Creation \n");

  printf("\t 2. Insertion \n");

  printf("\t 3. Deletion \n");

  printf("\t 4. Modification \n");

  printf("\t 5. Listing of elements \n");

  printf("\t 6. Exit\n");

 

  do

  {

    printf("\nEnter your choice[1...6]: ");

    scanf("%d",&ch);

    switch(ch)

    {

            case 1: create(); break;

            case 2: insert(); break;

            case 3: del(); break;

            case 4: modify(); break;

            case 5: list(); break;

            case 6: end(); break;

            default: printf("Enter your option correctly \n");

    }

  }while(ch!=6);

}

 

 

 

 

 

OUTPUT:

 

Queue Implementation using Array

-------------------------------------------

         Main Menu

         *********

         1. Creation

         2. Insertion

         3. Deletion

         4. Modification

         5. Listing of elements

         6. Exit

 

Enter your choice[1...6]: 1

Enter the capacity of the queue: 5

Queue is created

 

Enter your choice[1...6]: 2

Enter the element to insert: 10

 

Enter your choice[1...6]: 2

Enter the element to insert: 20

 

Enter your choice[1...6]: 2

Enter the element to insert: 30

 

Enter your choice[1...6]: 5

Element of the Queue is

10      20      30

 

Enter your choice[1...6]: 4

Enter the element to be modified: 40

Modification is done

 

Enter your choice[1...6]: 5

Element of the Queue is

10      20      40

Enter your choice[1...6]: 3

10 is deleted from Queue

 

Enter your choice[1...6]: 3

20 is deleted from Queue

 

Enter your choice[1...6]: 3

40 is deleted from Queue

 

Enter your choice[1...6]: 3

Queue is empty

 

Enter your choice[1...6]:

Comments

Post a Comment

Popular posts from this blog

Backtracking - N-Queens Problem, Sum of Subsets, Graph Colouring, Hamiltonian Cycle

Image
UNIT - V : BACKTRACKING General Method – 8-Queens Problem – Sum Of Subsets – Graph Coloring –  Hamiltonian Cycles General Method Backtracking is a problem-solving technique used in algorithms to find solutions by exploring all possible options. In backtracking, a state-space tree is a tree-like structure that represents all possible states (solutions or non-solutions) of a problem. Backtracking algorithms explore this tree using a depth-first search approach, systematically checking each path until a solution is found or all possibilities have been exhausted.  Here’s how it works, step-by-step: Start with a choice : Make a decision and move forward. Check feasibility : If this choice leads to a solution or partial solution, continue. If not, stop exploring this path. Go back and try a different path : If you reach a dead end, go back to the last point where you made a choice. Try a different path from there. Repeat until you find a solution ...
Read more

Divide and Conquer Technique - Binary Search, Quick Sort, Merge Sort

Image
  UNIT II - DIVIDE AND CONQUER TECHNIQUE General Method – Binary Search – Merge Sort – Quick Sort.  GENERAL METHOD The divide and conquer technique is a problem-solving approach that works in three main steps: 1.       Divide : Break down a large problem into smaller, simpler sub-problems. 2.       Conquer : Solve each of the sub-problems individually. This can often be done recursively if the sub-problems are still large. 3.     Combine : Combine the solutions of the sub-problems to get the solution to the original, larger problem. This approach is commonly used in algorithms like binary search, merge sort and quick sort, where breaking down a problem makes it easier and faster to solve.   BINARY SEARCH Binary search is an efficient algorithm for finding a target value within a sorted list. Here’s how it works: Start in the Middle : Look at the middle element of the list. Compare : ...
Read more

GRAPH THEORY

Image
  GRAPH THEORY DEFINITION A graph G = (V, E) consists of a non-empty set V, called the set of vertices (points, nodes) and a set  of ordered or unordered pairs of elements of V, called the edges E set (links), such that there is a mapping from the set E to the set of ordered or unordered pairs of elements of V. Example In the first graph, V = { A , B , C , D } E = {(A,B) , (A,C) , (A,D), (B,C), (B,D) , (C,D)} In the second graph, V = { E, F, G } E = {(F,E) , (E,G) , (G,F)} If an edge e ∈ E is associated with an ordered pair (u,v) or an unordered pair (u,v), where u,v ∈ V, then e is said to connect or join the nodes u and v.  The edge e that connects the nodes u and v is said to be incident on each of the nodes.  The pair of each node that is connected by an edge is called adjacent nodes . Isolated Nodes If any node has no edges connected with any other node then its degree will be zero(0) and it will be called as isolated node. Adjacent Nodes Her...
Read more