Group B - Queue by Ramlah Mailok

Queue - Ramlah Mailok

ramlahmailok — 2015-11-02 02:40:40 UTC

1. FIFO

2. Pointer - rear and front

3. method - dequeue (insert) and enqueue (delete)

- insertion from rear

- deletetion from front

4. Application - queue in counter (post office)

full coding - Ramlah Mailok

ramlahmailok — 2015-11-02 02:43:51 UTC

#include

using namespace std;

struct QUEUE{

int data;

QUEUE * next;

}*frontptr, *rearptr;

//atau

//QUEUE *frontptr;

//QUEUE *rearptr;

void ciptaQueuekosong();

void enqueue(int); // insertion data

void dequeue(); // deletion data

void removeALL();

int main(){

ciptaQueuekosong();

enqueue(15); // fisrt data

enqueue(17);

enqueue(19);

dequeue();

enqueue(20);

removeALL();

}

void ciptaQueuekosong(){

frontptr= NULL;

rearptr = NULL;

}

void enqueue(int val){

QUEUE * newptr;

newptr = new QUEUE;

newptr ->data = val;

newptr->next = NULL;

if (rearptr== NULL){

rearptr = newptr;

frontptr = newptr;

}

else {

rearptr->next = newptr;

rearptr = newptr;

}

cout<data<<"->";

}

void dequeue(){

QUEUE *temptr;

if(frontptr == NULL)

cout<< "empty queue";

else{

temptr = frontptr;

frontptr = frontptr->next;

delete temptr;}

}

void removeALL(){

while (frontptr!=NULL)

dequeue();

}

2015-11-02 03:36:29 UTC

struct QUEUE{

int data;
QUEUE *next;
} *frontptr, *rearptr;

A

2015-11-02 04:15:03 UTC

int

coding baru

2015-11-02 04:35:19 UTC

#include #include struct QUEUE{ string nama; int umur; string kursus; QUEUE * next; }*frontptr, *rearptr; //atau //QUEUE *frontptr; //QUEUE *rearptr; void ciptaQueuekosong(); void enqueue(string,int,string ); // insertion data void dequeue(); // deletion data void removeALL(); int main(){ ciptaQueuekosong(); //enqueue(); // fisrt data enqueue("siti", 17, "MTS"); //enqueue(19); dequeue(); //enqueue(20); removeALL(); } void ciptaQueuekosong(){ frontptr= NULL; rearptr = NULL; } void enqueue(string name,int age, string course){ QUEUE * newptr; newptr = new QUEUE; newptr -> nama = name; newptr -> umur = age; newptr -> kursus = course; newptr->next = NULL; if (rearptr == NULL){ rearptr = newptr; frontptr = newptr; } else { rearptr->next = newptr; rearptr = newptr; } cout <nama<<","<< rearptr->umur <<"," << rearptr->kursus; } void dequeue(){ QUEUE *temptr; if(frontptr == NULL) cout<< "empty queue"; else{ temptr = frontptr; frontptr = frontptr->next; delete temptr;} } void removeALL(){ while (frontptr!=NULL) dequeue(); }

Alif Ghani & Ashraf

2015-11-02 04:37:55 UTC

#include #include using namespace std; struct QUEUE{ string nama; int umur; string kursus; QUEUE * next; }*frontptr, *rearptr; //atau //QUEUE *frontptr; //QUEUE *rearptr; void ciptaQueuekosong(); void enqueue(string,int,string); // insertion data void dequeue(); // deletion data void removeALL(); int main(){ ciptaQueuekosong(); enqueue("alif ghani", 22,"AT47"); // fisrt data enqueue("acab",21,"AT47"); enqueue("von",22,"AT47"); dequeue(); enqueue("dayah",24,"AT47"); removeALL(); } void ciptaQueuekosong(){ frontptr= NULL; rearptr = NULL; } void enqueue(string name,int age,string kos){ QUEUE * newptr; newptr = new QUEUE; newptr ->nama=name; newptr ->umur=age; newptr ->kursus=kos; newptr->next = NULL; if (rearptr== NULL){ rearptr = newptr; frontptr = newptr; } else { rearptr->next = newptr; rearptr = newptr; } cout<nama<<","<umur<<","<kursus; } void dequeue(){ QUEUE *temptr; if(frontptr == NULL) cout<< "empty queue"; else{ temptr = frontptr; frontptr = frontptr->next; delete temptr;} } void removeALL(){ while (frontptr!=NULL) dequeue(); }