n 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.

n 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.

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

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.
This chapter describes the array implementation of queues that use a special array slot, called the reserved slot, to distinguish between an empty and a full queue. Write the definition of the class and the definitions of the function members of this queue design. Also, write a program (in main.cpp) to test various operations on a queue. //Header file QueueAsArray #ifndef H_QueueAsArray #define H_QueueAsArray #include <iostream> #include <cassert> using namespace std; template<class Type> class queueType { public: const queueType<Type>& operator=(const queueType<Type>&); // overload the assignment operator void initializeQueue(); int isEmptyQueue() const; int isFullQueue() const; Type front() const; Type back() const; void addQueue(Type queueElement); void deleteQueue(); queueType(int queueSize = 100); queueType(const queueType<Type>& otherQueue); // copy constructor…
in c++ A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items. Now in the main do the following Insert Items in list Display all items. Traverse the link list so that each items bill gets calculated (by multiplying quantity with price) and also calculate and display Total bill in…
C/C++ Using linked lists implement an amusement park reservation system. The system allows a person to make a reservation for a specific date. A person can change the reservation date or even cancel his booking anytime. The system puts all reservations in a queue. The park will allow only certain number of persons on any given day in order the reservation was made. For each day the system will print out persons allowed to visit the park. For sake of simplicity, dates are being confined to 15th to 30th. The system should ask the user to enter code for different operations. It reads all data from the datafile amusement.dat. The first integer on datafile indicates limit of persons allowed on any day. i)code 1: make reservation, system expects date followed by name (within 20 characters) and makes reservation. If number of bookings exceeds allowed number, then system prints SORRY, QUOTA OVER and moves over to read next code. ii)code 2: change date of reservation, system expects old date,…
A data structure called a deque is closely related to a queue. The name deque stands for “double-ended queue.” The difference between the two is that with a deque, you can insert, remove, or view from either end of the queue. Implement a deque using arrays
In C++, Consider a singly linked list where each node contains two fields – integer dataand node type pointer next. The head pointer of the list, a position, and a valueof data is given. You have to insert a node with the given value at the givenposition. You have to consider any position including first or last. You have toImplement an insert operation as per the above specification.
Write a program for implementing queue using linked lists, for which you should use a structure to create a node with data and the next pointer. The program should be able to insert, delete and display nodes in the queue. The user will be asked to enter his choice either to insert a node (enqueue), delete a node (dequeue), display or to exit from the program.The options for the user should be as the following:1. Insert a node (Enqueue)2. Delete a node (Dequeue)3. Display4. Exit  For example if user selected option 1 then the following should appear in the output:Enter the value to insert:Node is inserted If user selected option 2 then the following should appear in the output:Deleted Element is:  If the user selected option 3 then the program should display the elements that are available in the queue The program will keep on running and taking inputs from the user until he selects the 4th option to exit.
in c++ Write a function that takes a queue with 20 integer values and deletes the elements thatare between 15 and 20. In other words, only the elements less than 15 or greater than 20remain in the queue. This means that you need to have an auxiliary queue to store theelements between 15 and 20 and restore them back to the original queue.
Radix Sorting Algorithm In C++, implement the radix sorting algorithm using a queue class.Steps: Create a queue filled with 10 random integers between 1000 and 9999. Next, create a list of 10 empty queues (0-9 digit bins), then dequeue each number from the main queue and enqueue them into the correct digit bin. Dequeue the numbers from each digit bin in order and enqueue them back into the main queue. Repeat the process for every digit (tens, hundreds, thousands, etc.) Finally, print the sorted list.
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Code in python Given a list, L, the function front_two creates a new list of length 2 out of the first two items in L as follows: In the new list, the second item becomes the first item, and the first item becomes the second. If L contains only one item, the first item in the new list should be the value None. If L is empty, both items in the new list should be value None. The function returns the new list. For example: Test Result L = ['a', 'b', 'c', 'd'] print(front_two(L)) ['b', 'a'] L = [] print(front_two(L)) [None, None] L = [5, 2] print(front_two(L)) [2, 5] L = [7] print(front_two(L)) [None, 7]
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