This is the souce code for Queues, but it has so many errors. Please update this without errors and warnings. template int queue ::isDecreasing() const { if (size() < 2) return true; cout << "test" << endl; for (size_t i = 0; i < size() - 1; i++) { cout << (i + 1 + _front) % _capacity << " : " << elements[(i + 1 + _front) % _capacity] << " vvvvv " << (i + _front) % _capacity << " : " << elements[(i + _front) % _capacity] << endl; if (elements[(i + 1 + _front) % _capacity] > elements[(i + _front) % _capacity]) return false; } return true; } template size_t queue::count(const T& data) const; { size_t counter = 0; for (size_t i = 0; i < size(); i++) { cout << i << ":" << elements[(_front + i) % _capacity] << endl; if (elements[(_front + i) % _capacity] == data) counter++; } return counter; }

This is the souce code for Queues, but it has so many errors. Please update this without errors and warnings. template int queue ::isDecreasing() const { if (size() < 2) return true; cout << "test" << endl; for (size_t i = 0; i < size() - 1; i++) { cout << (i + 1 + _front) % _capacity << " : " << elements[(i + 1 + _front) % _capacity] << " vvvvv " << (i + _front) % _capacity << " : " << elements[(i + _front) % _capacity] << endl; if (elements[(i + 1 + _front) % _capacity] > elements[(i + _front) % _capacity]) return false; } return true; } template size_t queue::count(const T& data) const; { size_t counter = 0; for (size_t i = 0; i < size(); i++) { cout << i << ":" << elements[(_front + i) % _capacity] << endl; if (elements[(_front + i) % _capacity] == data) counter++; } return counter; }

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

In Java In this assignment, you should provide a complete CircularQueueDriver class that fullytests the functionality of your CircularQueue class that you have improved in Lab 8. YourCircularQueueDriver class should:• Instantiate a 3-element CircularQueue.• Use a loop to add strings to the queue until the add method returns false (whichindicates a full queue).• Call showQueue.• Use a loop to remove strings from the queue until the remove method returns null(which indicates an empty queue). As you remove each string from the queue, print theremoved string.Sample Run:Monsieur AMonsieur BMonsieur Cremoved: Monsieur Aremoved: Monsieur Bremoved: Monsieur C CircularQueue Class: public class CircularQueue { private String[] queue; // array that implements a circular queue private int length = 0; // number of filled elements private int capacity; // size of array private int front = 0; // index of first item in queue private int rear = 0; // one past the index of the last item…
#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();…
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.
#include <iostream>using namespace std; class Queue { int *queue, size, front, rear;public: Queue(int size) { queue = new int[size]; this -> size = size; front = rear = -1; } ~Queue() { delete[] queue; } void push(int val) { if (rear == -1) { queue[++rear] = val; front++; } else { if (rear == ((front - 1) % size)) throw "Queue Full!"; if (rear == size - 1) rear = -1; queue[++rear] = val; } } int pop() { if (front == -1) throw "Queue Empty!"; int ret = queue[front]; front = (front + 1) % size;…
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…
can you explain why the code shown below does not output: pineapple lime and how to fix it when using the driver program shown in screen shot to test. i also attach of the LLNode class // Note: It is important to implement this file as a circular queue without 'front' pointer public class CircularLinkedQueue<T> implements QueueInterface<T> { protected LLNode<T> rear; // reference to the rear of this queue protected int numElements = 0; public CircularLinkedQueue() { rear = null; } public void enqueue(T element) { // Adds element to the rear of this queue. LLNode<T> newNode = new LLNode<T>(element); if (isEmpty()) { rear = newNode; newNode.setLink(newNode); numElements++; } else { rear = newNode; newNode.setLink(rear.getLink()); rear.setLink(newNode); numElements++; } } public T dequeue() { // Throws QueueUnderflowException if this queue is empty; // otherwise, removes front element from this queue and returns it if (isEmpty()) throw new…
This assignment will require you to implement a generic interface (Queue<T>) with an array based queue implementation class QueueArray<T>. floating front design. Once you have implemented the class, the test program will run a client test program on the enqueue, dequeue, display and full methods. The test program will create queues of Integers as well as String objects. Enjoying the power of your generic implementation both will work with no additional changes. There are TODO based comments in the implementation file. Create a project and demonstrate that you can successfully create the required output file, shown below. Thr file includes: Queue.java package queueHw; public interface Queue <T> { public boolean empty(); public boolean full(); public boolean enqueue(T data); public T dequeue(); public void display(); } ... TestQueue.java package queueHw; public class TestQueue { public static void main(String[] args) { //TEST QueueArray with…
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 q2: empty After method call: front rear q1: 14 25 50 70 35 45 19 10 21 q2: 50 70 45 25 35 19…
Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; this.nextNodeRef = null; } // Constructor public ItemNode(String itemInit, ItemNode nextLoc) {…
Queue example – make this generic, instead of a Queue of Customer. public class Queue { private ArrayList<Customer> line; public Queue() { line = null; } public void enqueue (Customer c) { Customer newc = new Customer (c); // copy constructor plateful.add(newc); } public Customer dequeue (Customer c) { Customer newc = line.get(0); plateful.remove(0); return newc; } } // end of class definition
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…
A) Write a generic Java queue class (a plain queue, not a priority queue). Then, call it GenericQueue, because the JDK already has an interface called Queue. This class must be able to create a queue of objects of any reference type. Consider the GenericStack class shown below for some hints. Like the Stack class below, the GenericQueue should use an underlying ArrayList<E>. Write these methods and any others you find useful: enqueue() adds an E to the queue peek() returns a reference to the object that has been in the queue the longest, without removing it from the queue dequeue() returns the E that has been in the queue the longest, and removes it from the queue contains(T t) returns true if the queue contains at least one object that is equal to t *in the sense that calling .equals() on the object with t the parameter returns true.* Otherwise contains returns false. size() and isEmpty() are obvious.