Question

In java

Build a QueueInt class for integers that is compatible with the driver code below. The QueueInt should operate in a FIFO (first in, first out) fashion and implement the variables and methods also listed below: Data Members: Declare and initialize, as needed, the data item(s) you will need to manage a queue of integers. You may only use arrays and primitives for your instance and/or static variables (I,e You can’t use Java defined Queue / Stack / List / ArraryList classes ) Method Members: public void enqueue(int value): This should add the value into the queue. public int dequeue(): This should remove and return the int which was added first. public boolean isEmpty(): Returns true if the queue is empty, false otherwise Driver code: QueueInt testQ = new QueueInt(); testQ. Enqueue(5); testQ. Enqueue(50); testQ. Enqueue(6); System.out.println(test.dequeue()); // it should print 5

Answer 1

Code

QueueInt.java

import java.util.NoSuchElementException;

public class QueueInt
{
protected int Queue[] ;
protected int front, rear, len;
static int size=5;
public QueueInt()
{
len = 0;
Queue = new int[size];
front = -1;
rear = -1;
}
/* Function to check if queue is empty */
public boolean isEmpty()
{
return front == -1;
}
/* Function to check if queue is full */
public boolean isFull()
{
return front==0 && rear == size -1 ;
}
/* Function to Enqueue an element to the queue */
public void Enqueue(int i)
{
if (rear == -1)
{
front = 0;
rear = 0;
Queue[rear] = i;
}
else if (rear + 1 >= size)
throw new IndexOutOfBoundsException("Overflow Exception");
else if ( rear + 1 < size)
Queue[++rear] = i;
len++ ;
}
/* Function to dequeue front element from the queue */
public int dequeue()
{
if (isEmpty())
throw new NoSuchElementException("Underflow Exception");
else
{
len-- ;
int ele = Queue[front];
if ( front == rear)
{
front = -1;
rear = -1;
}
else
front++;
return ele;
}
}
}
main.java

public class main {

/**
* @param args the command line arguments
*/
public static void main(String[] args)
{
QueueInt testQ = new QueueInt();
testQ. Enqueue(5);
testQ. Enqueue(50);
testQ. Enqueue(6);
System.out.println(testQ.dequeue());
}
  
}
output

Queue Integer-NetBeans IDE 8.0.1 Eile Edit View Navigete Source Refgctor Run Debug Profile Team Iools Window Help Search (Ctrl+1) <defoult config> Output Detbupoer ConsoleQueue Integer (un) ル un BUILD SUCCESSFUL (total time: 0 seconds) ④ Notifications Bookmarks Output INS 11:53 O Type here to search rP ^ 4,04.) ENG 27-04-2019号

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.