case 2: Consider the following statements: (4, 10) if (!stack.isEmptyStack()) linkedStackType stack; linkedQueueType queue; int num; cout « stack.top () << " "; stack.pop (); else if (!queue.isEmptyQueue ()) Suppose the input is: cout « queue.front () <« " "; queue.deleteQueue () ; 48 35 72 88 92 11 10 15 44 52 67 36 Show what is written by the following segment of code: else stack.push(0); queue.addQueue (0); cin >> num; cout « "Stack and queue are empty." << endl; break; } //end switch while (cin) cin >> num; } //end while switch (num % 3) cout « endl; cout « "stack: "; while (!stack.isEmptyStack ()) case 0: stack.push (num); break; case 1: queue.addQueue (num); break; cout « stack.top () « " "; stack.pop (); cout « endl; cout « "queue: "; while (!queue.isEmptyQueue ()) cout « queue.front () <« " "; queue.deleteQueue () ; cout « endl; 48 72 0 15 stack: 36 queue: 0 88 10 52 67 48 73 0 15 stack: 37 queue: 0 88 10 52 67 O 48 74 0 15 stack: 38 queue: 0 88 10 52 67 48 75 0 15 stack: 39 queue: 0 88 10 52 67

case 2: Consider the following statements: (4, 10) if (!stack.isEmptyStack()) linkedStackType stack; linkedQueueType queue; int num; cout « stack.top () << " "; stack.pop (); else if (!queue.isEmptyQueue ()) Suppose the input is: cout « queue.front () <« " "; queue.deleteQueue () ; 48 35 72 88 92 11 10 15 44 52 67 36 Show what is written by the following segment of code: else stack.push(0); queue.addQueue (0); cin >> num; cout « "Stack and queue are empty." << endl; break; } //end switch while (cin) cin >> num; } //end while switch (num % 3) cout « endl; cout « "stack: "; while (!stack.isEmptyStack ()) case 0: stack.push (num); break; case 1: queue.addQueue (num); break; cout « stack.top () « " "; stack.pop (); cout « endl; cout « "queue: "; while (!queue.isEmptyQueue ()) cout « queue.front () <« " "; queue.deleteQueue () ; cout « endl; 48 72 0 15 stack: 36 queue: 0 88 10 52 67 48 73 0 15 stack: 37 queue: 0 88 10 52 67 O 48 74 0 15 stack: 38 queue: 0 88 10 52 67 48 75 0 15 stack: 39 queue: 0 88 10 52 67

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

A SpecialStackTM is a stack modified to support the following two operations: PUSHCLEAR(v) successively pops consecutive items from the top of the stack that are less than u, then pushes v onto the stack. POP() deletes the item at the top of the stack. Assume these operations are implemented using a singly-linked list. PUSHCLEAR(v) iter- ates through the linked list to pop the applicable items and then adds v to the beginning. POP() deletes the first item. (a) Describe the ordering of values on the stack. (b) Explain how a single call to PUSHCLEAR(V) could take (n) time. (c) If we assume that every operation takes linear time, we get a naive bound of O(n²) on the total runtime. But this doesn't consider the fact that these expensive operations happen infrequently so let's analyze it more closely. Show that any sequence of n operations takes O(n) time. -
If given program is executed, what will be output? Create Stack<Integer>Queue<Integer> queue = new LinkedList<Integer>;Create LinkedList<Integer> ll;int[] array = { 82, 99, 37, 20, 54 };for (i = 0; i < array.length; i++) {int x = array[i];if (i % 2 == 0)addLast (x) in ll;elsepush(x) on stack;}while (“stack is not empty” || “linked list is not empty”) {if (stack is not empty)queue.enqueue(stack.pop());if (“linked list is not empty”)queue.enqueue(ll.removeLast());if “queue is not empty”)print("I am " + queue.getFront();}
Given: typedef struct point2d {double x;double y;}Point2D; typedef struct pt2link { Point2D* payload; Struct pt2link* next; } PtLink, *pPtLink Writting C code to: a. Create a stack ADT module to manage Point2D data. The module should handle stack creation, push, pop, peek, reporting the stack contents and stack destruct b. Create a queue ADT module to manage Point2D data. The module should handle queue creation, enqueuing, dequeuing, peek (look at the next value to be dequeued), reporting the queue contents and queue destruct
TRUE or FALSE? Answer the following question and state the reason why: In a dynamic stack, the node that was popped is deleted. In a dynamic stack, the pointer top stays at the head after push operation. STL function top returns a reference to element at the top of the stack. STL empty function will yield a value of true if the stack has elements.
Suppose the following operations are performed on an empty queue:enqueue(5);enqueue(?);dequeue();enqueue(9);enqueue ( 12);dequeue();enqueue(10);Insert numbers in the following diagram to show what will be stored in the staticqueue after the operations have executed .front rear
Design a stack MAXSTACK, which functions like an ordinary linked stacksupporting the ADT operations of PUSH, POP and EMPTYSTACK, besidesGETMAX. GETMAX is an operation that records the maximum element in thestack. Can you design the stack in such a way that GETMAX merely consumes O(1) time complexity
To turn a linked stack into a linked queue, create a process.
Consider the following statements: stackType<int> stack; int x; Suppose that the input is: 14 53 34 32 13 5 -999 Show what is output by the following segment of code: cin >> x; while (x != -999) { if (x % 2 == 0) { if (!stack.isFullStack()) stack.push(x); } else cout << "x = " << x << endl; cin >> x; } cout << "Stack Elements: "; while (!stack.isEmptyStack()) { cout << " " << stack.top(); stack.pop(); } cout << endl;
It is known that the sequence of the output of a string of integers is from left to right, respectively: 35, 78, 42, 59, 11, 93, 27, 66, 85, and it is known that the current results of the Linked Stack are as shown in the attached figure, it is possible What is the correct sequence of Stack operations (push and pop)? (multiple choice questions)
Create an implementation of each LinkedList, Queue Stack interface provided For each implementation create a tester to verify the implementation of thatdata structure performs as expected Your task is to: Implement the provided Stack interface ( fill out the implementation shell) Put your implementation through its paces by exercising each of the methods in a test harness. Add to your ‘StagBusClient’ the following functionality using your Stack - Create (push) 6 riders by name Iterate over the stack, print all riders Peek at the stack / print the result Remove (pop) the top of the stack Iterate over the stack, print all riders Peek at the stack / print the result Add two more riders to the stack Peek at the stack & print the result Remove all riders from the stack Verify the stack is now empty ( print that result ) Implementation of the provided interfaces Functioning test harness. Each of these will have a main() & a series of method calls helping you vet if your…
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 addition to the index value of the top (stack) or the front and the rear (queue) Stack S; Queue Q; int a=3, b=7
Given a stack, switch_pairs function takes a stack as a parameter and thatswitches successive pairs of numbers starting at the bottom of the stack.For example, if the stack initially stores these values:bottom [3, 8, 17, 9, 1, 10] topYour function should switch the first pair (3, 8),the second pair (17, 9), ...:bottom [8, 3, 9, 17, 10, 1] topif there are an odd number of values in the stack, the value at the top of thestack is not moved: For example:bottom [3, 8, 17, 9, 1] topIt would again switch pairs of values, but the value at thetop of the stack (1)would not be movedbottom [8, 3, 9, 17, 1] topNote: There are 2 solutions:first_switch_pairs: it uses a single stack as auxiliary storagesecond_switch_pairs: it uses a single queue as auxiliary storage""".