Descriptio: I am learning about debugging and simulation. however i keep gettings this error line on my code. see the pics
package queuedemo;
class Queue {
int front, rear, size;
int capacity;
int array[];
public Queue(int cap)
{
capacity = cap;
front=size=0;
rear=capacity-1;
array = new int[capacity];
}
// Method to add an item to the queue.
void enqueue(int item)
{
if(isFull()) {
System.out.println("Queue overflow");
return;
}
rear=(rear+1)%capacity;
array[rear]=item;
size=size+1;
}
// Queue is empty when size is 0
boolean isEmpty()
{
return (size == 0);
}
// Queue is full when size becomes equal to the capacity
boolean isFull()
{
return (size == capacity);
}
// Method to remove an item from queue.
int dequeue()
{
if (isEmpty())
System.out.println("Queue Underflow");
return;
}
int item = array[front];
front = (front + 1)% this.capacity;
size = size - 1 ;
return item;
}
// Method to get front of queue
int front()
{
return array[front];
}
// Method to get rear of queue
int rear()
{
return array[rear];
}
}
new file:
package DSA;
public class QueueTester {
public static void main(String[] args){
Queue q = new Queue(5);
q.enqueue(5);
System.out.println("front:"+q.front());
q.enqueue(3);
System.out.println("rear:"+q.rear());
q.enqueue(7);
System.out.println("front:"+q.front());
q.enqueue(9);
System.out.println("rear:"+q.rear());
q.enqueue(11);
System.out.println("front:"+q.front());
System.out.println("rear:"+q.rear());
q.enqueue(15);
q.dequeue();
q.dequeue();
System.out.println("front:"+q.front());
System.out.println("rear:"+q.rear());
q.dequeue();
q.dequeue();
q.dequeue();
q.dequeue();
}
}
Descriptio: I am learning about debugging and simulation. however i keep gettings this error line on my code. see the pics
![70
71
72
73
74
75
76
770
78
79
80
81
82
83
84
V 85
86
87
88
89e
90
91
92
}
// Method to remove an item from queue.
int dequeue( )
{
if (isEmpty())
System.out.println("Queue Underflow");
return;
www
}
int item = array[front]; {;
front = (front + 1)% this.capacity;
93
94
size = size
1 ;
9 95
96
97
return item:
}
98](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F50a55e6d-77cc-4457-96da-84220cda6e59%2F82f6d6a9-f6f8-4f03-9851-87afd9f3d48a%2F59i7pvq_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)