Reply to thread

Message

<blockquote data-quote="Anonymous_Abstract" data-source="post: 24659406" data-attributes="member: 568286">&nbsp; Circular Queue in Javapackage com.benz.test;import java.util.Scanner;public class Cqueue {&nbsp; &nbsp; &nbsp; &nbsp; private int size;&nbsp; &nbsp; private int rear,front;&nbsp; &nbsp; private int[] cqueu=null;&nbsp; &nbsp; private boolean exit=false;&nbsp; &nbsp; Scanner sc=null;&nbsp; &nbsp; public Cqueue(int size,int rear,int front)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; this.size=size;&nbsp; &nbsp; &nbsp; &nbsp; this.front=front;&nbsp; &nbsp; &nbsp; &nbsp; this.rear=rear;&nbsp; &nbsp; &nbsp; &nbsp; cqueu=new int[this.size];&nbsp; &nbsp; }&nbsp; &nbsp; public void show()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; while(exit==false)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sc= new Scanner(System.in);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;1. Enqueue&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;2. Dequeue&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;3. Display&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;4. Exit&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Enter your choice&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int x = sc.nextInt();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; switch(x)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 1:System.out.println(&quot;Enter a Value&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; enqueue(sc.nextInt());break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 2:dequeue();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 3:display();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 4:exit();break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; default:System.out.println(&quot;Invalid Input&quot;);break;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void exit()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Program is Exited&quot;);&nbsp; &nbsp; &nbsp; &nbsp; exit = true;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; public void enqueue(int value)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; if(rear==size-1 &amp;&amp; front==0 || front==rear+1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; System.out.println(&quot;Queue is Overflow&quot;);&nbsp; &nbsp; &nbsp; &nbsp; else if(rear==-1 &amp;&amp; front==-1)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; front=rear=0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cqueu[rear]=value;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(value +&quot; is inserted&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }else if(rear==size-1 &amp;&amp; front !=0)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rear=0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cqueu[rear]=value;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(value +&quot; is inserted&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rear++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cqueu[rear]=value;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(value +&quot; is inserted&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void dequeue()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; if(front==-1 &amp;&amp; rear==-1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Queue is Empty&quot;);&nbsp; &nbsp; &nbsp; &nbsp; else if(front==rear)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int del=cqueu[front];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(del+&quot; is deleted&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; front=rear=-1;&nbsp; &nbsp; &nbsp; &nbsp; }else if(front==size-1)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int del=cqueu[front];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(del+&quot; is deleted&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; front=0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int del=cqueu[front];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(del+&quot; is deleted&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; front +=1;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public void display()&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; if(rear==-1 &amp;&amp; front==-1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.println(&quot;Queue is Empty&quot;);&nbsp; &nbsp; &nbsp; &nbsp; else if(rear &gt;=front)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int i=front;i&lt;=rear;i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(cqueu+&quot;\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(&quot;\n&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int i=front;i&lt;size;i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(cqueu+&quot;\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(int i=0;i&lt;=rear;i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(cqueu+&quot;\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; System.out.print(&quot;\n&quot;);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; public static void main(String[] args)&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; Cqueue que= new Cqueue(6,-1,-1);&nbsp; &nbsp; &nbsp; &nbsp; que.show();&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; }</blockquote>

[QUOTE="Anonymous_Abstract, post: 24659406, member: 568286"] [SIZE="4"] Circular Queue in Java[/SIZE] [COLOR="Blue"][SIZE="4"] package com.benz.test; import java.util.Scanner; public class Cqueue { private int size; private int rear,front; private int[] cqueu=null; private boolean exit=false; Scanner sc=null; public Cqueue(int size,int rear,int front) { this.size=size; this.front=front; this.rear=rear; cqueu=new int[this.size]; } public void show() { while(exit==false) { sc= new Scanner(System.in); System.out.println("1. Enqueue"); System.out.println("2. Dequeue"); System.out.println("3. Display"); System.out.println("4. Exit"); System.out.println("Enter your choice"); int x = sc.nextInt(); switch(x) { case 1:System.out.println("Enter a Value"); enqueue(sc.nextInt());break; case 2:dequeue();break; case 3:display();break; case 4:exit();break; default:System.out.println("Invalid Input");break; } } } public void exit() { System.out.println("Program is Exited"); exit = true; } public void enqueue(int value) { if(rear==size-1 && front==0 || front==rear+1) System.out.println("Queue is Overflow"); else if(rear==-1 && front==-1) { front=rear=0; cqueu[rear]=value; System.out.println(value +" is inserted"); }else if(rear==size-1 && front !=0) { rear=0; cqueu[rear]=value; System.out.println(value +" is inserted"); }else { rear++; cqueu[rear]=value; System.out.println(value +" is inserted"); } } public void dequeue() { if(front==-1 && rear==-1) System.out.println("Queue is Empty"); else if(front==rear) { int del=cqueu[front]; System.out.println(del+" is deleted"); front=rear=-1; }else if(front==size-1) { int del=cqueu[front]; System.out.println(del+" is deleted"); front=0; }else { int del=cqueu[front]; System.out.println(del+" is deleted"); front +=1; } } public void display() { if(rear==-1 && front==-1) System.out.println("Queue is Empty"); else if(rear >=front) { for(int i=front;i<=rear;i++) { System.out.print(cqueu[i]+"\t"); } System.out.print("\n"); }else { for(int i=front;i<size;i++) { System.out.print(cqueu[i]+"\t"); } for(int i=0;i<=rear;i++) { System.out.print(cqueu[i]+"\t"); } System.out.print("\n"); } } public static void main(String[] args) { Cqueue que= new Cqueue(6,-1,-1); que.show(); } } [/i][/i][/i][/SIZE][i][i][i][/i][/i][/i][/COLOR][i][i][i][/i][/i][/i] [/QUOTE]

Verification

Hata thunen beduwama keeyada? (60 bedeema thuna)

Search

Latest ads

Reply to thread