Please help with C++Priority Queue question in C++ language.Sample output also in image. Thanks. Part 2: Priority QueueUsing the effect of the following operation sequence on the heap implementation of the priorityqueue ADT.myqueue.insert(59);myqueue.insert(41);2CPSC 250Fall 2021myqueue.insert(25);myqueue.insert(12);myqueue.insert(91);myqueue.min();myqueue.extractMin();myqueue.insert(34);myqueue.insert(63);myqueue.extractMin();myqueue.insert(75);myqueue.insert(85);myqueue.extractMin();Using a heap, implement the priority queue class. The class should have a static constantmember variable, CAPACITY, which is the maximum size of the heap and an array, data, thatcontains the heap with the entries. (should use priorityQueue.h & dirver.cpp in the D2L) My priority Queue is emptyAfter inserting 59 Priority Queue has59,After inserting 41 Priority Queue has41, 59,After inserting 25 Priority Queue has25, 59, 41,After inserting 12 Priority Queue has12, 25, 41, 59,After inserting 91 Priority Queue has12, 25, 41, 59, 91,After extracting the minimum value Priority Queue has25, 59, 41, 91,After inserting 34 Priority Queue has25, 34, 41, 91, 59,After inserting 63 Priority Queue has25, 34, 41, 91, 59, 63,After extracting the minimum value Priority Queue has34, 59, 41, 91, 63,After inserting 75 Priority Queue has34, 59, 41, 91, 63, 75,After inserting 85 Priority Queue has34, 59, 41, 91, 63, 75, 85,After extracting the minimum value Priority Queue has41, 59, 75, 91, 63, 85,Mininum value is 41Press any key to continue

class priorityQueue { private: int size; int *data; public: static const int CAPACITY = 50;…

Answered: Please help with C++Priority Queue…

Engineering

Computer Science

Please help with C++Priority Queue question in C++ language. Sample output also in image. Thanks.

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

A priority queue is implemented as a linked list, sorted from largest to smallest element. a. How would the definition of PQType change? b. Write the Enqueue operation, using this implementation. c. Write the Dequeue operation, using this implementation. d. Compare the Enqueue and Dequeue operations to those for the heap implementation, in terms of Big-O notation.
please provid orignal answer 7. Binary Heaps (Priority Queues!). Enqueue (insert) the value 6 to the following binary heap, then do a Dequeue (deleteMin): Starting heap: 3 7 5 9 7 12 8 14 After enqueue (insert): After dequeue (deleteMin): draw it out
Programming language: JAVA Show the heap-based(min) priority queue constructed by inserting the following elements, either graphically or by listing the contents of the underlying array 8 6 0 4 2 1 3 5 7 9
Implementing a Stack ADT using a linked solution. The implementations are linked Nodes. class Node: def __init__(self, data, node=None): # Initialize this node, insert data, and set the next node if any self.data = data self.chain = node class SubSetStack: def __init__(self, data=None): # Initialize this stack, and store data if it exists def push(self, data): # Add data to the beginning of the stack def pop(self): # Remove the element at the beginning of the stack. # Return the data in the element at the beginning of the stack, or None if the stack is empty def top(self): # Return the data in the element at the beginning but does not remove it. # Return None if stack is empty. def __len__(self): # Return the number of elements in the stack def subset_sum(target, sub_list): # Returns True if Target can be formed from sub_list repeated # some arbitrary number of times. In the above function a Node…
The Min-priority Queue is an abstract data type (ADT) for maintaining a collection of elements,each with an associated value called a key. The ADT supports the following operations:• INSERT(Q,x): insert the element x into the queue Q.• MIN(Q): returns the element of Q with the smallest key.• EXTRACT-MIN (Q): removes and returns the element of Q with the smallest key.Implement in Java the Min-priority Queue ADT defined above using a) an array based binary heap b) a binary search tree. Observe that the ADT implementation operations should be in the form q.insert(x),q.min(), etc. Explain in the report your implementation, noting the running time (using bigOh notation) of each operation in both implementations. c) What are the worst-case running times of the three ADT operations when theunderlying BST is self-balancing? Briefly explain your answer. d) Implement an extension of BST that allows MIN and EXTRACT-MIN operations in O(1). Briefly describe your implementation in the report. Hint:…
Consider the following code segment , The variable q is an object of type Queue, the variable s is an object of type Stack. peek method looks at the first element in the queue without removing it. the remove method removes the first element from the queue. add method adds an element to the and of the queue or add an element to the top of the stack. pop method removes an element from the top of the stack What would be the content of the variable q (8 numbers) after we complete the second while loop in the code for (int i = 30; i <= 40; i ++) { if(i % 3 == 0) q.add(i); } while (!q.isEmpty()) { s.add(q.peek()); s.add(q.peek()); q.remove(); } while (!s.isEmpty()) { q.add(s.pop()); }
Implement a double-ended queue. It is a variation where enqueues and dequeues are allowed on both ends. Implement the following double-ended queue operations using circular array representation with variables for the front and rear indices: a. new b. clear c. enqueueFront d. enqueueRear e. dequeueFront f. dequeueRear g. isEmpty h. isFull i. peek
create a treap but the priorites should be based of min heap (meaning the to highest priority should be the smallest) this should be done in c# with a node class of type T the add method should be something like this private Node Add(T item, Node root) the remove/ delete node should be done without recursion please it should be done in c# it should be done in c# do not do it in c or c++ please show testing thank youu.
Implement the class MaxHeapPQ that implements the interface MaxPriorityQueue using the maximum-oriented heap. Add a method min() to find the minimal key of a maximum-oriented heap priority queue. note: - create a file MaxHeapPQ.java . You may start with the Java program with this file(the code below) and also provide output screenshot. import java.util.Iterator; import java.util.ArrayList; class MaxHeapPQ<K extends Comparable<K>> implements MaxPriorityQueue<K> { private K data[]; private int size; private int capacity; // constructors public MaxHeapPQ() { capacity = 100; size = 0; data = (K[]) new Comparable[capacity]; } public MaxHeapPQ(int c) { capacity = c; size = 0; data = (K[]) new Comparable[capacity]; } // required priority queue methods public boolean isEmpty(){ //ADD CODE } public void add(K x) throws Exception { //ADD CODE } public K removeMax() throws Exception { if (size <= 0) throw new Exception("Priority Queue Empty"); //ADD CODE } // auxiliary…
Write a function that converts a given min heap which is implemented by arravs to a max heap. The prototype of the function is queue "convert(queue "q).in c language
There is one stacks and one queue q and then following operations are performed upon these two. Push A, enqueue B, push C, pop, pop, enqueue D, push E, dequeue, enqueue F .What is the total number of elements, which are left in the queue and stack in the end.
Implement the class MaxHeapPQ that implements the interface MaxPriorityQueue using the maximum-oriented heap. Add a method min() to find the minimal key of a maximum-oriented heap priority queue. note: - create a file MaxHeapPQ.java . You may start with the Java program with this file(the code below). import java.util.Iterator; import java.util.ArrayList; class MaxHeapPQ<K extends Comparable<K>> implements MaxPriorityQueue<K> { private K data[]; private int size; private int capacity; // constructors public MaxHeapPQ() { capacity = 100; size = 0; data = (K[]) new Comparable[capacity]; } public MaxHeapPQ(int c) { capacity = c; size = 0; data = (K[]) new Comparable[capacity]; } // required priority queue methods public boolean isEmpty(){ //ADD CODE } public void add(K x) throws Exception { //ADD CODE } public K removeMax() throws Exception { if (size <= 0) throw new Exception("Priority Queue Empty"); //ADD CODE } // auxiliary utility methods private void…