Consider that you have a stack S and a queue Q. Draw S and Q after executing the following operations (Op). You have to indicate for each operation, the stack or the queue content in adi to the index value of the top (stack) or the front and the rear (queue) Stack S; Queue Q; int a=3, b=7 Opl: Qengueue(atk): • Op2: S.push(a-b); Op3: S.push(b); Op4: a=pop(); Op5: Qengueue(a); • Op6: S.push(Qdequeue(); • Op7: Qengueue(b); Op8: Qengueue(S.poRO + b); Op9 Qengueuc(Q.deaueue): On10: 0 eneg ueue(S non0):

Consider that you have a stack S and a queue Q. Draw S and Q after executing the following operations (Op). You have to indicate for each operation, the stack or the queue content in adi to the index value of the top (stack) or the front and the rear (queue) Stack S; Queue Q; int a=3, b=7 Opl: Qengueue(atk): • Op2: S.push(a-b); Op3: S.push(b); Op4: a=pop(); Op5: Qengueue(a); • Op6: S.push(Qdequeue(); • Op7: Qengueue(b); Op8: Qengueue(S.poRO + b); Op9 Qengueuc(Q.deaueue): On10: 0 eneg ueue(S non0):

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 21SA

See similar textbooks

Similar questions

There is one stacks and one queue q and then following operations are performed upon these two. Push A, enqueue B, push C, pop, pop, enqueue D, push E, dequeue, enqueue F .What is the total number of elements, which are left in the queue and stack in the end.
Answer it fast and correct. Don't stuck. i ll rate Fill in the underlines below to complete a function template, reverseStack, that takes as a parameter a stack object and uses a queue object to reverse the elements of the stack. C++ code Answer: template <class Type> void reverseStack(stackType<Type> &s) { linkedQueueType<Type> q; Type elem; while (_________________) // The stack is not empty. { // Copy the top element of the stack into the queue //and remove it from the stack. elem = _________________; _________________; _________________; } while (_________________) // The queue is not empty. { // Copy the front element of the queue into the stack //and remove it from the queue. elem = _________________; _________________; _________________; } }
Java Using Queues to make a Stack Suppose that you have two integer queues but no stack. Implement the basic stack operations (push, pop, and peek) using the queues. (Use the queue class for integers called Queue attached below.) Queue.java is below public class Queue {private int[] queueArray;private int front;private int back;private int size;final int DEFAULT_CAP = 5;/* no-arg constructor initializes a queue with a default capacity of 5, * i.e. the stack can take 5 elements at most,*/public Queue(){queueArray = new int[DEFAULT_CAP];front = 0;back = 0;size = 0;}/* constructor that initializes a stack with a specific capacity (given as parameter)* */public Queue(int cap){queueArray = new int[cap];front = 0;back = 0;size = 0;}/* adds a new element to the queue if it is not full* */public void enqueue (int item){if (!isFull()){queueArray[back] = item;back = (back+1) % queueArray.length;size++;} }/* removes the first element from a queue if it is not empty* */public int dequeue(){int…
There is a data structure called a drop-out stack that behaveslike a stack in every respect except that if the stack size is n,then when the n+1 element is pushed, the first element is lost.Implement a drop-out stack using links
Push, pop, and enqueue operations are supported by a data type known as a stack-ended queue (steque). Give this ADT an API description. Create an implementation based on linked lists.
TRUE or FALSE? Answer the following question and state the reason why: A circular linked list has 2 node pointers. cout<<list.back()<<endl; = The back member function returns a reference to the last element in the list. In a Dynamic Stack, the pointer top stays at the head after a push operation. During a Pop operation in Static Stack, the elements are being moved one step up. In a dynamic implementation of stack, the pointer top has an initial value of null.
What would be the contents of the initially empty queue Q1 and stack S1 (show the results from left to right where the left side represents the bottom in case of the stack and the rear in case of the queue) after the following code is executed : S1=Stack.Stack() Q1=Queue.Queue() aList=[59, 8, 30, 4, 9, 15, 16, 2, 31, 14, 18] for i in aList: if i==16 or i==9: S1.pop() Q1.dequeue() Q1.enqueue(i) elif i>14: S1.push(i) else: Q1.enqueue(i)
Please answer the following, #3. Write clearly please. If postfix math is easy to analyze with a stack, would prefix math like ”/ * + 2 2 8 4” (which equals 8) be easy to analyze with a queue? How would you attempt to analyze this math with a queue? Lay out assumptions and use those in your solution as well.
Implementing a Stack ADT using a linked solution. The implementations are linked Nodes. class Node: def __init__(self, data, node=None): # Initialize this node, insert data, and set the next node if any self.data = data self.chain = node class SubSetStack: def __init__(self, data=None): # Initialize this stack, and store data if it exists def push(self, data): # Add data to the beginning of the stack def pop(self): # Remove the element at the beginning of the stack. # Return the data in the element at the beginning of the stack, or None if the stack is empty def top(self): # Return the data in the element at the beginning but does not remove it. # Return None if stack is empty. def __len__(self): # Return the number of elements in the stack def subset_sum(target, sub_list): # Returns True if Target can be formed from sub_list repeated # some arbitrary number of times. In the above function a Node…
2. Given the following stack A = { 29,18,10,15,20,9,5,13,2,4,15} Create a queue by taking the elements from the top of the stack and adding them to a queue
A stack has five nodes; the data of the nodes is given below: [top ] 6 -- 1 -- 9 -- 5 -- 7 [bottom ] After a pop function call, the stack is as follows: [top ] 1 -- 9 -- 5 -- 7 [bottom] What will the stack look like after a node is removed and then a node with the value 21 is added?
c++ Program You are required to add two numbers of 5 digits each using Stack and Queue. You may follow thefollowing steps to solve this problem unless you can think of a better method!1. Separate the digits of each number and insert them into two separate queues starting from theirlast digits.2. Dequeue one number each from the two queues.3. Add them.4. Divide the sum by 10.5. Push the remainder into a Stack and the Quotient (i.e., carry) would be added to the sum ofnext two numbers.6. Repeat Steps 2 – 5 until both queues are empty.7. Pop all elements of the Stack one by one and push them onto a new Stack.8. Print the new Stack. It will be the sum of the two 10-digit numbers.