3.Complete the following table that shows a series of stack operations and their effects on aninitially empty queue Q of character.MethodReturn Value First←Q←Lastenqueue(p)[p]enqueue(r)[p, r]size()2[p, r]first()Р[p, r]enqueue(o)[p, r, o]isEmpty()false[p, r, o]dequeue()Р[r, o]dequeue()size()dequeue()isEmpty()enqueue(g)enqueue (h)first()dequeue()size()first() 4.Refer to the given program. Draw a qPerson diagram to represent the following queueoperations, step-by-step as the program executes. Show the output, if any.public class MyQ1 [public static void main(String[] args) {QueueqPerson = new Queue ();qPerson.enqueue ("Mas");qPerson.enqueue ("Ali");System.out.println (qPerson);qPerson.dequeue ();qPerson.enqueue ("Ina");System.out.println (qPerson.dequeue ());qPerson.enqueue ("Azura");qPerson.enqueue ("Abu");String str = qPerson.dequeue ();qPerson.enqueue (str + "Ahmad");System.out.println (qPerson);System.out.println (qPerson.size());System.out.println(str qPerson.peek ());=

3) Comple the following table that shows the stack operation 4) Coding to define the enqueue and…

3. Complete the following table that shows a series of stack operations and their effects on initially empty queue Q of character. Method Return Value First Q←Last enqueue(p) [p] enqueue(r) [p. 1] size() 2 [p, r] first() P [p, r] enqueue(o) [p, r, o] isEmpty() false [p, r, o] dequeue() Р [r, o] dequeue() size() dequeue() isEmpty() enqueue(g) enqueue(h) first() dequeue() size() first()

3. Complete the following table that shows a series of stack operations and their effects on initially empty queue Q of character. Method Return Value First Q←Last enqueue(p) [p] enqueue(r) [p. 1] size() 2 [p, r] first() P [p, r] enqueue(o) [p, r, o] isEmpty() false [p, r, o] dequeue() Р [r, o] dequeue() size() dequeue() isEmpty() enqueue(g) enqueue(h) first() dequeue() size() first()

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

S and Q are integer stacks and priority queues, respectively. C mod 3 is the priority of an element C joining the priority queue Q. In other words, the elements' priority numbers are either 0 or 1 or 2. What is the output of the following code if A, B, and C are integer variables? However, the queue procedures have been modified to work on a priority queue. 1.A = 102.B = 113.C = A+B4.while (C < 110) do5. if (C mod 3) = 0 then PUSH (S,C)6. else ENQUEUE (Q,C)7. A = B8. B = C9. C = A + B10.end11.while not EMPTY_STACK (S) do12. POP (S,C)13. PRINT (C)14.end15.while not EMPTY_QUEUE (Q) do16. DEQUEUE (Q, C)17. PRINT (C)18.end
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
18 T OR F O(N) is the order of growth execution time of the isFull operation when using the ArrayBoundedQueue class, assuming a queue size of N.
7 T OR F In terms of operation efficiency, the constructor for a link-based queue performs in O(N), whereas the constructor for an array-based queue performs in O(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.
Consider the following code segment , The variable q is an object of type Queue, the variable s is an object of type Stack. peek method looks at the first element in the queue without removing it. the remove method removes the first element from the queue. add method adds an element to the and of the queue or add an element to the top of the stack. pop method removes an element from the top of the stack What would be the content of the variable q (8 numbers) after we complete the second while loop in the code for (int i = 30; i <= 40; i ++) { if(i % 3 == 0) q.add(i); } while (!q.isEmpty()) { s.add(q.peek()); s.add(q.peek()); q.remove(); } while (!s.isEmpty()) { q.add(s.pop()); }
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.
Imagine a stack of dishes, literally. The stack may collapse if it becomes too tall.Therefore, when the prior stack above a certain threshold in real life, we probably start a new stack. Create a data structure called SetOfStacks to resemble this. When a stack's capacity is reached, a new stack should be created and added to the SetOfStacks. SetOfStacks. SetOfStacks with push(). In other words, pop() should return the same values as it would if there were only one stack. It should operate exactly like a single stack.TAKE ACTIONCreate a function called popAt(int index) that does a pop operation on a certain substack.
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
The bounded-buffer solution in the below code uses a last-in-first-out strategy (LIFO).Change the code to implement a FIFO (First-in-First-out) strategy. You may use the (in,out) pointer method(using semaphores to test if the queue is full or empty shouldalleviate the problem of only using up N-1 locations) or implement a FIFO queue. Usethe correct counting semaphore implementation. C code below ******************************************************************************************************************************* #include <stdio.h>#include <stdlib.h>#include <pthread.h>#include <semaphore.h>#define SIZE 5#define NUMB_THREADS 6#define PRODUCER_LOOPS 2typedef int buffer_t;buffer_t buffer[SIZE];int buffer_index;pthread_mutex_t buffer_mutex;/* initially buffer will be empty. full_semwill be initialized to buffer SIZE, which meansSIZE number of producer threads can write to it.And empty_sem will be initialized to 0, so noconsumer can read from buffer until a…
Starting with an empty Circul Queue, what will be the state of Circular Queue, front, rare, size and number of elements after each of the following operations performed in the order ( i ) enque(A) (ii) enque (B) (iii) enque (C) (iv) dequeue( ) (v) dequeue( ) (vi) enque(D) (vii) enque(E ) (viii) dequeue( )
Short answer: Answer the following in your own words: 1) Your friend says they implemented a stack as a linked list with reference pointers to both a head and the tail node (i.e. they implemented a stack as a double endedlinked list). They said this significantly improved the performance for all functions (push, pop, search, and update). Are they correct? Why or why not?