Scribd Logo
Upload

Welcome to Scribd!

  • LatihanQUEUE

    Uploaded by

    Zee Venger
    4 views3 pages
    The document defines a queue data structure and its functions for enqueue, dequeue, display, clear, and check if empty or full. It declares a queue struct with a data array, head, and tail pointers. The main function implements a menu-driven program to test the queue functions by allowing the user to add elements, remove elements, display the queue, clear it, and exit. Functions are defined to initialize the queue, add and remove elements from the front/back, check for empty/full conditions, display the queue elements, and clear it.

    Original Description:

    Original Title

    20100407_LatihanQUEUE

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document defines a queue data structure and its functions for enqueue, dequeue, display, clear, and check if empty or full. It declares a queue struct with a data array, head, and tail pointers. The main function implements a menu-driven program to test the queue functions by allowing the user to add elements, remove elements, display the queue, clear it, and exit. Functions are defined to initialize the queue, add and remove elements from the front/back, check for empty/full conditions, display the queue elements, and clear it.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views3 pages

    LatihanQUEUE

    Uploaded by

    Zee Venger
    The document defines a queue data structure and its functions for enqueue, dequeue, display, clear, and check if empty or full. It declares a queue struct with a data array, head, and tail pointers. The main function implements a menu-driven program to test the queue functions by allowing the user to add elements, remove elements, display the queue, clear it, and exit. Functions are defined to initialize the queue, add and remove elements from the front/back, check for empty/full conditions, display the queue elements, and clear it.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    LATIHAN QUEUE

     Deklarasi QUEUE
    #include <stdio.h>
    #include <conio.h>
    #define MAX 8
    typedef struct{
    int data[MAX];
    int head;
    int tail;
    } Queue;
    Queue antrian;

     Fungsi Main
    main(){
    int pil;
    int data;
    Create();
    do{
    printf("1. Enqueue\n");
    printf("2. Dequeue\n");
    printf("3. Tampil\n");
    printf("4. Clear\n");
    printf("5. Exit\n");
    printf("Pilihan = ");scanf("%d",&pil);
    switch(pil){
    case 1: printf("Data = ");scanf("%d",&data);
    Enqueue(data);
    break;
    case 2: printf("Elemen yang keluar : %d\n",Dequeue());
    break;
    case 3: Tampil();
    printf("\n");
    break;
    case 4: Clear();
    break;
    }
    getch();
    } while(pil!=5);
    }

     Fungsi IsEmpty
    int IsEmpty(){
    if(antrian.tail==-1)
    return 1;
    else
    return 0;
    }
     Fungsi Create
    void Create(){
    antrian.head=antrian.tail=-1;
    }

     Fungsi IsFull
    int IsFull(){
    if(antrian.tail==MAX-1) return 1;
    else return 0;
    }

     Fungsi Enqueue
    void Enqueue(int data){
    if(IsEmpty()==1){
    antrian.head=antrian.tail=0;
    antrian.data[antrian.tail]=data;
    printf("%d masuk!\n",antrian.data[antrian.tail]);
    } else
    if(IsFull()==0){
    antrian.tail++;
    antrian.data[antrian.tail]=data;
    printf("%d masuk!\n",antrian.data[antrian.tail]);
    }
    }

     Fungsi Dequeue
    int Dequeue(){
    int i;
    int e = antrian.data[antrian.head];
    for(i=antrian.head;i<=antrian.tail-1;i++){
    antrian.data[i] = antrian.data[i+1];
    }
    antrian.tail--;
    return e;
    }

     Fungsi Clear
    void Clear(){
    antrian.head=antrian.tail=-1;
    printf("data clear");
    }
    void Tampil(){
    if(IsEmpty()==0){
    for(int i=antrian.head;i<=antrian.tail;i++){
    printf("%d \n",antrian.data[i]);
    }
    }else printf("data kosong!\n");
    }

    You might also like