Skip to main content

Queue in C Language

//Simple Queue Implementation In C language
#include<stdio.h>
#define MAX 5
int front=-1;
int rear=-1;
int queue[MAX];

insert()
{
    int i;
    if(rear==(MAX-1))
    {
        printf("\nQueue Overflowed!");
    }else
        {
            printf("\nEnter A Value::");
            scanf("%d",&i);
            queue[++rear]=i;
            if(front==-1)
            {
                front=0;
            }
        }
}

delete()
{
    int i;
    if(rear==-1)
    {
        printf("\nQueue is empty");
    }else
        {
            if(front==rear)
            {
                printf("\nQueue Has Lack Of Elements To Delete");
            }else{
                    i=queue[front];
                    printf("%d has removed",i);
                    front++;
                }
        }
}

clear()
{
    int ch;
    printf("Are you sure to clear the QUEUE? Yes (1) or No (2)");
    scanf("%d",&ch);
    switch(ch)
    {
        case 1:
            front=rear=-1;
            printf("\nQueue has refreshed & cleaned");
    }
}

int main()
{
    int ch,f=0;
    //clrscr();//Optional
    while(f<=1)
    {
        printf("\n1. INSERT VALUE\n2. DELETE VALUE\n3. CLEAR VALUES\n4. EXIT");
        scanf("%d",&ch);
        switch(ch)
        {
            case 1:
                insert();
                //getch(); //Optional
                break;
            case 2:
                delete();
                //getch();//Optional
                break;
            case 3:
                clear();
                //getch();//Optional
                break;
            case 4:
                //exit();//Optional
            default:
                printf("\nWrong Input");
        }
    }
}

Comments

Popular posts from this blog

Java Sample: While loop

public class whilechk1 {     public static void main(String args[])     {         int row,column,y;         System.out.print("\nMultiplication Table\n");         row=1;         do         {             column=1;             do             {                 y=row*column;                 System.out.print("\t"+y);                 column++;             }while(column<=10);             System.out.println("\n");             row++;         }while(row<=10);     } }

A Hit Count Using Java Servlet's Session Tracking

import java.io.*; import javax.servlet.*; import javax.servlet.http.*; public class SessionTracker extends HttpServlet {         public void doGet(HttpServletRequest req,HttpServletResponse res)         throws ServletException,IOException         {                res.setContentType("text/html");                PrintWriter out=res.getWriter();                HttpSession session=req.getSession(true);                Integer count=(Integer)session.getValue("tracker.count");                if(count==null)       ...

Background Process in ORACLE Database

Background Process in ORACLE Database Database Writer Process (DBWn) Log Writer Process (LGWR) Checkpoint Process (CKPT) System Monitor Process (SMON) Process Monitor Process (PMON) Recoverer Process (RECO) Job Queue Processes Archiver Processes (ARCn) Queue Monitor Processes (QMNn) Database Writer Process (DBWn) The database writer process (DBWn) writes the contents of buffers to datafiles. The DBWn processes are responsible for writing modified (dirty) buffers in the database buffer cache to disk. Although one database writer process (DBW0) is adequate for most systems, you can configure additional processes (DBW1 through DBW9 and DBWa through DBWj) to improve write performance if your system modifies data heavily. These additional DBWn processes are not useful on uniprocessor systems. When a buffer in the database buffer cache is modified, it is marked dirty. A cold buffer is a buffer that has not been recently used according to the least recently used (LRU) algorith...