Page 525 - Computer science 868 Class 12
P. 525
42 System.out.print(ele[i]+" ");
43 i = (i+1) % cap;
44 }
45 }
46 else
47 System.out.println("Queue is empty !");
48 }
49 public static void main(int x)
50 { Scanner sc=new Scanner(System.in);
51 Cqueue ob = new Cqueue(x);
52 int ch;
53 do
54 {
55 System.out.println("1: Add \n 2: Delete \n 3: Display \n 4: Exit \n ");
56 ch=sc.nextInt();
57 switch(ch)
58 {
59 case 1:
60 System.out.print("Enter number to be added: ");
61 int num = sc.nextInt();
62 ob.enque(num);
63 break;
64 case 2:
65 int x1=ob.deque();
66 if(x1==-999)
67 System.out.println("Queue empty");
68 else
69 System.out.println(x1+" deleted");
70 break;
71 case 3:
72 ob.display();
73 break;
74 default:
75 System.out.println("Exit");
523
Data Structures 523

