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:

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:

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Trace through the state of the queue q in the following code fragment in the main method. Queue <Integer> q = new ArrayDeque<Integer>( ); q.add(-6); q.add(23); q.offer(19); q.poll( ); Integer t = q.peek( ); q.add( t + 16); q.remove( ); q.add(q.poll( )); System.out.println ("q has " + q); System.out.println ("t has " + t);
Write a Java public static general method that doesn't belong to the Queue class(assuming the Queue type is Book and Book has a clone method, Book also has a method called getGenre() which returns the genre of the book): Queue findOneGenreBooks(Queue Q, String genreType) that searches in the first parameter Q for all books that has the same genre type as defined by the second parameter genreType, return all of the books that have the specified genre type as a Queue. (For example, you may want to find all cartoon books and return them as a Queue). Please note: You are only allowed to use the Queue class which has constructors, enqueue, dequeue, front, isEmpty, size, toString, and clone methods.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Write a class MyArrayQueue that Inherit the ArrayBoundedQueue class show in screen shot and such that all the following methods are implemented in java: public String toString();// Creates and returns a string that correctly represents the current queue. public void remove(int count);// Removes the front count elements from the queue.// Throw QueueUnderflowException with message of "Less than count elements in queue." //if there are less than count elements in the queue. public void reQueue();// Dequeue an element from front, and enqueue the element back to rear of the queue.// Throw QueueUnderflowException with message of "No element in queue."// if there is no element in the queue. public void clear();// Clear entire queue.public void reverse();// Reverse queue content. Hint: you may use LinkedStack ADT.} public int space(); //return how many open spaces does the queue have still available.
Write a program in Python to show how a queue works using empty, size, front, back, push item onto queue, and push item off queue.
Imagine you have an empty Queue of integers, Q, with 5 elements size, and two integer numbers x and y. Draw a picture of Q, x and y after executing the following code:
FOR JAVA Consider rewriting the method max() given below such that it gives the correct answer even if the linked list contains positive and/or negative integers on their .item variable. public int max(Node x) { intmaxValue=0; while(x!=null){ if(x.item<maxValue)maxValue=x.item; x=x.next; } returnmaxValue; } }
IN JAVA Write a method splitQueue () that takes as parameters three queues OriginalQ, OddQ and EvenQ. It should split the OriginalQ into two queues: OddQ that contains only odd numbers of OriginalQ, EvenQ that contains only even numbers of OriginalQ, Keeping OriginalQ unchanged. Test your method.
A popular way to implement queues using the java.util package is to use the Queue interface. Write an application called Tail, that prints the last k strings found on the standard input (assuming the standard input has k or more strings), using the Queue interface. The user should be able to type java Tail 20 < bigfile.txt
write a method that takes two array of customer and what they need and compare them to see if if the what customer wants is present in the front or else send the customer to back. Use queue data structure. Use the following code to complete. import java.util.LinkedList; import java.util.Queue; public class MyQueue{ public int Customer(String[] cust, String[] object) { Queue<String> queue = new LinkedList<>(); // write your logic here } example:- cust[] = { P, P, O, O } object[] = { O, P, P, O} since customer P doesn,t want O send it back. loop this to find out how many customers will end up having no object.}
Given a Queue of Integers with the interface: public void enqueue(Integer i) // add to endpublic Integer dequeue() // remove from frontpublic boolean isEmpty() // return true if empty Write a method rearrange(Queue q) that takes a queue of integers as a parameter and rearranges the order of the values so that all of the odd values appear before the even values and that otherwise preserves the original order of the list. For example, if a Queue contained [3, 5, 4, 17, 6, 83, 1, 84, 16, 37] after call rearrange it would contain [ 3, 5, 17, 83, 1, 37, 4, 6, 84, 16] You may use any internal data structures you chose. Hint: I recommend even and odd queues in your method.
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output: Run: original order of strings: Java C# PHP Python Reverse order of strings: Python PHP C#Java BUILD SUCCESSFUL