complete TODO's using Java }try {Thread.sleep (SERVICE_TIME);} catch (final InterruptedException ex) {return;}}});consumer.setDaemon(true);consumer.start();// foreground activity for reading customer names from inputfinal var input = new Scanner(System.in);System.out.print("enter next customer: ");while (input.hasNextLine ( )) {final var name :Stringinput.nextLine();var resultfalse;synchronized (lock) {// TODO try to add this name to the queue}if (result) {System.out.println(name + " has joined the queue");} else {System.out.println("queue full,unable to join");+ name +}}} public class SingleQueueService {/** Service time per Customer in ms. */static final int SERVICE_TIME = 2000;/** Reads sUccessive input lines until E0F and tries to add them to the queue for processing. */public static void main(final String[] args) throws InterruptedException {// queue for customer namesfinal SimpleQueue queue = new FixedArrayQueue<>( capacity: 5);// lock object for thread safetyfinal var lock = new 0bject();// background activity for serving customersfinal Thread consumer =new Thread (() -> {while (true) {String current;int remaining;synchronized (lock) {current = null; // TODO try to take next name from queueremaining = 0; // TODO determine resulting size of queue}if (current == null) {System.out.println("no one waiting");} else {System.out.println(current + " is being served,+ remaining +still waiting");}try {Thread.sleep (SERVICE_TIME);

Name: complete TODO's using Java }try {Thread.sleep (SERVICE_TIME);} catch (
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: complete TODO's using Java }try {Thread.sleep (SERVICE_TIME);} catch (final InterruptedException ex) {return;}}});consumer.setDaemon(true);consumer.start();// foreground activity for reading customer names from inputfinal var input = new Scanner(Syst

Previously I had made a project on this topic. I am providing the main java code. If any…

Answered: complete TODO's using Java

Engineering

Computer Science

complete TODO's using Java

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

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…
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 {…
1. Implement the “missing” front and rear operations in JAVA using constructor and Also write output: class Queue { private int maxSize; private long[] queArray; private int front; private int rear; private int nItems; public Queue(int s) // constructor { maxSize = s; queArray = new long[maxSize]; front = 0; rear = -1; nItems = 0; } // public void insert(long j) { // put item at rear of queue // public long remove() { // take item from front of queue //And then return } // public long peekFront() { // peek at front of queue //Return queue array front } // public boolean isEmpty(){ // true if queue is empty //return nItems zero } // public boolean isFull() { // true if queue is full return } // public int size() // number of items in queue { //return nItems; } // } // end class Queue //////////////////////////////////////////////////////////////// class QueueApp { public static void main(String[] args) { Queue theQueue = new Queue(5); // queue holds 5 items…
Code in java please import java.util.*;public class QueueLastname //<------ change the name of the class to include yourlast name{// no code goes here}class Queue{private ArrayList<String> q;public Queue( ){q = new ArrayList<String>();}public void enqueue(String num){q.add(num);}public String dequeue(){return q.remove(0);}/*This method goes through the quque and finds the longest name in the qThe queue must be restored in its original state after finding the longestname*/public String getLongestName(){Stack s = new Stack();String longest = q.get(0);// q.remove(0);boolean b = false;while(!b){try{String front = q.get(0);//get the first elementq.remove(0);//remove it from the qs.push(front);// push it to the stackif (front.length() > longest.length() )longest = front;}catch(Exception e){b = true;}}restore(s); // restoring the queuereturn longest; }/*Traverse through the queue and creates a string containing all the names.must restore the quque to its original…
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…
#include <iostream> usingnamespace std; class Queue { int size; int* queue; public: Queue(){ size = 0; queue = new int[100]; } void add(int data){ queue[size]= data; size++; } void remove(){ if(size ==0){ cout <<"Queue is empty"<<endl; return; } else{ for(int i =0; i < size -1; i++){ queue[i]= queue[i +1]; } size--; } } void print(){ if(size ==0){ cout <<"Queue is empty"<<endl; return; } for(int i =0; i < size; i++){ cout<<queue[i]<<" <- "; } cout << endl; } //your code goes here }; int main(){ Queue q1; q1.add(42); q1.add(2); q1.add(8); q1.add(1); Queue q2; q2.add(3); q2.add(66); q2.add(128); q2.add(5); Queue q3 = q1+q2; q3.print();…
Given a partial main() and PlaneQueue class, write the push() and pop() methods for PlaneQueue. Then complete the main() to read in whether flights are arriving or have landed at an airport. An "arriving" flight is pushed onto the queue. A "landed" flight is popped from the front of the queue. Output the queue after each plane is pushed or popped. Entering -1 exits the program. Ex: If the input is: arriving AA213 arriving DAL23 arriving UA628 landed -1 the output is: Air-traffic control queue Next to land: AA213 Air-traffic control queue Next to land: AA213 Arriving flights: DAL23 Air-traffic control queue Next to land: AA213 Arriving flights: DAL23 UA628 AA213 has landed. Air-traffic control queue Next to land: DAL23 Arriving flights: UA628 JAVA Please
/** Iluustration of RecursiveTask*/import java.util.concurrent.ExecutionException;import java.util.concurrent.ForkJoinPool;import java.util.concurrent.RecursiveTask; public class SumWithPool{ public static void main(String[] args) throws InterruptedException, ExecutionException { //get the number of avaialbe CPUs int nThreads = Runtime.getRuntime().availableProcessors(); System.out.println("Available CPUs: " + nThreads); //create an array of data int n = 10; //initital data size if(args.length > 0) // use the user given data size n = Integer.parseInt(args[0]); int[] numbers = new int[n]; for(int i = 0; i < numbers.length; i++) { numbers[i] = i; } ForkJoinPool forkJoinPool = new ForkJoinPool(nThreads); Sum s = new Sum(numbers,0,numbers.length); long startTime = System.currentTimeMillis(); //start timer Long result = forkJoinPool.invoke(s); long endTime =…
c++ a Queue Class that allows users to push strings or integer values into it. For example, when running the following code: SpecialQueue Q; Q.push("Albert"); Q.push("Jose"); Q.push(123); Q.pop(); Q.pop(); Q.pop(); The output should be: Albert Jose 123 Submit a TEXT file that contains your class. By class, I mean everything EXCEPT your main function. DO NOT SUBMIT YOUR MAIN().
Java programming I have to do the "Resize method" which I believe if the array is full, it should resize so there is space. Ill paste the code below: package circularQueue; /* * Design the class that would implement the interfaceiQueue. */ public class cirQueue <T> implements iQueue <T> { //Array of T objects private T[] Ar; //reference to array of objects //int size keeps track of how many elements in the queue int size = 0; //first the index to the head of the queue int first = -1; //last the index the last element of the queue int last = -1; public cirQueue() { Ar = (T[]) new Object[5]; size = 0; first = last = -1; } public int size() { return size; } public boolean empty() { return (size == 0); } private void resize() { //HW TODO } //inserts element e at the back of the queue public void insert(T e) { if(this.empty()) { first = last = 0; //insert e at indx 0; Ar[first] = e; size = 1; return; } if(size == Ar.length) { //resize HW complete this one.…
In java pls! here is some starter code for this problem: public class ThreadingDivisors { public static void main(String[] args) { long start = System.currentTimeMillis(); int maxDivisors = 0; int answer = 0; for (int n=1; n<100000; n++) { int divisors = getNumDivisors(n); if (divisors > maxDivisors) { maxDivisors = divisors; answer = n; } } System.out.println(answer + " has the most divisors (" + maxDivisors + ")"); long end = System.currentTimeMillis(); System.out.println(end - start + " milliseconds"); } public static int getNumDivisors(int n) { int numDivisors = 0; for (int i=1; i<=n; i++) { if (n % i == 0) { numDivisors++; } } return numDivisors; } }
In the lecture we studied IntStack, a class that implements a static stack of integers. Write a template that will create a static stack of any data type. Demonstrate the class with a driver program. #pragma once class IntStack{private: int *stackArray; int stackSize; int top; public: IntStack(int size); void push(int num); void pop(int &num); bool isFull(); bool isEmpty();}; Queue Exceptions: Modify the static queue class provided in our lecture as follows. Make the isFull and isEmpty member functions private. Deﬁne a queue overﬂow exception and modify enqueue so that it throws this exception when the queue runs out of space. Deﬁne a queue underﬂow exception and modify dequeue so that it throws this exception when the queue is empty. Rewrite the main program so that it catches overﬂow exceptions when they occur. The exception handler for queue overﬂow should print an appropriate error message and then terminate the program. #include…