Scribd
Upload
23 views6 pages

Queue Operations in Python

Insertion, deletion and updating elements from queue in python.

Uploaded by

Kshitij Maurya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
23 views6 pages

Queue Operations in Python

Insertion, deletion and updating elements from queue in python.

Uploaded by

Kshitij Maurya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 6
ON ODUM BRB WN = 10 11 Wz 13 14 15 16 17 18 19 20 21 22) 23 24 25 #include # define MAX 5 int cqueue_arr[MAX]; int front = -1; int rear = -1; void insert(int item) { if((front == 0 && rear == MAX-1) | | (front == rear+1)) { printf("Queue Overflow \n"); return; + if(front == -1) { front = 0; rear = 0; + else { if(rear == MAX-1) rear = 0; else rear = rear+1; + Caueue arrlfrearl = item : 25 26 Da 28 29 30 31 32 33 34 35) 36 37 38 39: 40 41 42 43 44 45 46 47 48 main.c Output J cqueue_arr[rear] = item ; + void deletion() it if(front == -1) { printf("Queue Under flown"); Return ; + printf("Element deleted from queue is : %d\n",cqueue_arr[front]); if(front == rear) { front = -1; rear=-1; + else { if(front == MAX-1) front = 0; else front = front+1; + + void display() 40 49~ 50 51 52° 53 54 55 56 oy 58 59° 60 61 62 63 64~ 65 66~ 67 68 69 70 7 ia 73 main.c Output vulu ULlsplay() { int front_pos = front,rear_pos = rear; if(front == -1) { printf("Queue is empty\n"); return; t printf("Queue elements :"); if( front_pos <= rear_pos ) while(front_pos <= rear_pos) { printf ("%d ",cqueue_arr[front_pos]); front_pos++; t else { while(front_pos <= MAX-1) { printf("%d ",cqueue_arr[front_pos]); front_pos++; t front_pos = 0; while(front_pos <= rear_pos) { printf("%d ",cqueue_arr[front_pos]); 73 74 U5 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92) 93 94 95 96 97 mai Output printf("%d ",cqueue_arr[front_pos]); front_pos++; + + + int main() { int choice,item; do { printf("1.Insert\n"); printf("2.Delete\n"); printf("3.Display\n"); printf("4.Quit\n"); printf("Enter your choice : "); scanf("%d" ,&choice); switch(choice) rt case 1 printf("Input the element for insertion in queue : "); scanf("%d", &item); insert(item); break; case 2 deletion(): 85 86 87 88 89 90 91 92 93 94 95 96 OF: 98 99 100 101 102 103 104 105 106 107 108 109 printf("3.Display\n"); printf("4.Quit\n"); printf("Enter your choice : "); scanf("%d",&choice); switch(choice) { case 1 printf("Input the element for insertion in queue : "); scanf("%d", &item); insert(item); break; case 2: deletion(); break; case 3: display(); break; case 4: break; default: printf("Wrong choice"); } }while(choice!=4); return 0; 3 /tmp/khLIRrwxU6.o 1.Insert 2.Delete 3.Display 4.Quit Enter your choice : 1 Input the element for insertion in queue : 45 1.Insert 2.Delete 3.Display 4.Quit Enter your choice : 3 Queue elements :45 1.Insert 2.Delete 3.Display 4.Quit Enter your choice : 2 Element deleted from queue is : 45 1.Insert 2.Delete 3.Display 4.Quit Enter your choice : 4

You might also like