7. Suppose we have an integer-valued stack S and a queue Q. Draw the contents of both Sand Q at each step indicated by the line. Be sure to identify which end is the top of S andthe front of Q.Stack S;Queue Q;S.push(3);S.push(2);S.push(1);Qenqueue(3);Qenqueue(2);Qenqueue(1);int x = S.pop():Qenqueue(x);x = Qdequeue();benqueue(Q.dequeue();S.push(Q peek());I/ peek() function reads the front of a queue without deleting it 2. Consider the following stack of characters, where STACK maximum size is 8 memorycells. STACK: A, C, D, F, K,Describe the stack as the following operations take place:where "" denotes an empty memory cell.(c) PUSH (L)(a) POP( )(e) POP()(b) POP( )(f) PUSH (R) (8) PUSH (S)(d) PUSH (P)(h) POP( )3. Suppose STACK has 6 memory cells as its maximum size and initially its top= -1. Findthe output of the following pscudo code:1. a:= 2; b:= 5;2. push (a);3. push (b+2);4. push (9);5. while (top = -1)6. { pop ( item);7. print item; )4. Convert the following infix expression into postfix ones:i. (A + B) * (D/E)ii. (A+B^D)/(D-F) + Giii. A*(B+ D)/ E-F* (G + H/ K)5. Evaluate the postfix expression A BCD- *+, where A = 25, B = 2, C = 18 and D-13

As per the answering guidelines solving the first question completely. Q7. Queue follows FIFO…

Suppose we have an integer-valued stack S and a queue Q. Draw the contents of both S and Q at each step indicated by the line. Be sure to identify 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); Qenqueue(3): Qenqueue(2); Qenqueue(1); int x= S.pop(): Qenqueue(x); x=Q dequeue(); benqueue(Q.dequeue(); S.push(Q peek()): I/ peek() function reads the front of a queue without deleting it

Suppose we have an integer-valued stack S and a queue Q. Draw the contents of both S and Q at each step indicated by the line. Be sure to identify 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); Qenqueue(3): Qenqueue(2); Qenqueue(1); int x= S.pop(): Qenqueue(x); x=Q dequeue(); benqueue(Q.dequeue(); S.push(Q peek()): I/ peek() function reads the front of a queue without deleting it

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

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
Implement a stack S with two queues Q1 and Q2 so that the operations PUSH (S, X) and POP(S, Y), where S is presumably a stack and X is the element to be added to S and Y is the element removed from S, are handled by the queues that function as a stack as a whole. Assume that only queues are accessible to ADT's ENQUEUE, DEQUEUE, and EMPTYQUEUE operations.Show how your function operates on a list of items (a, b, and c) that will be used as a stack by the queues Q1 and Q2.
Implement a queue Q with two stacks S1 and S2, so that the stacks that operate together as a queue may perform the operations ENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q appears to be a queue and X is the element to be inserted into Q and Y is the element to be removed from Q. Assume that the ADT operations PUSH, POP, and EMPTYSTACK are only available for stacks.Show how your technique works on a list a, b, c, which will be utilised as a queue by the stacks S1 and S2.
Implement a queue Q using two stacks S1 and S2 such that operationsENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q is supposedly a queue and X isthe element to be inserted into Q and Y the element deleted from Q, are workedupon by the stacks that operate together as a queue. Assume that the ADT operationsof PUSH, POP and EMPTYSTACK are only available for the stacks.Demonstrate the working of your method on a list {a, b, c}, which is to beoperated upon as a queue by the stacks S1 and S2.
Implement a queue Q using two stacks S1 and S2 such that operationsENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q is supposedly a queue and X isthe element to be inserted into Q and Y the element deleted from Q, are workedupon by the stacks that operate together as a queue. Assume that the ADT operations of PUSH, POP and EMPTYSTACK are only available for the stacks. Demonstrate the working of your method on a list {a, b, c}, which is to beoperated upon as a queue by the stacks S1 and S2.
Implement a queue Q using two stacks S1 and S2 so that the operations ENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q is presumably a queue and X is the element to be added to Q and Y is the element deleted from Q, are handled by the stacks that function as a queue. Assume that only stacks are accessible to the ADT functions of PUSH, POP, and EMPTYSTACK. Show how your technique operates on the lists "a," "b," and "c," which the stacks S1 and S2 will use as a queue.
Implement a queue Q with two stacks S1 and S2 so that the stacks that work together as a queue may perform operations ENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q is apparently a queue and X is the element to be inserted into Q and Y is the element removed from Q. Assume that the PUSH, POP, and EMPTYSTACK ADT operations are only accessible for stacks.Demonstrate the operation of your method on a list a, b, c, which will be used as a queue by the stacks S1 and S2.
Implement a queue with three stacks so that, in the worst-case scenario, each queue operation requires a fixed number of stack operations. High level of difficulty alert.
Write a Queue implementation that uses a circular linked list, which is the sameas a linked list except that no links are null and the value of last.next is first whenever the list is not empty. Keep only one Node instance variable
Implement STAQUE, an abstract data type that combines a linked stack with a linked queue. Create methods that conduct insert and delete operations on a non-empty STAQUE, referred to as PUSHINS and POPDEL, respectively.POPDEL deletes entries from the top/front of the list, whereas PUSHINS inserts an element at the front or back of the STAQUE based on an indication supplied to the operation.
Suppose we begin with an empty stack, and perform the following operations: push(0), push(4), push(7), push(8), pop(), pop(), peek(), push(3), push(5), peek(), push(10), pop(), peek(), pop(), pop(), push(7), push(6), pop(), pop(), pop(), push(10). What is contained on the stack when we are done? Write out the contents from top to bottom.
Implement a stack with a single queue so that each stackoperations takes a linear number of queue operations. Hint : To delete an item, get allof the elements on the queue one at a time, and put them at the end, except for the lastone which you should delete and return. (