Consider the following implementation of a queue using 2 stacks. Let S1 and S2 be the two stacks and initially are both empty. enqueue(x): Push x into S1. dequeue(x): If S2 is not empty, then pop an item from S2 and return it. If S2 is empty, pop all items from S1 and push them into S2, then pop an item S2 and return it. Show that the amortized cost for each queue operation is O(1).

Consider the following implementation of a queue using 2 stacks. Let S1 and S2 be the two stacks and initially are both empty. enqueue(x): Push x into S1. dequeue(x): If S2 is not empty, then pop an item from S2 and return it. If S2 is empty, pop all items from S1 and push them into S2, then pop an item S2 and return it. Show that the amortized cost for each queue operation is O(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

Implement a stack with a single queue so that each stackoperations takes a linear number of queue operations. Hint : To delete an item, get allof the elements on the queue one at a time, and put them at the end, except for the lastone which you should delete and return. (
1. Suppose you have a circular queue of size 6 (1 to 6). Initially the value of thefront and rear is 0. Now show the state of the queue if the following operationis performed on the queue. Also find the value of front and rear in each step.insert (10); insert (5), delete (), insert (9); insert (9); insert (7); insert (5); insert(8); insert (10); insert (11).
Implement a queue using two stacks. Your solution should have a time complexity of O(1) for enqueue and dequeue operations.
Write a program in Python to show how a queue works using empty, size, front, back, push item onto queue, and push item off queue.
Write a program for the implementation of a queue using singly linked list. The elements of the queue should be strings of length at most 20 characters. Print the queue and do the following operations on the created queue : (a) Insert a new element. (b) Delete an element from the queue.
Lab 18: Stack, SentenceReverser Use a stack to reverse the words of a sentence. Keep reading words until you have a word that ends in a period, adding them onto a stack. When you have a word with a period, pop the words off and print them. Stop when there are no more words in the input. For example, you should turn the input Mary had a little lamb. Its fleece was white as snow. into Lamb little a had mary. Snow as white was fleece its. Pay attention to capitalization and the placement of the period.
QUESTION 9 Write a complete Java program to implement a QUEUE in a bank using LinkedList class as follows: • Provide the menu as shown below; use an infinite loop; stop when user opts 4. 1. Add a customer 2. Remove a customer 3. Show the queue 4. Exit • Add a customer should add an int number at the end of queue using the method addLast(). • Remove a customer should delete the int from front using the method removeFirst(). Show the queue should display the numbers in queue using the method System.out.printIn(). For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).
Create a queue with three stacks, so that each queue operation requires a fixed (worst-case) number of stack operations. Caution: this game is quite challenging.
Java Algorithm Programming Question Implement the ADT queue by using a circular linked list. Recall that this list has only an external reference to its last note. Example Output: Create a queue: isEmpty () returns true Add to queue to get Joe Jess Jim Jill Jane Jerry isEmpty () returns false Testing getFront and dequeue: Joe is at the front of the queue. Joe is removed from the front of the queue. Jess is at the front of the queue. Jess is removed from the front of the queue. Jim is at the front of the queue. Jim is removed from the front of the queue. Jill is at the front of the queue. Jill is removed from the front of the queue. Jane is at the front of the queue. Jane is removed from the front of the queue. Jerry is at the front of the queue. Jerry is removed from the front of the queue. The queue should be empty: isEmpty() returns true Add to queue to get Joe Jess Jim Testing clear: isEmpty() returns true Add to queue to get Joe Jess Jim Joe is at the front of the queue. Joe is…
Use a stack to reverse the words of a sentence. Keep reading words until you have a word that ends in a period, adding them onto a stack. When you have a word with a period, pop the words off and print them. Stop when there are no more words in the input. For example, you should turn the inputMary had a little lamb. Its fleece was white as snow.intoLamb little a had mary. Snow as white was fleece its.Pay attention to capitalization and the placement of the period. This is what I have so far: import java.util.Scanner;import java.util.Stack; /** Class for reversing the order of a sentence.*/public class SentenceReverser{ /** Reverses the given sentence. @param sentence Sentence to be reversed. @return Reversed sentence. */ public static String reverse(String sentence) { String reversed = ""; Scanner scanner = new Scanner(sentence); Stack<String> stack = new Stack<String>(); // put your work below // ... return…
The puzzle includes various sizes of coins. It starts with an order of size, taking the top one the least. The puzzle needs to be constructed to have a conical shape and consider these laws: In every step, you can push one coin; every move includes taking the upper coin from the stack and putting it on top of other stack or starting a new stack. None of the coins can be put on top of the smaller coin; finally, at any moment, at most L, various stacks can be in use. Make PDDL in a way it will not rely on A and L.
Use stacks from the STL to implement a video game library functionality. In this implementation, consider a VideoGame class with title, release year, genre and publisher as variables. Provide setters and getters to these variables. In main, create a stack of video games. Add 5 different game objects into the stack. Then in a loop, for each item that you retrieve from the stack display the game information as follows: TITLEYEARGENREPUBLISHER