Combining sorted queues. Create a static function that accepts two sorted queues as parameters and returns a queue formed by merging the queues into sorted order. 2.2.15 Mergesort from the bottom of the queue. Create a bottom-up mergesort implementation using the following method: Create N queues, each containing one of the things, given N items. Make a queue out of the N queues. Then, repeat Exercise 2.2.14's merging process on the first two queues, and finally, reinsert the combined queue. Repeat until there is just one q

Combining sorted queues. Create a static function that accepts two sorted queues as parameters and returns a queue formed by merging the queues into sorted order. 2.2.15 Mergesort from the bottom of the queue. Create a bottom-up mergesort implementation using the following method: Create N queues, each containing one of the things, given N items. Make a queue out of the N queues. Then, repeat Exercise 2.2.14's merging process on the first two queues, and finally, reinsert the combined queue. Repeat until there is just one 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 5PE

See similar textbooks

Similar questions

Combining sorted queues (2.2.14). Make a static function that takes two sorted queues as input and returns a queue constructed by merging the queues in sorted order. 2.2.15 From the bottom of the queue, mergesort. Use the following way to create a bottom-up mergesort implementation: Given N items, create N queues, each containing one of the things. Create a queue from the N queues. Then, repeat the merging procedure from Exercise 2.2.14 on the first two queues, and lastly, reinsert the merged queue.Repeat until only one queue remains in the queue of queues.
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
2.2.14 Sorted queues being combined. Create a static function that receives two queues of sorted items as inputs and returns a queue formed by combining the two queues into a single sorted order queue. 2.2.15 Bottom-up mergesort of a queue. Create an implementation of the bottom-up mergesort using the following strategy: Make N queues, each holding one of the N things, given N items. assemble the N queues into a queue. Apply Exercise 2.2.14's merging process to the first two queues several times, and at the conclusion, reinsert the combined queue.Continue until there is just one queue left in the queue of queues.
2.2.14 Merging sorted queues. Develop a static method that takes two queues of sorteditems as arguments and returns a queue that results from merging the queues intosorted order.2.2.15 Bottom-up queue mergesort. Develop a bottom-up mergesort implementationbased on the following approach: Given N items, create N queues, each containing oneof the items. Create a queue of the N queues. Then repeatedly apply the merging operation of Exercise 2.2.14 to the first two queues and reinsert the merged queue at the end.Repeat until the queue of queues contains only one queue.
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 the end.…
A linked list is developed with the following set of nodes in sequence: 25, 40, 66, 38 and 53. The list first node is referred by First reference variable. The second node is referred by P reference variable while the second last node is referred by Q reference variable. Compose Java statements for the following operations: a) Replace the third node value to 55 using all possible reference variables. b) Delete the last node using the shortest path of reference variable. Then deallocate the memory. Shows all steps involved. c) Insert new node with value 99. Make the new node as third node in the list. Shows all steps involved. d) Destroy the linked list.
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…
3. Write a function to return the median value in a sorted linked list. If the length i of the list is odd, then the median is the ceiling(i/2) member. For example, given the list (1, 2, 2, 5, 7, 9, 11) as input, your function should return the value 5. If the length of the list is even, then the median is the mean of the i/2 and (i/2)+1 members. Thus, the median of the sorted list (2, 4, 8, 9) is (4+8)/2. Finally, define the median of an empty list to be 0.
Q#1: In each plastic jar of M&M’s candy, random colored candies are stored. Your little brother/sister likes only the yellow ones, so he/she carefully take out all the yellow candies, one by one, and eats them, and keep the other in order so that he/she can return them to the container, in exactly the same order as they are before, minus the yellow ones. Implement using stack data structure.Using Java.
Write a function to sort a linked list of integers as follows: a) Find the largest value in the list. (the student should implement this function) b) delete it from its position and insert it at the head of the list. c) starting from what is now the second element, repeat (a) and (b). d) starting from what is now the third element, repeat (a) and (b). Continue until the list is sorted. please answer it in C++
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.
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list Develop your solution as follows: First copy the nodes of the current list (self) Create a new list with the copied nodes Loop through the nodes of the new list checking the value field If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L): def clone(self): def clone_node(node): return <... YOUR CODE HERE ...> r = <... YOUR CODE HERE...> return r return L4_class(*args,**kwargs)