10. Suppose you are given an implementation of a queue of integers. The operations tha can be performed on the queue are: i. isEmpty (Q) – returns true if the queue is empty, false otherwise. ii. delete (Q) – deletes the element at the front of the queue and returns its value. iii. insert (Q, i) – inserts the integer i at th rear of the queue. Consider the following function: void QUE(queue Q) { int i; if (!isEmpty(Q)) { i = delete(Q); QUE(Q); -

10. Suppose you are given an implementation of a queue of integers. The operations tha can be performed on the queue are: i. isEmpty (Q) – returns true if the queue is empty, false otherwise. ii. delete (Q) – deletes the element at the front of the queue and returns its value. iii. insert (Q, i) – inserts the integer i at th rear of the queue. Consider the following function: void QUE(queue Q) { int i; if (!isEmpty(Q)) { i = delete(Q); QUE(Q); -

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Please implement the following problem in C++: Although a queue is "best" implemented with a list, it can be implemented with a vector if you take into account the starting position of the queue. For example, if five elements are pushed onto the queue, the start of the queue is at position zero and the end is at position 4. If we, then, pop two elements, the start would be at position 2 and the end at position 4. The two "popped" elements are not really removed from the vector, and that avoids the O(N) time problem for the pop function.Implement a class which uses a vector to store the queue. Be mindful of performance, such that if the queue is empty, the size of the underlying vector is "reset."
Write the definition of the function moveNthFront that takes as a parameter a positive integer, n. The function moves the nth element of the queue to the front. The order of the remaining elements remains unchanged. For example, suppose:queue = {5, 11, 34, 67, 43, 55} and n = 3.After a call to the function moveNthFront:queue = {34, 5, 11, 67, 43, 55}Add this function to the class queueType. Also, write a program to test your method.
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);
In C++, develop an algorithm that adds the value val to a queue object Q. The queue is represented using an array data of size s. The algorithm should assume that the queue is not full. The most recently added item is at index r (rear), and the least recently added item is at index f (front). If the queue is empty, r = f = -1.
Write the definition of the function moveNthFront that takes as a parameter a positive integer, n. The function moves the nth clement of the queue to the front. The order of the remaining elements remains unchanged. For example, suppose queue = (5, 11, 34, 67, 43, 55) and n = 3. After a call to the function moveNthFront. queue = (34, 5, 11, 67, 43, 55). Add this function to the class queueType Also write a program to test your method
Starting with an empty Circul Queue, what will be the state of Circular Queue, front, rare, size and number of elements after each of the following operations performed in the order ( i ) enque(A) (ii) enque (B) (iii) enque (C) (iv) dequeue( ) (v) dequeue( ) (vi) enque(D) (vii) enque(E ) (viii) dequeue( )
program in C# the following sequence: S1 = N; S2 = S1 + 1; S3 = 2*S1 + 1; S4 = S1 + 2; S5 = S2 + 1; S6 = 2*S2 + 1; S7 = S2 + 2; … Using the Queue class, write a program in C# which by given N prints on the console the first 50 elements of the sequence. Example: N=2  2, 3, 5, 4, 4, 7, 5, 6, 11, 7, 5, 9, 6, …
Write a java function toRemoves the element at the front of this queue and returns a reference to it. return the element removed from the front of the queue throws EmptyCollectionException if the queue is empty.
Implement a function bool moveNthElem(QueueSLL&,int n) that moves a queue element (data type string )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. The function returns true if N is within the queue range and false otherwise. using c++ and queues
The program inserts a number of values into a priority queue and then removes them. The priority queue treats a larger unsigned integer as a higher priority than a smaller value. The priority queue object keeps a count of the basic operations performed during its lifetime to date, and that count is available via an accessor. In one or two places I have put statements such as op_count++;, but these are incomplete. We only count operations involved in inserting and removing elements, not auxiliary operations such as is_empty() or size() The class implements a priority queue with an unsorted vector. Your assignment is to re-implement the priority queue implementation using a heap built on a vector, exactly as we discussed in class. Leave the framework and public method interfaces completely unchanged. My original test program must work with your new class. You will have to write new private methods bubble_up and percolate_down in C++ language. You should not implement heapify or heapsort.…
The program inserts a number of values into a priority queue and then removes them. The priority queue treats a larger unsigned integer as a higher priority than a smaller value. The priority queue object keeps a count of the basic operations performed during its lifetime to date, and that count is available via an accessor. In one or two places I have put statements such as op_count++;, but these are incomplete. We only count operations involved in inserting and removing elements, not auxiliary operations such as is_empty() or size() The class implements a priority queue with an unsorted vector. Your assignment is to re-implement the priority queue implementation using a heap built on a vector, exactly as we discussed in class. Leave the framework and public method interfaces completely unchanged. My original test program must work with your new class. You will have to write new private methods bubble_up and percolate_down. You should not implement heapify or heapsort. #include…
Consider the current elements and its indexes in the queue of size 15: {index[00]=102, index[01]=165, index[02]=115, index[03]=384, index[04]=248, index[05]=111}, draw a table (like shown below) the sequence of elements using the operations listed from number 1 to 26 using the queue approach (A) - in shifting the elements one position forward every time an element is deleted. The following are the description of other operations to be used that would result in a QUEUE that contains the elements. IsTopValue – returns the value at the TOP of the queue. IsRearValue – returns the value at the REAR of the queue. IsTopIndex – returns the index of the value at the TOP of the queue. IsRearIndex – returns the index of the value at the REAR of the queue. IsIndexOf – returns the index of the specific value. IsValueOf – returns the value of the specific index. Insert (Q, 12) Dequeue (Q) Dequeue (Q) Insert (Q, 65) Insert (Q, 100) Insert (Q, 43) Dequeue (Q) IsTopValue (Q) Insert (Q, 61) Dequeue…