friend ostream& operator<<(ostream&, const TaskManager&); This friend function overloads operator<< to display information about the TaskManager parameter, showing the tasks and their related indices in queue_. You are not allowed to access any slot of queue_ that does not have an active task. Keep in mind that front_ may be smaller than, the same as, or larger than rear_. If there is no task in queue_, the function shall display "Empty Queue" or "No task".

friend ostream& operator<<(ostream&, const TaskManager&); This friend function overloads operator<< to display information about the TaskManager parameter, showing the tasks and their related indices in queue_. You are not allowed to access any slot of queue_ that does not have an active task. Keep in mind that front_ may be smaller than, the same as, or larger than rear_. If there is no task in queue_, the function shall display "Empty Queue" or "No task".

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 10PE

See similar textbooks

Similar questions

Write a function that takes two queue structures as parameters: original queue and modified queue. The function finds the numbers greater than or equal to 5 in the original queue and places 1 to the same position in the modified queue. For the numbers less than 5, modified queue element has 0. Assume that two input queues have the same number of elements at a time. Example Original Queue: 351628 Example Modified Queue: 01101 void modifyqueue (struct queue *org, struct queue *mod){ Note that you need printqueue function to display the queue contents in order to verify your solutions.
The Priority. Queue ADT As an ADT, a priority queue P supports the following functions: • isPQueueEmpty(): returns true if pqueue is empty otherwise false size(): Return the number of elements in P. empty(): Return true if P is empty and false otherwise. Example: The following table shows a series of operations and their effects on an initially empty priority queue P. Each element consists of an integer. which we assume to be sorted according to the natural ordering of the integers. Note that insert(e): Insert a new element e into P. min(): Return a reference to an element of P with the smallest associated kex value (but do not remove it); an error condition occurs if the priority queue is empty. removeMin): Remove from P the element referenced by min(); an error condition occurs if the priority queue is empty. each call to min returns a reference to an entry in the queue, not the actual value. Although the "Priority Queue" column shows the items in sorted order, the priority queue…
Student should be able to develop the programs for queue using arrays and linked list By Using C++ software. Exercise 1: Implementation of Queue using Array or Linked list Consider a real life situation. Formulate a question and then design a simulation that can help to answer it. Choose one of the following situations: • Cars lined up at a car wash • Customers at a grocery store check-out • Airplanes taking off and landing on a runway • A bank teller Be sure to state any assumptions that you make and provide any probabilistic data that must be considered as part of the scenario.
Create a node class named LinkedNodes that uses up to 4 dynamic pointers to connect it to the other 8 nodes in the structure (a total of 9). The data in each node will be a unique integer number from 1 through 9. Include in your class definition these functions at a minimum: getVal(), setVal(), getNext(), setNext(), getPrev(), setPrev(), constructor(s) and destructor. Write a simple program to load these nodes into a linked structure. Do not use an array, the pointers will do that for you. You should be able to reach any node from any other node in the structure by traversing a maximum of 2 nodes from the current one. The output from your program should report the traversals between all nodes in the structure, starting with the node whose value is one. (See the example below) Node 1 2 3 4 5 6 7 8 9 -> Traverses to Node 1 Node 2 1->2 2->6->1 3->6->1 3->7->2 4->6->1 4->7->2 4->8->3 5->6->1 5->7->2 5->8->3 6->1->2 6->1->3 7->1->3 8->3 6->1 7->1 8->1 9->1 Node 3 1->3 2->3 7->2 8->2 9->2…
Tour.java Create a Tour data type that represents the sequence of points visited in a TSP tour. Represent the tour as a circular linked list of nodes, one for each point in the tour. Each Node contains two references: one to the associated Point and the other to the next Node in the tour. Each constructor must take constant time. All instance methods must take time linear (or better) in the number of points currently in the tour. To represent a node, within Tour.java, define a nested class Node: private class Node { private Point p; private Node next; } Your Tour data type must implement the following API. You must not add public methods to the API; however, you may add private instance variables or methods (which are only accessible in the class in which they are declared). public class Tour // Creates an empty tour. public Tour() // Creates the 4-point tour a→b→c→d→a (for debugging). public Tour(Point a, Point b, Point c, Point d) // Returns the number of points in this tour. public…
Can you please help me with this code because i am struggling on how to do this, this code has to be in C code.question that i need help with:Priority with round-robin schedules tasks in order of priority and uses round-robin scheduling for tasks with equal priority. There will be multiple queues in the system each representing one priority class. For ease of implementation, you need total 1 through max_priority numbers of queues. You should start scheduling job out of the max priority queue and serve the members of the queue following RR. The schedule of tasks has the form [task name] [priority] [CPU burst], with the following example format: T1, 4, 20 T2, 2, 25 T3, 3, 25 T4, 3, 15 T5, 10, 10 The output should look like this: Running task = [P1] [4] [5] for 5 units. Task P1 finished. Running task = [P5] [3] [4] for 4 units. Task P5 finished. Running task = [P4] [2] [7] for 1 units. Task P4 exhausted its Quantum hence will be Rescheduled. Running task = [P3] [2] [1] for 1 units. Task…
10. Suppose you are given an implementation of a queue of integers. The operations that 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 the rear of the queue. Consider the following function: void QUE(queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); QUE(Q); insert(Q, i); } } What operation is performed by the function QUE assuming the elements 1, 2, 3, 4 are in the queue ? %D Leaves the queue unchanged Empties the queue Q Reverse the order of the elements in queue Q Deletes the elements of the queue Q from the front and inserts it at the rear of the Queue Qkeeping the other elements in the same Ogen
Given the following specifications of a front operation for queue Item type front Function: Queue is not empty. Precondition: Queue is not changed. a. Write this operation as client code, using operations from the QueueType class. b. Write this function a new member function of the QueueType class.
A Queue is a special array where the insertion and deletion will be via a specific index called "head". A Queue is characterized by 3 attributes: a. capacity (int): the maximum number element Member that can be contained into the Queue; b. head: presents the index where we can add/remove element to the Queue. The head value presents also the current number of elements into the Queue. When a Queue is created the initial value of head is 0; c. Member content[]: an array of elements of type Member; Creates the class Queue with the following methods: a. a Constructor able to create a Queue with maximum 10 Members; b. bool empty (): this method returns true if no element exists in the Queue c. bool full(): this method returns true if there are no place to add a new element to the Queue; d. overload the operator += (Member): able to add an element to the Queue. You need to be sure that there is an available space in the Queue (use the assert function). e. delete(): able to delete an element…
Create a circular queue using fixed size array. Each index of your queue should store the execution timeof the process. Your task is to provide the implementation of following functions: constructor should receive the array size and create a dynamic array. enqueue (function to insert the element into a queue) dequeue (function to remove the element from the queue) isEmpty (function to check whether the queue is empty or not) isFull (function to check whether the queue is full or not) getLength (function to return the total elements in the queue) getSize (function to return the size of queue) reSize (This function should receive the new size as a parameter and resize the queue as per thenew size) getRear (function to return the last elements from the queue) getMin (function to return the index with least execution time) getMax (function to return the index with maximum execution time) getCountofSimilar (function to return the processes with same execution time) show (this…
Your Tasks ● Read the description thoroughly and carefully to understand exactly what IsolateTargetSoloAsTail is meant to do and the IMPORTANT requirements you must meet when implementing the function. ● Fill in the prototype for IsolateTargetSoloAsTail in the supplied header file (llcpInt.h). ● Fill in the definition for IsolateTargetSoloAsTail in the supplied implementation file (llcpImp.cpp). ●If node target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list. ●If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list. If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list. The order in which non-target-matching nodes originally appear in the given…
You should not make any changes to DPQueue.h. ● Fill in the implementation of all the "stub" functions in the file (those with output statements containing the message "??? not implemented yet"), // FILE: DPQueue.h// CLASS PROVIDED: p_queue (priority queue ADT)// TYPEDEFS and MEMBER CONSTANTS for the p_queue class:// typedef _____ value_type// p_queue::value_type is the data type of the items in// the p_queue. It may be any of the C++ built-in types// (int, char, etc.), or a class with a default constructor, a// copy constructor, an assignment operator, and a less-than// operator forming a strict weak ordering.//// typedef _____ size_type// p_queue::size_type is the data type considered best-suited// for any variable meant for counting and sizing (as well as// array-indexing) purposes; e.g.: it is the data type for a// variable representing how many items are in the p_queue.// It is also the data type of the priority associated…