Looking for a Tutor Near You?

Post Learning Requirement »
x

Choose Country Code

x

Direction

x

Ask a Question

x

x
x
For better view click here
x
Hire a Tutor
DISCOVER

Data Structure

Loading...

Published in: C / C++
2,090 Views

C Programmings of Data Structure with output.

Sayantan A / Kolkata

8 years of teaching experience

Qualification: M.Tech

Teaches: Chemistry, Computer Science, Mathematics, Physics, GATE Exam, JEXPO, MCA Entrance Exam (JECA), Polytechnic Entrance, Computer, IT

Contact this Tutor
  1. Q.IO: Menu Driven Program in C to implement circular queue using insertion, deletion and display operations #include #define size 7 int insert(int [l,int); void Display(int[l,int,int); int del(int int arr[sizel,front=-l,rear=-l; void main() int item,res,choice; do printf(I'\nCircuIar Queue Menu:\n 1.1nsertion\n2.DeIetion\n3.DispIay\n4.Exit\n"); printf("Enter your choice: \n"); scanf("%d" &choice); switch(choice) case 1: printf("Enter item for Insertion\n"); scanf("%d" &item); res=insert(arr,item); if(res==-l) printf(I'OverfIow!!")• break; case 2: item=del(arr); printf("element deleted is item); break; case 3: Display(arr,front,rear); break; case 4: break; default: printf("invalid choice"); break; }whiIe(choice!=4); int insert(int element) {if((front==O && rear==size-l)l I (front==rear+l)) return -1; else if(rear==-l) front=rear=O; else if(rear==size-l) rear=O; else rear++; arr[rearl=element;
  2. return O; void Display(int arr[l,int front, int rear) int i=O; printf("CircuIar Queue is:\n"); if(front==-l) return; if(rear>=front) for(i=O;i
  3. OUTPUT : Circular Queue Menu: l.lnsertion 2.DeIetion 3.DispIay 4. Exit Enter your choice: 1 Enter item for Insertion 11 Circular Queue Menu: l.lnsertion 2.DeIetion 3.DispIay 4.Exit Enter your choice: 1 Enter item for Insertion 21 Circular Queue Menu: l.lnsertion 2.DeIetion 3.DispIay 4.Exit Enter your choice: 1 Enter item for Insertion 31 Circular Queue Menu: l.lnsertion 2.DeIetion 3.DispIay 4. Exit Enter your choice: 3 Circular Queue is: 11 21 31 Circular Queue Menu: l.lnsertion
  4. 2.DeIetion 3.DispIay 4.Exit Enter your choice: 2 element deleted is 11 Circular Queue Menu: l.lnsertion 2.DeIetion 3.DispIay 4.Exit Enter your choice: 2 element deleted is 21 Circular Queue Menu: l.lnsertion 2.DeIetion 3.DispIay 4.Exit Enter your choice: 3 Circular Queue is: 31

Need a Tutor or Coaching Class?

Post an enquiry and get instant responses from qualified and experienced tutors.

Post Requirement

Related Study Notes

Upload Study Notes

If you have your own Study Notes which you think can benefit others, please upload on LearnPick. For each approved Study Note you will get 100 Credit Points and 100 Activity Score which will increase your profile visibility.

Upload Now
Home > Study Notes > Data Structure