class Queue {      private static int front, rear, capacity;  private static int queue[];  Queue(int c)  {   front = rear = 0;   capacity = c;   queue = new int[capacity];  }  static void queueEnqueue(int data)  {   if (capacity == rear) {    System.out.printf("\nQueue is full\n");    return;   }      else {    queue[rear] = data;    rear++;   }   return;  }  static void queueDequeue()  {      if (front == rear) {    System.out.printf("\nQueue is empty\n");    return;   }   else {    for (int i = 0; i < rear - 1; i++) {     queue[i] = queue[i + 1];    }        if (rear < capacity)     queue[rear] = 0;        rear--;   }   return;  }    static void queueDisplay()  {   int i;   if (front == rear) {    System.out.printf("\nQueue is Empty\n");    return;   }      for (i = front; i < rear; i++) {    System.out.printf(" %d <-- ", queue[i]);   }   return;  }    static void queueFront()  {   if (front == rear) {    System.out.printf("\nQueue is Empty\n");    return;   }   System.out.printf("\nFront Element is: %d", queue[front]);   return;  } } public class StaticQueueinjava {    public static void main(String[] args)  {      Queue q = new Queue(4);      q.queueDisplay();     q.queueEnqueue(20);   q.queueEnqueue(30);   q.queueEnqueue(40);   q.queueEnqueue(50);      q.queueDisplay();      q.queueEnqueue(60);     q.queueDisplay();   q.queueDequeue();   q.queueDequeue();   System.out.printf("\n\nafter two node deletion\n\n");      q.queueDisplay();      q.queueFront();  } }   ((I need the pseudocode of this code)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

 

class Queue {

     private static int front, rear, capacity;
 private static int queue[];

 Queue(int c)
 {
  front = rear = 0;
  capacity = c;
  queue = new int[capacity];
 }


 static void queueEnqueue(int data)
 {

  if (capacity == rear) {
   System.out.printf("\nQueue is full\n");
   return;
  }

  
  else {
   queue[rear] = data;
   rear++;
  }
  return;
 }


 static void queueDequeue()
 {
  
  if (front == rear) {
   System.out.printf("\nQueue is empty\n");
   return;
  }


  else {
   for (int i = 0; i < rear - 1; i++) {
    queue[i] = queue[i + 1];
   }

   
   if (rear < capacity)
    queue[rear] = 0;

   
   rear--;
  }
  return;
 }

 
 static void queueDisplay()
 {
  int i;
  if (front == rear) {
   System.out.printf("\nQueue is Empty\n");
   return;
  }

  
  for (i = front; i < rear; i++) {
   System.out.printf(" %d <-- ", queue[i]);
  }
  return;
 }

 
 static void queueFront()
 {
  if (front == rear) {
   System.out.printf("\nQueue is Empty\n");
   return;
  }
  System.out.printf("\nFront Element is: %d", queue[front]);
  return;
 }
}

public class StaticQueueinjava {

 
 public static void main(String[] args)
 {
  
  Queue q = new Queue(4);

  
  q.queueDisplay();

 
  q.queueEnqueue(20);
  q.queueEnqueue(30);
  q.queueEnqueue(40);
  q.queueEnqueue(50);

  
  q.queueDisplay();

  
  q.queueEnqueue(60);

 
  q.queueDisplay();

  q.queueDequeue();
  q.queueDequeue();
  System.out.printf("\n\nafter two node deletion\n\n");

  
  q.queueDisplay();

  
  q.queueFront();
 }
}

 

((I need the pseudocode of this code)

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education