Trace through the state of the queue q in the following code fragment in the main method. You need to show the queue with its values for credit. Queue q = new ArrayDeque( ); q.add(14); q.add(-47); q.offer(75); q.poll( ); Integer v = q.peek( ); q.add( v - 32); q.remove( ); q.add(q.poll( )); System.out.println ("q has " + q); System.out.println ("v has " + v); Final Result for q: v:
Q: Write a méthód called changeQueue to be considered inside the ArrayQueue class and has one parameter…
A: The program is written in Java. Check the program screenshot for the correct indentation. Please…
Q: Write a Java public static general method that doesn't belong to the Queue class(assuming the Queue…
A: package Queue; public class Test { public static void main(String[] args) {…
Q: Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter…
A: Language: JAVA Specifications: Non-Empty Queue i.e. Length > 0 Even number of elements, hence…
Q: Implement the “missing” front and rear operations in JAVA using constructor and Also write output:
A: For implementing queue, we need to keep track of two indices, front and rear. We enqueue an item at…
Q: 1. Given below is the incomplete Java program for Queue Methods in Java. Use the correct Java codes…
A: Queue is a data structure that stores the element in FIFO(First In First Out) manner i.e. first…
Q: Write a program that reads a line of text, changes each uppercase letter to lowercase, and places…
A: #include<iostream> using namespace std; class MyQueue { char *queue; int front;…
Q: Write a method called removeDuplicates that accepts a PriorityQueue of integers as a parameter and…
A: Given: Write a method called removeDuplicates that accepts a PriorityQueue of integers as a…
Q: Write the implementation of a static method, called sumOdds, that belongs IntNode. The method takes…
A: Task :- Write a Java program to find the sum of all odd numbers in the list. Java program :-…
Q: If the following is a circular array based queue of size 99 43 54 76 93 77 18 If rear is at…
A: For Finding the size : If front > rear : size = MAX - front + rear + 1. Otherwise :…
Q: write a method that takes two array of customer and what they need and compare them to see if if the…
A: for (String obj : object) { queue.add(obj); } int count = 0; for (String c : cust) { if…
Q: write a program that creates a linked list of points in an x-y coordinate system. Following are the…
A: Given question has asked to write a program that creates a linked list of points in an x-y…
Q: Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter…
A: class ArrayQueue{ public void changeQueue(int [] queue,int item){ int n=queue.length; for(int…
Q: 4. Trace through the state of the queue q in the following code fragment in the main method. You…
A: According to the information given:- We have to trace the state of queue and find the value after…
Q: Write a static method named negListFromQueue that takes two parameters: an array-based unbounded…
A: Given that, Write a static method named negListFromQueue that takes two parameters: an array-based…
Q: The Queue object, q, in the parameter of the method must contain the same elements in the same…
A: While doing programming in any programming language, you need to use various variables to store…
Q: If the following is a circular array based queue of size 23 43 54 76 93 99 17 If rear is at…
A: 1) We can use below equation to find size of circular queue size = front > rear ? (N- front +…
Q: Write a method mirror that accepts a queue of strings as parameter and appends the queue's contents…
A: Algorithm for the problem :- Store the size of queue in size. Push the queue elements into a stack…
Q: This is Java Move the Nth element to the back of the Queue. Write the Java program that reads 5…
A: Actually, java is a object oriented programming language. It is a platform independent.
Q: In Java Write a method rearrange that takes a queue of integers as a parameter and rearranges the…
A: import java.util.*;public class Main{public static void rearrange(Queue<Integer> q)…
Q: public class ArravBeurdedQueYe implements QueuelotRTAse protected final int DEFCAP = 100; // default…
A: public class ArrayBoundedQueue<T> implements myqueueInterface<T>{ protected final int…
Q: Given the following method within the ArrayQueue class, what does it do ? public E Undefined() int i…
A: Because if(thedata[i].equals(theData[(i+1)%capacity])) // the line checks weather the value is…
Q: Given a Queue of Integers with the interface: public void enqueue(Integer i) // add to end public…
A: Source Code: import java.util.Queue; public class QueueIntegers { public static void…
Q: Suppose we want to extend the PositionalList ADT with a method, indexOf(p), that returns the current…
A: Positional List is an Abstract Data Type that can used in a wide variety of use cases. Positional…
Q: Write a method called reverse() that takes a linked list of Strings in as a parameter and returns a…
A: PLEASE DO SUPPORT FOR MY EFFORTS, THANKS! ANSWER: package com.company;import java.util.*;public…
Q: : Write a method/programme that will take a generic linked list and make a palindrome of the list.…
A: java program is an given below : import java.util.Scanner; class Palindrome { public static void…
Q: 3) Consider an empty Queue of maximum size = 5; show only the contents of the queue after executing…
A: There are three functions in use in the question. First of all let's define them 1. addQueue() -…
Q: 1. Can you "pop" from a queue -- in other words, is there any reason why you couldn't just copy over…
A: Note : as per many questions are asked, we solve the few questions and kindly repost the unanswered…
Q: Suppose that you implement a queue using a null-terminated singly-linked list, maintaining a…
A: Introduction : Given , Implementation of a queue using a null-terminated singly-linked-list.we have…
Q: Write a Java program that allow the user 1.Implement a queue in an array 2. Enter the following…
A: Given: Write a Java program that allows the user 1. Implement a queue in an array2. Enter the…
Q: IN JAVA Write a method splitQueue () that takes as parameters three queues OriginalQ, OddQ and…
A: Input : Queue : OriginalQ Output : OddQ that contains only odd numbers of OriginalQ, EvenQ that…
Q: Write a static method named SmallestEvenStackQueueToList that takes two parameters: an array-based…
A: Given:
Q: Write a non-recursive Java method for printing all permutations of the numbers {1,2, ..., n}
A: public class PermUtil <T> { private T[] arr; private int[] permSwappings; public PermUtil(T[]…
Q: Write a piece of code that prints the elements of a queue of integers, one per line.
A: As no programming language is mentioned, it is solved using C++
Q: Write in java Program a methad to Sort the elements jn a queue , and then find the sum of the even e…
A: ALGORITHM:- 1. Declare and initialise a queue. 2. Pass it to the function. 3. Print the result. 4.…
Q: Implement a priority queue capable of holding objects of an arbitrary type, T, by defining a…
A: //Java Program
Q: Write a java program which follows conditions written below: Consisting of four (4) book titles…
A: Input 4 Strings and then pop each element and push to queue Finally print the queue
Q: Write a program that reads a line of text, changes each uppercase letter to lowercase, and places…
A:
Q: Given a Python Queue class implemented with the abstract data type (ADT) below, write a new method…
A: 1. Define list. 2. write a method pop. 3. remove the last element from the queue. 4. Print the…
Q: I am trying to write a program, in JAVA, that will show the output of the following sequence of…
A: PROGRAM: //Importing the header files import java.util.*; // Defining the main() class…
Q: Write a method, called removeFive Multiples(), to remove the multiples of 5 from a queue, which is…
A: In this question we have to write the java code in which we have been given a queue, we have to add…
Q: Write a method “mergeQueueStack” that takes a queue as a parameter of type: Queue of integers…
A: Here our task is to write a function named mergeQueueStack which merges a queue of integers and a…
Q: Write a program that reads a line of text, changes each uppercase letter to lowercase, and places…
A: PROGRAM CODE: #include<iostream>#include<string>#define MAX 100using namespace std;char…
Q: Write a queue method, called duplicateOdd that will duplicate every odd number in a queue.
A: Here have to determine about code for given queue problem.
Q: QUESTION 9 An array of size MAX_SIZE is used to implement a queue. head, tail, and size are tracked.…
A: q 9) answer :- option C) MAX_SIZE Explanation : - here index is start with zero, so if rear is at…
Q: We can declare a new array and copy the items of the old queue to new and by this, it will extend…
A: Queue is a data structure which is used to add an element from one end and removes elements from…
Q: Your crazy boss has assigned you to write a linear array-based implementation of the IQueue…
A: Please check the next's steps for solution of the question this gives output as per the given…
Q: Write a method stutter that accepts a queue of integers as a parameter and replaces every element of…
A: Given: To write a C++ Code.
This is a java question
Trace through the state of the queue q in the following code fragment in the main method.
You need to show the queue with its values for credit.
Queue <Integer> q = new ArrayDeque<Integer>( );
q.add(14);
q.add(-47);
q.offer(75);
q.poll( );
Integer v = q.peek( );
q.add( v - 32);
q.remove( );
q.add(q.poll( ));
System.out.println ("q has " + q);
System.out.println ("v has " + v);
Final Result for q:
v: |
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
- Question 11 Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void changeQueue(E item) Example1: Before run: front rear "this" queue: 10 29 2 25 10 Item1: 100 After run: front rear "this" queue: 100 29 100 100 5 100 Use the editor to format your answervoid getInput(){for(int i =0; i < studentName.length; i++){System.out.print("Student name: ");studentName[i] = keyboard.nextLine();System.out.print("Studnet ID: ");midTerm1[i] = keyboard.nextInt();}keyboard.close();} Can't put full student name becuase nextLine();Add the method below to the parking office.java class. Method getParkingCharges(Customer) : Money Parkingoffice.java public class ParkingOffice {String name;String address;String phone; List<Customer> customers;List<Car> cars;List<ParkingLot> lots;List<ParkingCharge> charges; public ParkingOffice(){customers = new ArrayList<>();cars = new ArrayList<>();lots = new ArrayList<>();charges = new ArrayList<>();}public Customer register() {Customer cust = new Customer(name,address,phone);customers.add(cust);return cust;}public Car register(Customer c,String licence, CarType t) {Car car = new Car(c,licence,t);cars.add(car);return car;}public Customer getCustomer(String name) {for(Customer cust : customers)if(cust.getName().equals(name))return cust;return null;}public double addCharge(ParkingCharge p) {charges.add(p);return p.amount;} public String[] getCustomerIds(){String[] stringArray1 = new String[2];for(int i=0;i<2;i++){stringArray1[i]…
- Java Program, Dont Copy Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordinglyUsing c++ I would like to implement a queue as a class with a linked list. This queue Is used to help the class print job in displaying things like: a confirmation of the job request received and the status ( denied/accepted) along with the details such as a tracking number, position in the queue( if accepted), reason for denial (if denied), etc. These classes will be used in a menu-driven application that has the following options: request a print job ask for the job name; the name may have blank spaces and consist of alphanumeric characters only, must start with a letter display a confirmation of the job request received and the status ( denied/accepted) along with the details such as a tracking number, position in the queue( if accepted), reason for denial (if denied), etc execute a print job (remove from the queue ) display a confirmation along with the tracking number, the name of the print job, and the number of print jobs currently in the queue display number of print…void traverse (Node node) { if(node.left!=null){ traverse (node.left); System.out.print (node.data+" ->"); } if (node.right!=null){ System.out.print (node.data+" ->"); traverse (node.right); Write the output that will be obtained when this traverse() method is called with the root of the tree given below. 8 4 12 2 6 10 14 1 3) 7 11 13 15
- Assume that the SampleQueue class, with the given code below, is used in the TestSampleQueue that is also shown below. Show the output of the TestSampleQueue. Do the exercise without using a computer (i.e. Make amanual trace of the program):// SampleQueue classimport java.lang.*;import java.util.*;public class SampleQueue<T> {private LinkedList<T> list;public SampleQueue() {list = new LinkedList<T>();}public void setList(LinkedList<T> list) {this.list = list;}public void clear() {list.clear();}public boolean isEmpty() {return list.isEmpty();}public T firsElement() {return list.getFirst();}public T dequeue() {return list.removeFirst();}public void enqueue(T element) {list.addLast(element);}public LinkedList<T> getList() {return list;}public String toString() {return list.toString();}} // end of SampleQueue classAdd the method below to the parking office.java class. Method getParkingCharges(ParkingPermit) : Money Parkingoffice.java public class ParkingOffice {String name;String address;String phone; List<Customer> customers;List<Car> cars;List<ParkingLot> lots;List<ParkingCharge> charges; public ParkingOffice(){customers = new ArrayList<>();cars = new ArrayList<>();lots = new ArrayList<>();charges = new ArrayList<>();}public Customer register() {Customer cust = new Customer(name,address,phone);customers.add(cust);return cust;}public Car register(Customer c,String licence, CarType t) {Car car = new Car(c,licence,t);cars.add(car);return car;}public Customer getCustomer(String name) {for(Customer cust : customers)if(cust.getName().equals(name))return cust;return null;}public double addCharge(ParkingCharge p) {charges.add(p);return p.amount;} public String[] getCustomerIds(){String[] stringArray1 = new String[2];for(int…Finish the following programs. Given the definition of SListNode: public class SListNode extends ListNode { protected SListNode next; //next references the next node in the SList. SListNode(Object i, SList l, SListNode n) { item = i; myList = l; next = n; } // Ignore other methods in this exam. We don't use them. … } Finish the definitions of a constructor, prev(), newNode(), insertFront(), front(), back(), toString() methods of the SList class. Note: SListNode and SList implement a singly-linked list by inheriting from ListNode class and List class, respectively. Whenever a SListNode is needed to be created, use newNode() method defined in SList class rather than calling the SListNode constructor directly. public class SList extends List { protected SListNode head; protected SListNode tail; //You need to write a constructor for SList with no parameters. public SList() { } // newNode() calls the SListNode constructor to…
- A readinglist is a doubly linked list in which each element of the list is a book. So, you must make sure that Books are linked with the previous prev and next element. A readinglist is unsorted by default or sorted (according to title) in different context. Please pay attention to the task description below. Refer to the relevance classes for more detail information. Implement the add_book_sorted method of the ReadingList class. Assume the readinglist is sorted by title, the add_book_sorted method takes an argument new_book (a book object), it adds the new_book to the readinglist such that the readinglist remain sorted by title. For example, if the readinglist contain the following 3 books: Title: Artificial Intelligence Applications Author: Cassie Ng Published Year: 2000 Title: Python 3 Author: Jack Chan Published Year: 2016 Title: Zoo Author: Cassie Chun Published Year: 2000 If we add another book (titled "Chinese History"; author "Qin Yuan"; and published year 1989) to the…java method : Write a method called prioritizeQueue to give priority for vaccination for elderly persons. The method is to be in a class called VaccinationQueue and has two parameters q1 and q2 type ArrayQueue. The q1 and q2 data are of type Integer. Assume that initially q1 is not empty and q2 is empty. The method will insert from q1 those elements towards the beginning of the queue (front) q2 whose data is greater than or equal to 45 and will insert those elements whose data is less than 45 and greater than or equal to 18 towards the end (rear) of q2. Any data item less than 18 of q1 will not be inserted in q2. It returns the number of elements added to q2. Class ArrayQueue and all its methods including iterator are available for use. You can also create temporary queues. You are not allowed to use arrays or any other data structure. Example: Before method call: front rear q1: 14 25 50 70 35 45 19 10 21…Write a recursive method named printLevel (Node<T> reeRef, int level) (with an assumption that it will be written inside class BST) that prints the nodes in a certain level. The method should take two parameters: the root and the level number that you should print the nodes at. Write a test drive main program which tests this method. USE JAVA LANGUAGE PLEAS