void Dosomething ()The following routine making use of two{ int x.y,z;while(lemptyQ(Q1)queues : Q1,Q2 and one stack :S Initially thequeue Q1 contains 5, 6, 9, 0, 7, 5, 0, 2, 6, 0dequeue(QI, x):if(x equals 0)from front to rear. What are the contents ofqueue Q2 from front to rear after thez- 0;while(lemptystack(s))execution of following function.popstack(s.y):z t= y;enqueue(Q2, z);elsepushstack(s,x);

The Answer is in given below steps

void Dosomething () The following routine making use of two { int x.y,z; while(lemptyQ(QI) queues : Q1,Q2 and one stack :S Initially the queue Q1 contains 5, 6, 9, 0, 7, 5, 0, 2, 6, 0 dequeue(QI, x): iffx equals 0) from front to rear. What are the contents of queue Q2 from front to rear after the while(!emptystack(s)) execution of following function. popstack(s.y); z+- y: enqueue(Q2, 2); else pushstack(s,x);

void Dosomething () The following routine making use of two { int x.y,z; while(lemptyQ(QI) queues : Q1,Q2 and one stack :S Initially the queue Q1 contains 5, 6, 9, 0, 7, 5, 0, 2, 6, 0 dequeue(QI, x): iffx equals 0) from front to rear. What are the contents of queue Q2 from front to rear after the while(!emptystack(s)) execution of following function. popstack(s.y); z+- y: enqueue(Q2, 2); else pushstack(s,x);

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

Code with comments and output screenshot
Multiple choice in data structures void do(queue<int>&q){ stack<int>temp; while(!q.empty()){temp.push(q.front()); q.pop();} while(!temp.empty(){q.push(temp.top()); temp.pop();}} After this function the queue q is a. doesn't changed b. has rubbish data c. reversed d. destroyed (empty)
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.
Implement a function void reverseQueue(QueueSLL&) that reverses the elements of a parameter queue. The function uses a stack for the reverse.
Construct a circular queue of size 7 containing 4 elements (10, 4, 12, 20). Draw the structure of the queue after performing the following operations. a. Enqueue (34); Enqueue (14); b. Dequeue ( ); Dequeue ( ); Enqueue (17) c. Enqueue (56); Dequeue ( ); Enqueue(45)
Answer in 5 mins else downvote
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());
1. Assume you have a queue with operations: enqueue(), dequeue(), isEmpty(). How would you use the queue methods to simulate a stack, in particular, push() and pop() ? Hint: use two queues, one of which is the main one and one is temporary.
Project Overview: This project is for testing the use and understanding of stacks. In this assignment, you will be writing a program that reads in a stream of text and tests for mismatched delimiters. First, you will create a stack class that stores, in each node, a character (char), a line number (int) and a character count (int). This can either be based on a dynamic stack or a static stack from the book, modified according to these requirements. I suggest using a stack of structs that have the char, line number and character count as members, but you can do this separately if you wish.Second, your program should start reading in lines of text from the user. This reading in of lines of text (using getline) should only end when it receives the line “DONE”.While the text is being read, you will use this stack to test for matching “blocks”. That is, the text coming in will have the delimiters to bracket information into blocks, the braces {}, parentheses (), and brackets [ ]. A string…
There is a data structure called a drop-out stack that behaveslike a stack in every respect except that if the stack size is n,then when the n+1 element is pushed, the first element is lost.Implement a drop-out stack using links
Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use `cpp` as the syntax highlighter. - Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. - Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. - Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf - Two ways to enter math mode: - Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. - Insert a pair of double-dollar signs: \$\$ your equations go here \$\$, which produces a standalone equation/formula set. le for sub
Simple JAVA linkedlist code implementation please help and complete any part you can - Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§ List the stations§ Check if a station is in the list (print result)• Check for a station that exists, and onethat doesn’t§ Remove a station§ List the stations§ Add a station before another station§ List the stations§ Add a station after another station§ Print the…