1. Implement, using only the Queue kernel methods, the static method declared as follows andanswer the questions below:Reports the smallest integer in the given {@code Queue}.@param qthe queue of integer@return the smallest integer in the given queue@requires q /= empty_string@ensures min is in entries (q) andfor all x: integerwhere (x is in entries (q))(min <= x)ivate static int min (Queue q) {...}i. Why do you need the requires clause?ii. Why is the first line of the ensures clause important (min is in entries (q))?Explain what the implementation could do if this line was not included in thepostcondition.2. Implement the static method declared as follows:Reports an array of two {@code int}s with the smallest and the* largest integer in the given {@ code Queue}.* @param qthe queue of integer@return an array of two (@code int}s with the smallest and thelargest integer in the given queue* @requires q /= empty_string@ensures { minAndMax [0], minAndMax [1] } is subset of entries (q) andfor all x: integerwhere (x in in entries (q))(minAndMax [0] <= x <= minAndMax [1])* * /private static int [] minAndMax (Queue q) {...}Note that because in Java a function can return only one value and it is not possible toreturn other values through the parameters, we are forced to return an array with theminimum and maximum integers of the given queue as elements.3. Consider the minAndMax operation again. Write a second implementation for this operationthat uses the "Noah's Ark" algorithm. This algorithm takes entries from q in pairs, firstcomparing them to each other, then comparing the smaller of the pair to the minimum so farand the larger of the pair to the maximum so far.

Answering for the first question Kernel method : In AI, kernel strategies are a class of…

Implement, using only the Queue kernel methods, the static method declared as follows and answer the questions below: Reports the smallest integer in the given {@code Queue). @param q the queue of integer @return the smallest integer in the given queue @requires q /= empty_string @ensures min is in entries (q) and for all x: integer where (x is in entries (q)) (min <= x) ivate static int min (Queue q) {...} i. Why do you need the requires clause? ii. Why is the first line of the ensures clause important (min is in entries (q))? Explain what the implementation could do if this line was not included in the postcondition.

Implement, using only the Queue kernel methods, the static method declared as follows and answer the questions below: Reports the smallest integer in the given {@code Queue). @param q the queue of integer @return the smallest integer in the given queue @requires q /= empty_string @ensures min is in entries (q) and for all x: integer where (x is in entries (q)) (min <= x) ivate static int min (Queue q) {...} i. Why do you need the requires clause? ii. Why is the first line of the ensures clause important (min is in entries (q))? Explain what the implementation could do if this line was not included in the postcondition.

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

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:
Use java language please 1.Write a method “mergeQueueStack” that takes a queue as a parameter of type: Queue of integers and a stack as a second parameter of type: Deque of integers Remove all the items from the queue and remove all the items from the stack then add them to a LinkedList by alternating between an item from queue then an item from stack. Don’t assume initially both the queue and the stack have the same number of items. The method should return the linked list of type integers. Example: If queue has : 1,2,3,4,5 and stack has 10, 20, 30 (where 10 is at top of the stack) then the linkedList should contain: 1,10,2,20,3,30,4,5
Write a Java program to implement a queue by using arrayo Define a Queue interface.o Define an ArrayQueue class.o Define a Test class to test all methods first code package ArrayQueue; public class ArrayQueue<E> implements Queue<E> { public static final int CAPACITY=1000; private E[] data; private int f = 0; private int sz = 0; public ArrayQueue() { data = (E[]) new Object[CAPACITY]; } public ArrayQueue(int capacity) { data = (E[]) new Object[capacity]; } public int size() { return sz; } public boolean isEmpty() { return (sz == 0); } public void enqueue(E e ) throws IllegalStateException { if(sz == data.length) throw new IllegalStateException(" queue is full"); int enqueueIndex = (f + sz) % data.length; data[enqueueIndex] = e; sz++; } public E first() { if(isEmpty()) return null; return data[f]; } public E dequeue() { if(isEmpty()) return null; E answer = data[f]; data[f] = null; f= (f+1)% data.length; sz --; return answer; } } secound code package…
Suppose that we would like to implement a queue system for a commercial website. Given that the website offers 3 items for sale (or a list of items), each item has a limit quantity in stock. Implement a queue of customers, each customer can buy only a few number product among the available three items. Determine the item name, their quantity in stock; Specify a queue of n customers, each customer can buy k products from one item (k is different for each customer); Customers take turn to enter (enqueue) and leave (dequeue) the queue according to the FIFO order to purchase wanted products; If a customer successfully purchased products, then display a message and reduce the number of products in stock; otherwise, if the item has been run out, display a warning message. Implement the above problems in C/C++ using a Queue data structur. Write a main function for testing all written functions.
Implement a function bool moveNthElem(QueueSLL&,int n) that moves a queue element at the specified N position to the front of the queue. For example, assuming a queue with the elements {4,6,8,10} and n=3, the 3rd element which has the value 8 will move to the front of the queue. The updated queue will be {8,4,6,10}. The function may use an additional queue.
Write a java program which follows conditions written below: Consisting of four (4) book titles entered by the user. Pop the stack's elements one by one; each popped element will be added to a queue. Then, print the content of the queue. Input: Enter four book titles. Book 1: Ibong Adarna Book 2: Florante at Laura Book 3: Ilustrado Book 4: ABNKKBSNPLAko?! Expected Output: New order of books: [ABNKKBSNPLAko?!, Ilustrado, Florante at Laura, Ibong Adarna]
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.
Create a new Java class in a file named "ListPQ.java" that implements the Queue interface and uses the LinkedList provided by the JCF to implement a priority queue. Note that LinkedList does not automatically order values based on priority, so it will be up to you to make sure that values are removed in priority order. You should try to implement your priority queue as efficiently as possible - basic operations should run in constant or linear time. Your priority queue need only work with integers. Do not modify any of the provided code. //This is ArrayHeap (provided code) import java.util.Arrays; public class ArrayHeap implements Heap { private int[ ] array; private int size; public ArrayHeap() { array = new int[3]; size = 0; } @Override public void add(int value) { // add pt 1 if(size == array.length) { array = Arrays.copyOf(array, size*2); } array[size] = value; // sifting up int child = size; int parent = (child - 1) / 2; while(array[parent] > array[child]) { swap(parent,…
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.
Create a Queue implementation that makes use of a circular linked list, which is similar to a linked list but has the final value and no null connections.Whenever the list is not empty, next comes before first. one Node instance variable at a time
Write a method to find the largest number in a given queue. The Objects in the queue are integers. You are using the standard Queue class that we discussed in this course. The Queue class has all the standard queue methods, such as, enqueue, dequeue, size, and dequeueAll. The Queue object, q, in the parameter of the method must contain the same elements in the same sequence before leaving the method as they were when entering the method. You are not allowed to use any temporary container (such as another queue, or a stack, or an array, or a linked list.) You can create variables of primitive data types (such as, an integer.) You must use the following header. public int largestNum(Queue q){
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…