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).

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).

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

Please follow steps package chapter04.queues;   public class LinkedQueue {  protected PersonNode front;  protected PersonNode rear;  protected int numElements;    public LinkedQueue()  {  front = null;  rear = null;  numElements = 0;  }   public void enqueue(T fName, T lName, T sNum)  {  //Complete this method as required in the homework instructions.     }    public T dequeue()  {  //Complete this method as required in the homework instructions.      }    public void peekFront()  {  //Complete this method as required in the homework instructions. }   public boolean contains(T lookFor)  {  //Complete this method as required in the homework instructions.     }   public void display()  {  //Complete this method as required in the homework instructions.     }   public int size()  {  return numElements;  }   public boolean isFull()  {  return false;  }   public boolean…
Note : addqueue works like Enqueue and deleteQueue works like Dequeue Consider the following statements: (8, 9) queueType queue; int num; Show what is output by the following segment of code num = 7; queue.addQueue (6); queue.addQueue (num); num = queue.front (); queue.deleteQueue(); queue.addQueue (num + 5); queue.addQueue (14); queue.addQueue (num queue.addQueue (25); queue.deleteQueue (); 2); cout <« "Queue elements: "; while (!queue.isEmptyQueue ()) { cout <« queue.front () << " "; queue.deleteQueue(); } cout <« endl; Queue elements: 14 14 4 25 Queue elements: 11 14 4 4 Queue elements: 11 14 4 25 Queue elements: 11 14 25 25
Use java Implement a phone book using a linked list structure. In this phone book , you are going to store a name,lastname,email,and phone number Implement the folowing methods by using this class public class PhoneBookSinglyLinkedList { public PhoneBookNode head; public PhoneBookNode tail; public int size; public boolean isEmpty() {//todo implement this} public int size() {//todo implement this} public void printPhoneBook() {//todo implement this} public void add(Contact contact) {//todo implement this} public PhoneBookNode findByFirstName(String firstName) {//todo implement this} public List findAllByLastName(String lastName) {//todo implement this} public void deleteByFirstName(String firstName) {//todo implement this} public void deleteAllMatchingLastName(String lastName) {//todo implement this} public List findAll() {//todo implement this}
Data structure: Using Java,
True or False? When implementing a queue with a linked list, the front of the queue is also the front of the linked list.
Please fix this The countOff() method displays the name of each officer removed from the queue, in the order in which they are removed, and displays the name of the officer that goes for help. For example, the output for the queue of defenders above with a count of 4 would appear as:Defenders leaving the queue are: Horace Alsbury, PVT, Kentucky, survivorSimon Arreola, —, —, survivorPeter James Bailey III, PVT, Kentucky, fatalityJohn J. Ballentine, PVT, Pennsylvania, fatalityRobert Allen, PVT, Virginia, fatalityMicajah Autry, PVT, North Carolina, fatalityWilliam Charles M. Baker, CPT, Missouri, fatalityJames L. Allen, PVT, Kentucky, survivorJesse B. Badgett, —, Texas, survivorRichard W. Ballentine, PVT, Scotland, fatalityJosé María Arocha, —, —, survivorJuan Abamillo, SGT, Texas, fatalityIsaac G. Baker, PVT, Arkansas, fatalityJuan A. Badillo, SGT, Texas, fatalityJohn Ballard, —, —, fatalityMiles DeForest Andross, PVT, Vermont, fatality The defender going for help is: George Andrews, —,…
1. Suppose you have a circular queue of size 6 (1 to 6). Initially the value of thefront and rear is 0. Now show the state of the queue if the following operationis performed on the queue. Also find the value of front and rear in each step.insert (10); insert (5), delete (), insert (9); insert (9); insert (7); insert (5); insert(8); insert (10); insert (11).
Please written by computer source In java please!
BankCustomerQueueADT Implement in C++ a BankCustomer QueueADT that does the following: 1. gets the input about a customer (first name, last name, Bank Account Number, Money to be withdrawn/deposited, etc.) from the user (from the keyboard) 2. inserts (enqueues) the Customer as a record into the BankCustomerQueueADT (your Queue ADT must be able to have a maximum of 20 customer records) 3. removes (dequeues) the Customer record from the BankCustomerQueueADT 4. your BankCustomerQueueADT must also have the behavior of retrieving and displaying the Queue info on the screen after each event (either entry of a Bank Customer into the queue, OR leaving of the Bank customer from the queue). NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Make sure all the code statements are commented. Make sure your program is indented properly.
python help. Write a LikedQueue (code at bottom) Test it by: Add numbers from 13 to 23 in the queue. Print the length of the queue Check if the queue is empty Show the item at the front of the queue Remove the first item in the queue Add 100 to the queue Remove all items in the queue Check if the queue is empty """File: linkedqueue.pyAuthor: Ken Lambert"""from node import Nodefrom abstractcollection import AbstractCollectionclass LinkedQueue(AbstractCollection):"""A link-based queue implementation."""# Constructordef __init__(self, sourceCollection = None):"""Sets the initial state of self, which includes thecontents of sourceCollection, if it's present."""self.front = self.rear = NoneAbstractCollection.__init__(self, sourceCollection)# Accessor methodsdef __iter__(self):"""Supports iteration over a view of self."""passdef peek(self):"""Returns the item at the front of the queue.Precondition: the queue is not empty.Raises: KeyError if the stack is empty."""if self.isEmpty():raise…
Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 2.) Define SLinkedList Classa. Instance Variables: # Node head # Node tail # int sizeb. Constructorc. Methods # int getSize() //Return the number of nodes of the list. # boolean isEmpty() //Return true if the list is empty, and false otherwise. # int getFirst() //Return the value of the first node of the list. # int getLast()/ /Return the value of the Last node of the list. # Node getHead()/ /Return the head # setHead(Node h)//Set the head # Node getTail()/ /Return the tail # setTail(Node t)//Set the tail # addFirst(E e) //add a new element to the front of the list # addLast(E e) // add new element to the end of the list # E removeFirst()//Return the value of the first node of the list # display()/ /print out values of all the nodes of the list # Node search(E key)//check if a given…
data structures in java