From 048bb1f136ce42b3d1526064b8d887b5600ad0a6 Mon Sep 17 00:00:00 2001 From: Kshitij Date: Mon, 16 Oct 2023 20:18:55 +0530 Subject: [PATCH] Completely working queue code (assignment-29) --- assignment-29_test2kska.cpp | 132 ++++++++++++++++++++++++++++++++++++ 1 file changed, 132 insertions(+) create mode 100644 assignment-29_test2kska.cpp diff --git a/assignment-29_test2kska.cpp b/assignment-29_test2kska.cpp new file mode 100644 index 0000000..0046c0d --- /dev/null +++ b/assignment-29_test2kska.cpp @@ -0,0 +1,132 @@ +#include +using namespace std; + +class queue { +// Class for queue. + + int data[30]; + int front,rear; + + public: + queue() { + // Constructor that initialises values for front and rear. + front=-1; + rear=-1; + } + + int emptyCheck() { + // Check if it's empty + if (front==-1) { + return 1; + } + else { + return 0; + } + } + + int fullCheck() { + // Check if it's full + if (rear>=30) { + return 1; + } + else { + return 0; + } + } + + void enqueue(int x) { + // Add job to queue + if (fullCheck()==1) { + cout<>totalJobs; + for (int i=0; i>job; + jobQueue.enqueue(job); + } + + while (1) { + cout< Add job to queue"< Delete a job from queue"< Display queue"< Exit"<>choice; + + switch (choice) { + case 1: + cout<<"Add additional job:\t"; + cin>>job; + jobQueue.enqueue(job); + cout<<"\n==============\n"; + jobQueue.display(); + cout<<"=============\n"; + break; + + case 2: + jobQueue.dequeue(); + cout<<"\n==============\n"; + jobQueue.display(); + cout<<"=============\n"; + break; + + case 3: + cout<<"\n==============\n"; + jobQueue.display(); + cout<<"=============\n"; + break; + + case 4: + cout<<"\n## DESIGNED AND ENGINEERED BY KSHITIJ\n## END OF CODE\n\n"; + exit(0); + + default: + cout<