Exercise #5 What is the output of the following code? import java.util.LinkedList; import java.util.Queue; public class QueueExample { public static void main(String[] args) { Queueq = new LinkedList ); for (int i = 0; i < 5; i++) q.add(i); System.out.println("Elements of queue "+ q); int removedele=q.remove(); System.out.println("removed element-"+ removedele); removedele = q.remove(); System.out.println("removed element-"+ removedele); q.add(1); System.out.println(q); int head = q.peek(); System.out.println("head of queue-"+ head); int size = q.size(); System.out.println("Size of queue-"+ size); }

Exercise #5 What is the output of the following code? import java.util.LinkedList; import java.util.Queue; public class QueueExample { public static void main(String[] args) { Queueq = new LinkedList ); for (int i = 0; i < 5; i++) q.add(i); System.out.println("Elements of queue "+ q); int removedele=q.remove(); System.out.println("removed element-"+ removedele); removedele = q.remove(); System.out.println("removed element-"+ removedele); q.add(1); System.out.println(q); int head = q.peek(); System.out.println("head of queue-"+ head); int size = q.size(); System.out.println("Size of queue-"+ size); }

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

See similar textbooks

Similar questions

QUESTION 9 Write a complete Java program to implement a QUEUE in a bank using LinkedList class as follows: • Provide the menu as shown below; use an infinite loop; stop when user opts 4. 1. Add a customer 2. Remove a customer 3. Show the queue 4. Exit • Add a customer should add an int number at the end of queue using the method addLast(). • Remove a customer should delete the int from front using the method removeFirst(). Show the queue should display the numbers in queue using the method System.out.printIn(). For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).
see image for instructions and use starter code below import java.util.Scanner;import java.util.LinkedList; public class ShoppingList { public static void main (String[] args) { Scanner scnr = new Scanner(System.in); // TODO: Declare a LinkedList called shoppingList of type ListItem String item; // TODO: Scan inputs (items) and add them to the shoppingList LinkedList // Read inputs until a -1 is input // TODO: Print the shoppingList LinkedList using the printNodeData() method }}
please fix code to match "enter patients name in lbs" thank you import java.util.LinkedList;import java.util.Queue;import java.util.Scanner; interface Patient { public String displayBMICategory(double bmi); public String displayInsuranceCategory(double bmi);} public class BMI implements Patient { public static void main(String[] args) { /* * local variable for saving the patient information */ double weight = 0; String birthDate = "", name = ""; int height = 0; Scanner scan = new Scanner(System.in); String cont = ""; Queue<String> patients = new LinkedList<>(); // do while loop for keep running program till user not entered q do { System.out.print("Press Y for continue (Press q for exit!) "); cont = scan.nextLine(); if (cont.equalsIgnoreCase("q")) { System.out.println("Thank you for using BMI calculator"); break;…
Exercise #5 What is the output of the following code? а. import java.util.LinkedList; import java.util.Queue; public class QueueExample { public static void main(String[] args) Queueq=new LinkedList(); for (int i = 0; i <7; i+=2) q.add(i); System.out.println("Elements of queue "+ q); int e = q.remove(); System.out.println("removed element-"+ e); e = q.remove(); System.out.println("removed element-"+ e); q.add(4); System.out.println(q); int head = q.peek(); System.out.println("head of queue-"+ head); System.out.println(q); int size = q.size(); System.out.println("Size of queue-"+ size);
please convert this into c++ import java.util.Iterator;import java.util.NoSuchElementException; public class Queue<Item> implements Iterable<Item> { private int n; // number of elements on queue private Node first; // beginning of queue private Node last; // end of queue // helper linked list class private class Node { private Item item; private Node next; } /** * Initializes an empty queue. */ public Queue() { first = null; last = null; n = 0; } /** * Returns true if this queue is empty. * * @return {@code true} if this queue is empty; {@code false} otherwise */ public boolean isEmpty() { return first == null; } /** * Returns the number of items in this queue. * * @return the number of items in this queue */ public int size() { return n; } /** * Returns the number of items in this queue. * * @return the…
Analyze the following code: import java.util.*; public class Test { public static void main(String[] args) { PriorityQueue queue = } } new PriorityQueue( Arrays.asList(60, 10, 50, 30, 40, 20)); for (int i: queue) System.out.print(i + "); The program displays 60 10 50 30 40 20 The program displays 10 20 30 40 50 60 The program displays 60 50 40 30 20 10 There is no guarantee that the program displays 10 20 30 40 50 60
public class Queue {public static void main(String[] args) {}public int[] arr;int count=0;int top=0;int size=4;int queue[]=new int[size];Queue(int size){arr=new int[size];}void enqueue(int val){if(count==arr.length){System.out.println("Queue is full");}else{arr[count]=val;count++;}}int dequeue(){if(count==0){System.out.print("stack is empty"); return -1;}else{count--;return arr[top++];}}int peek(){if(count==0){System.out.print("queue is empty"); return -1;}return arr[count-1];} public boolean isempty(){if(count==0){System.out.println("Queue is empty");return true;}return false;}public void display(){for (int i = 0; i < queue.length; i++) {System.out.println("Queue [" + i + "] " + queue[i]);}}} (I need the algorithm of this code)
Create Pseudocode for this 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…
In java by using this Queue class: public class Queue {private int rear, front;private Object[] elements;Queue(int capacity) {elements = new Object[capacity];rear = -1;front = 0;}void enqueue(Object data) {if (isFull()) {System.out.println("Queue overflow");} else {rear = (rear + 1) % elements.length;elements[rear] = data;}}Object dequeue() {if (isEmpty()) {System.out.println("Queue empty");return null;} else {Object retData = elements[front];elements[front] = null;front = (front + 1) % elements.length;return retData;}}Object peek() {if (isEmpty()) {System.out.println("Queue is empty");return null;} else {return elements[front];}}boolean isEmpty() {return elements[front] == null;}boolean isFull() {return (front == (rear + 1) % elements.length &&elements[front] != null && elements[rear] != null);}int size() {if (rear >= front) {return rear - front + 1;} else if (elements[front] != null) {return elements.length - (front - rear) + 1;} else {return 0;}}void…
Draw a UML class diagram for the following code: import java.util.*; public class QueueOperationsDemo { public static void main(String[] args) { Queue<String> linkedListQueue = new LinkedList<>(); linkedListQueue.add("Apple"); linkedListQueue.add("Banana"); linkedListQueue.add("Cherry"); System.out.println("Is linkedListQueue empty? " + linkedListQueue.isEmpty()); System.out.println("Front element: " + linkedListQueue.peek()); System.out.println("Removed element: " + linkedListQueue.remove()); System.out.println("Front element after removal: " + linkedListQueue.peek()); Queue<Integer> arrayDequeQueue = new ArrayDeque<>(); arrayDequeQueue.add(10); arrayDequeQueue.add(20); arrayDequeQueue.add(30); System.out.println("Is arrayDequeQueue empty? " + arrayDequeQueue.isEmpty()); System.out.println("Front element: " + arrayDequeQueue.peek());…
import java.util.*;import java.io.*; public class HuffmanCode { private Queue<HuffmanNode> queue; private HuffmanNode overallRoot; public HuffmanCode(int[] frequencies) { queue = new PriorityQueue<HuffmanNode>(); for (int i = 0; i < frequencies.length; i++) { if (frequencies[i] > 0) { HuffmanNode node = new HuffmanNode(frequencies[i]); node.ascii = i; queue.add(node); } } overallRoot = buildTree(); } public HuffmanCode(Scanner input) { overallRoot = new HuffmanNode(-1); while (input.hasNext()) { int asciiValue = Integer.parseInt(input.nextLine()); String code = input.nextLine(); overallRoot =…
class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int size) { front = rear = 0; capacity = size; queue = new int[capacity]; } // insert an element into the queue static void queueEnqueue(int item) { // check if the queue is full if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; } // insert element at the rear else { queue[rear] = item; rear++; } return; } //remove an element from the queue static void queueDequeue() { // check if queue is empty if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } // shift elements to the right by one place uptil rear else {…