Implement a complete class in c ++ code that represents a queue. The stack must contain the operations enqueue (e) and dequeue (): e, with standard semantics. Describe the complexity of the two operations in your code. Specify the optimal complexity of push and pop. If your solution does not have this complexity describes how to go about achieving it. Your only restriction is that you may not use the class std :: queue .

Implement a complete class in c ++ code that represents a queue. The stack must contain the operations enqueue (e) and dequeue (): e, with standard semantics. Describe the complexity of the two operations in your code. Specify the optimal complexity of push and pop. If your solution does not have this complexity describes how to go about achieving it. Your only restriction is that you may not use the class std :: queue .

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

IN C++Implement the Priority Queue ADT using a custom list. The elements of the Priority Queue can be of any type (you have to use OOP with templates). Test the Priority Queue operations in the main function for class Point2D (You can find in the textbook the implementation of the Point2D class, and comparators LeftRight and BottomUp), and make sure that we can use the Priority Queue for at least 2 Comparators, as follows: ListPriorityQueueQueueG ListPriorityQueueQueueG
Implement a complete class in c ++ code that represents a stack. The stack must contain the operations push (e) and pop (): e, with standard semantics. Both operations must be 0 (1).Your only restriction is that you may not use the class <T> from std ::
Implement a complete class in c ++ code that represents a priority queue. The gender should contain the operations top (): e, pop (), and push (e) with reasonable semantics. Describe the complexity of all operations.You can use all aids from the default library except std :: priority_queue.
Implement a complete class in c ++ code that represents a priority queue. The priority queue must contain the operations push (e) and pop (): e, with standard semantics.Describe the complexity of the two operations in your code.Specify the optimal complexity of push and pop. If your solution does not have this complexity describes how to proceed to achieve it.Your only restriction is that you may not use the class <T> from std ::
In this project, you will develop algorithms that find road routes through the bridges to travel between islands. The input is a text file containing data about the given map. Each file begins with the number of rows and columns in the map considered as maximum latitudes and maximum longitudes respectively on the map. The character "X" in the file represents the water that means if a cell contains "X" then the traveler is not allowed to occupy that cell as this car is not drivable on water. The character "0" in the file represents the road connected island. That means if a cell contains "0" then the traveler is allowed to occupy that cell as this car can drive on roads. The traveler starts at the island located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper left comer, and the goal is to drive to the island located at (MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal move from an island is to move left, right, up, or down to an immediately adjacent cell…
1. Using the above class map, write function void map::mapToGraph(graph &g){...} to create a graph g that represents the legal moves in the map m. Each vertex should represent a cell, and each edge should represent a legal move between adjacent cells. 2. Write a recursive function findPathRecursive(graph &g, stack &moves) that looks for a path from the start island to the destination island. If a path from the start to the destination exists, your function should call the map::printPath() function that should print a sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If no path from the start to the destination exists, the program should print, "No path exists". If a solution exists the solver should also simulate the solution to each map by calling the map::print() function. The map::print() function prints out a map visualization, with the goal and current position of the car in the map at each move, marked to show the progress. Hint: consider recursive-DFS. 3.…
2. a. The "queueClass" shown below is not complete. Add member functions and friend functions to the class interface at appropriate places as directed by the comments given in the program. Show the implementation of the overloaded != operator b. c. Show the implementation of the overloaded << operator For questions (b) and (c), assuming the queue is implemented using a singular, circular linked list with backPtr pointing at the last node in the list class queueClass
Solve in C++ In this problem, you will write a method that reverses a linked list. Your algorithm must have a worst-case runtime in O(n) and a worst- case space complexity of O(1) beyond the input. For example, if our input is: 5 7 1 2 3 then we should print: 3 2 1 7 5 Running and testing: If you click run, you may notice that your IDE seems to do nothing. Scan- ner is waiting for an input so to test something, enter space-separated numbers like: 3 5 1 2 5 and hit enter, a linked list will be created with those values, call your reverse method, and print out the result. Please note that the result code contains the following les: Node: A class representing linked list nodes. Each node contains an integer value, a variable next representing the next node in the list (which is null if we're at the last node), and a variable 1 prev representing the previous node in the list (which is null if we're at the rst node). LinkedList: A class representing a stripped-down version of a linked list.…
Develop a program in C++ that will implement a Josephus Circle using circular linked list. There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number m which indicates that m-1 persons are skipped and mth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive. ***Using #include <iostream>
A deque (pronounced "deck") is an abstract data type that combines what a stack can do and what a queue can do. Thus, users are allowed to add items to either end of a deque and inspect/remove them from either end. Thus, a deque can act as stack or queue. Given the following ADT specification, implement the behavior of deque based on a circular array as the one discussed for an array-based implementation of the queue. Template<class T> Class Deque { Public: int size(); Boolean isEmpty(); // similar to push Void insertFirst(T e); // similar to enqueue Void insertLast(T e); // similar to dequeue T removeFirst(); // similar to pop T removeLast(); // returns the first element of deque without removing it T first(); // returns the last of deque without removing it T last(); }
Develop a program in C++ that will implement a Josephus Circle using circular linked list. There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number m which indicates that m-1 persons are skipped and mth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive.
10. IN C++ Implement the Priority Queue ADT using a custom list (you can use the NodeListG explained in lecture 7, you can find C++ code on the blackboard). The elements of the Priority Queue can be of any type (you have to use OOP with templates). Test the Priority Queue operations in the main function for class Point2D (You can find in the textbook the implementation of the Point2D class, and comparators LeftRight and BottomUp), and make sure that we can use the Priority Queue for at least 2 Comparators, as follows: ListPriorityQueueQueueG ListPriorityQueueQueueG