ExerciseWhat will be the content of queues Q1, Q2, and Stack S, after thefollowing code segment?while(!Q1.isEmpty()){x = Q1.Dequeue();if (x == 1)Stack S;Queue Q1, Q2;int x, y, z;z = 0;while(!S.isEmpty()){y = S.pop();z =z+ y;}Q1.Enqueue(9);Q1.Enqueue(6);Q1.Enqueue(9);Q1.Enqueue(1);Q1.Enqueue(7);Q1.Enqueue(5);Q1.Enqueue(1);Q2.Enqueue(z);Q1.Enqueue(2);Q1.Enqueue(8);ElseS.push(x);}Assume that you have a stack S, a queue Q, and the standard stack - queueoperations: push, pop, enqueue and dequeue. Assume that print is afunction that prints the value of its argument. Execute, in top-to-bottomorder, the operations below and answer the following questions.push(S, 'T');enqueue(Q, 'O');print(dequeue(Q));enqueue(Q, pop(S));push(S, dequeue(Q));print(pop(S));print(pop(S));enqueue(Q, 'l');push(S,dequeue(Q));enqueue(Q, 'l');enqueue(Q, 'G');print(dequeue(Q));enqueue(Q, T);push(S, 'l');push(S, dequeue(Q));print(pop(S));enqueue(Q, pop(S));push(S, 'O');print(pop(S)); ExerciseSuppose we have a stack S and a queue Q. What are final values in thestack S and in the Q after the following operations? Show contents ofboth S and Q at each step indicated by the line.Stack S;Queue Q;int x, y;S.push(10);S.push(20);S.push(S.pop()+S.pop();Q.enqueue(10);Q.enqueue(20);Q.enqueue(S.pop();S.push(Q.dequeue()+Q.dequeue());ExerciseSuppose we have an integer-valued stack S and a queue Q. Draw thecontents of both S and Q at each step indicated by the line. Be sure toidentify which end is the top of S and the front of Q.Stack S;Queue Q;S.push(3);S.push(2);S.push(1);Q.enqueue(3);Q.enqueue(2);Q.enqueue(1);int x = S.pop();Q.enqueue(x);x = Q.dequeue(();Q.enqueue(Q.dequeue());S.push(Q.peek());// peek() function reads the front of a queue without deleting it

Note: Answering the first question as per the guidelines. Given : Given the Stack S and Queue: Q1…

Exercise What will be the content of queues Q1, Q2, and Stack S, after the following code segment? while(!Q1.isEmpty()) { x = Q1.Dequeue(); if (x == 1) { Stack S; Queue Q1, Q2; int x, y, z; z = 0; Q1.Enqueue(9); Q1.Enqueue(6); Q1.Enqueue(9); while(!S.isEmpty()) { y = S.pop(); z =z+ y; } Q1.Enqueue(1); Q1.Enqueue(7); Q1.Enqueue(5); Q1.Enqueue(1); Q1.Enqueue(2); Q2.Enqueue(z); Q1.Enqueue(8); Else S.push(x); } Assume that you have a stack S, a queue Q, and the standard stack - queue operations: push, pop, enqueue and dequeue. Assume that print is a function that prints the value of its argument. Execute, in top-to-bottom order, the operations below and answer the following questions. push(S, 'T'); enqueue(Q, 'O'); print(dequeue(Q)); enqueue(Q, pop(S)); push(S, dequeue(Q)); print(pop(S)); print(pop(S)); enqueue(Q, 'I'); push(S,dequeue(Q)); enqueue(Q, 'I'); enqueue(Q, 'G'); print(dequeue(Q)); enqueue(Q, T); push(S, 'I'); push(S, dequeue(Q)); print(pop(S)); enqueue(Q, pop(S)); push(S, 'O'); print(pop(S));

Exercise What will be the content of queues Q1, Q2, and Stack S, after the following code segment? while(!Q1.isEmpty()) { x = Q1.Dequeue(); if (x == 1) { Stack S; Queue Q1, Q2; int x, y, z; z = 0; Q1.Enqueue(9); Q1.Enqueue(6); Q1.Enqueue(9); while(!S.isEmpty()) { y = S.pop(); z =z+ y; } Q1.Enqueue(1); Q1.Enqueue(7); Q1.Enqueue(5); Q1.Enqueue(1); Q1.Enqueue(2); Q2.Enqueue(z); Q1.Enqueue(8); Else S.push(x); } Assume that you have a stack S, a queue Q, and the standard stack - queue operations: push, pop, enqueue and dequeue. Assume that print is a function that prints the value of its argument. Execute, in top-to-bottom order, the operations below and answer the following questions. push(S, 'T'); enqueue(Q, 'O'); print(dequeue(Q)); enqueue(Q, pop(S)); push(S, dequeue(Q)); print(pop(S)); print(pop(S)); enqueue(Q, 'I'); push(S,dequeue(Q)); enqueue(Q, 'I'); enqueue(Q, 'G'); print(dequeue(Q)); enqueue(Q, T); push(S, 'I'); push(S, dequeue(Q)); print(pop(S)); enqueue(Q, pop(S)); push(S, 'O'); print(pop(S));

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Implement a double-ended queue. It is a variation where enqueues and dequeues are allowed on both ends. Implement the following double-ended queue operations using circular array representation with variables for the front and rear indices: a. new b. clear c. enqueueFront d. enqueueRear e. dequeueFront f. dequeueRear g. isEmpty h. isFull i. peek
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.
If the elements “A”, “B”, “C” and “D” are placed in a queue and are removed one at a time, in what order will they be removed?
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);
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).
Q2 Write the number of point and the letter of the correct answer: 1. The number of fields in the node of double linked list as circular is.............. A. 2 B. 3 C. 4 D. 5 2. Which the following can implement by stack? A. recursive problems B. reveres words C. both a and b D. None of the above 3. The infix expression for the postfix expression: ab+c/ is: A. a+b/c B. (a+b)/c C. a+(b/c) D. None of above 4. With queue data structure, The condition last=first indicates that A. queue is empty B. queue is full C. queue has only one element D. None of the above choose the correct answer (data structure in java) 2 10 (0.5X2 Page 1 of 4
Question 9: Draw internal representation of the queue q for each step of the following code: ArrayBoundedQueue<Integer> q = new ArrayBoundedQueue<Integer>(6); q.enqueue(37); q.enqueue(86); q.enqueue(54); q.enqueue(71); q.dequeue(); q.enqueue(97); q.dequeue();
We can declare a new array and copy the items of the old queue to new and by this, it will extend the size of the queue.
The following method is intended to pop an item from the top of an Integer stack that is implemented as a linked list. However, there is a problem with it. Explain the problem and write the code for the correct implementation. public Integer pop () { if (top != null) { top = top.next; return top.value; return null; }
Student should be able to develop the programs for queue using arrays and linked list Exercise 1: Implementation of Queue using Array or Linked list Real life situation. Design a simulation that can help to answer it. Customers at a grocery store want to check-out The grocery have 3 counter and the costumer must choose one of the counter Counter 1:3 people assembly Counter 2: 2 people assembly Counter 3: 3 people assembly The costumer should choose the fastest way to check out
13. If a stack is implemented under a Single- LinkedList, how much time does a stack pop an item out and maintain the top information? а. О(1) b. O(n) с. 0(n?) d. 0(log n)
Working with Queues 1. Create a method on the Queue class that calculates the number of times a given value occurs in the queue. int Queue::count( const T & data ) const; Example: count(…) function Result Queue count (5) 3 front->(1) (1) (5) (3) (5) (5) (2)<-back count (10) 0 front->(1) (1) (5) (3) (5) (5) (5) (2)<-back 2. Create a method on the Queue class that determines whether the queue is in descending order. bool Queue::isDecreasing( ) const; Example: isDecreasing() function Result Queue count (5) true front->(10) (9) (8) (7) (1)<-back count (10) false front->(1) (1) (5) (3) (5) (5) (5) (2)<-back 2