Q4) Write a program that create two objects (A, B) from the queue class, and do the following Add 100 elements to queue A by results of multiplication table from (1 to 10). Add 10 elements to queue B by summation of the results of each table alone. Convert the average values of B tobinary number if the average number(ex:212 binary number)

Q4) Write a program that create two objects (A, B) from the queue class, and do the following Add 100 elements to queue A by results of multiplication table from (1 to 10). Add 10 elements to queue B by summation of the results of each table alone. Convert the average values of B tobinary number if the average number(ex:212 binary number)

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

Write your own functions to create, insert nodes (both from the front and the end of the list), delete nodes, count the number of nodes, display all the nodes, display a specific node for the linked list. C++ and Java
Question 9: Draw internal representation of the queue q for each step of the following code: ArrayBoundedQueue<Integer> q = new ArrayBoundedQueue<Integer>(6); q.enqueue(37); q.enqueue(86); q.enqueue(54); q.enqueue(71); q.dequeue(); q.enqueue(97); q.dequeue();
write a function to remove the common items in the two queuesand save the common items in a queue and return itNote: solve it without using different data structures such as array.
True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 3) Given a priority queue implemented as a standard linked list with only a head pointer, insert performing at O(n) and remove at O(1), and the following functions performed (higher numbers represent higher priorities): Insert(“Rick”, 75), Insert(“Carol”, 80), Insert(“Daryl”, 65), Remove(), Insert(“Negan”, 60), Insert(“Maggie”, 25), Remove(), Insert(“Michonne”, 55) a. If Insert(“Eugene”, 40) is called, it will be added as the last node in the linked list b. The linked list from head to the end at this point is Rick, Negan, Michonne, and then Maggie c. Carol was the first element removed from the priority queue
1.3.14 Create a class called ResizingArrayQueueOfStrings that implements the queue abstraction using a fixed-size array. Then, as an extension, utilise array resizing in your implementation to get rid of the size restriction. 1.3.15 If standard input contains k or more strings, create a Queue client that accepts the command-line argument k and outputs the kth string from the last string located there.
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.
If the elements “A”, “B”, “C” and “D” are placed in a queue and are removed one at a time, in what order will they be removed?
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)
Write the code to delete a node in the middle of a list implemented as a linked list with the dummy node (see Exercise 3). Compare your answer with the answer to Exercise 3. Are they the same? What do you conclude? Does the dummy node simplify the operation on the list? How?
Think about the following example: A computer program builds and modifies a linked list like follows:Normally, the program would keep tabs on two unique nodes, which are as follows: An explanation of how to use the null reference in the linked list's node in two common circumstances
In Javascript an array can be treated like a queue---a FIFO (first-in, first-out) data structure. Which two array operations that we studied in class can be used together to treat an array as a queue? a. isEmpty() and isFull() b. queue() and unqueue() c. unshift() and pop() d. push() and pop() e. unshift() and shift()
Make a data type that resembles a queue but allows just one insert per element. Keep track of all elements that have ever been added using an existence symbol table, and refuse requests to re-insert such elements.