Given a stack s with data [1,2,3,4] (1 is the element at the top) and a queue q with data [5,6,7,8] we execute the following commands: q.enqueue(s.pop()); s.push(s.pop()); s.pop(); q.enqueue(q.dequeue()); s.push(q.dequeue()) a. What value would a call to s.pop() have now? b. What value would a call to d.dequeue() have now?

Given a stack s with data [1,2,3,4] (1 is the element at the top) and a queue q with data [5,6,7,8] we execute the following commands: q.enqueue(s.pop()); s.push(s.pop()); s.pop(); q.enqueue(q.dequeue()); s.push(q.dequeue()) a. What value would a call to s.pop() have now? b. What value would a call to d.dequeue() have now?

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

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 the queue.
Find the output of the following program code if the following values have been inserted into abcQ: 1 2 4 5
In a queue implementation using array of size 5, the array index starts with 0 where head and tail values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place. 0 5 1 2
Queue abcQ = new Queue (); Queue out = new Queue (); //statements to insert value 1, 2, 3, 4, 5 into abcQ for (int i = 0; i < 5; i++) { int a = Integer.parseInt (abcQ.dequeue ().tostring ()); int b = Integer.parseInt (abcQ.dequeue ().tostring ()); abcQ.enqueue (a); abcQ.enqueue (b); out.enqueue (a + b); for (int i = 0; i < 5; i++) System.out.print (abcQ.dequeue () + " "); System.out.println ("\n") ; for (int i = 0; i < 5; i++) System.out.print (out.dequeue () + " "); (- ks)
8. Assume you have a queue q that has already been populated with data. What does the following code fragment do to the queue q? Stack s = new Stack(); while (!q.isEmpty()) s.push(q.dequeue () ); while (!ss.isEmpty()) q.enqueue (s.pop());
Q7. Which values will be contained in the queue and the stack after the two while loops? Queue queue = new Queue (10); Stack stack = new Stack(25); for (int i = 1; i
For the Queue use the java interface Queue with the ArrayDeque classFor the Stack use the java Deque interface with the ArrayDeque classFor the LinkedList, use the java LinkedList class Also, when you are asked to create and use a Queue, you can use only those methods pertaining to the general operations of a queue (Enqueue: addLast, Dequeue: removeFirst, and peek() Similarly, when you are asked to create and/or use a stack, you can use only those methods pertaining to the general operations of a Stack (push: addFirst, pop:removeFirst, and peek() ) Your code should not only do the job, but also it should be done as efficiently as possible: fast and uses no additional memory if at all possible Questions Write a method “int GetSecondMax(int[] array)” . this method takes an array of integers and returns the second max value Example: if the array contains: 7, 2, 9, 5, 4, 15, 6, 1}. It should return the value: 9
Queue q= new LinkedQueue (8); q.enqueue ("A"); q.enqueue ("B"); q.enqueue ("C"); q.enqueue ("D"); q.enqueue ("E"); q.enqueue ("F"); Stack s= new LinkedStack (8); for (int i=0; i<3; i++) { s.push (q.de queue () ); After all of this code executes, the size of the queue g is -----and the size of the stack is ------ 1, 5 3, 3 4. 2 5, 1
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.
Assuming dequeue() and pop() print the values removed, what is printed by: queue q // queue of int q.enque(5) q.deque() // print q.enqueue(18) q.enque(2) q.deque() // print q.deque() // print stack s // stack of int s.push(3) s.pop() // print s.push(6) s.push(5) s.pop() // print s.pop() s.push(7) s.pop() // print ANSWER: ANSWER:
The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches. The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a stack. At each step: If the student at the front of the queue prefers the sandwich on the top of the stack, they will take it and leave the queue. Otherwise, they will leave it and go to the queue's end. This continues until none of the queue students want to take the top sandwich and are thus unable to eat. You are given two integer arrays students and sandwiches where sandwiches[i] is the type of the ith sandwich in the stack (i = 0 is the top of the stack) and students[j] is the preference of the jth student in the initial queue (j = 0 is the front of the queue). Return the number of students that are unable to eat. use the following code to complete:-…
void pop()// Pre: size() > 0.// Post: The highest priority item has been removed from the// p_queue. (If several items have the equal priority,// then the implementation may decide which one to remove.)// void p_queue::pop() { cerr << "pop() not implemented yet" << endl; }