2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for thefollowing operations, where both QUEUES are implemented by an array of size, m=3. Here,Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your studentid+2, y=x+3, z=x+y and p=y+z.last two digits student idEnqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue()b) Draw a complete binary tree and then build the min-heap tree from the followingdata, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the datain descending order using the heapsort algorithm. last two digits student id = 8510 x 20 8 y zc) Two disjoint sets {y, p, z, x} and {r, t} are given, where maximum one of a set is therepresentative of that set. Determine UNION(Find(x), Find(t)). How can you check x and y arein the same set using Find operation? Here, x=last two digits of your student id+2, y=x+3,Z=x+y, p=y+z, r=x+2, t=900.last two digits student id = 85

As per company policy I am compelled to solve only the first question. Please post other questions…

2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the following operations, where both QUEUES are implemented by an array of size, m=3. Here, Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student id+2, y=x+3, z=x+y and p=y+z. last two digits student id = 85 Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue()

2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the following operations, where both QUEUES are implemented by an array of size, m=3. Here, Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student id+2, y=x+3, z=x+y and p=y+z. last two digits student id = 85 Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue()

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

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
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).
Combining sorted queues (2.2.14). Make a static function that takes two sorted queues as input and returns a new queue that was created by combining the two queues into a single sorted queue. 2.2.15 mergesort starting at the end of the line. Use the next technique to create a bottom-up mergesort: Given N items, make N queues, each containing one of the objects. From the N queues, create a queue. Re-insert the combined queue after performing Exercise 2.2.14's merging operation on the first two queues.Repeat this process until there is only one queue remaining.
2.2.14 Merging sorted queues. Develop a static method that takes two queues of sorteditems as arguments and returns a queue that results from merging the queues intosorted order.2.2.15 Bottom-up queue mergesort. Develop a bottom-up mergesort implementationbased on the following approach: Given N items, create N queues, each containing oneof the items. Create a queue of the N queues. Then repeatedly apply the merging operation of Exercise 2.2.14 to the first two queues and reinsert the merged queue at the end.Repeat until the queue of queues contains only one queue.
2.2.14 Combining sorted queues. Create a static function that accepts two sorted queues as parameters and returns a queue formed by merging the queues into sorted order. 2.2.15 Mergesort from the bottom of the queue. Create a bottom-up mergesort implementation using the following method: Create N queues, each containing one of the things, given N items. Make a queue out of the N queues. Then, repeat Exercise 2.2.14's merging process on the first two queues, and finally, reinsert the combined queue.Repeat until there is just one queue in the queue of queues.
(JAVA)Almost a priority queue. Design a data structure that supports the followingoperations for almost a priority queue:(i) FindSecondSmallest() which returns the second smallest item in the data structure.(ii) Insert(x) which inserts item x to the data structure.(iii) DeleteSecondSmallest() which removes the second smallest item from the datastructure.Your data structure should implement the operation FindSecondSmallest() in O(1), andthe other two operations in O(log n), where n is the number of elements in the datastructure.Problem 4: Binomial heaps. Let H1 and H2 be two binomial heaps. We would like tomerge H1 and H2 to obtain the binomial heap H and also to find the minimum key in H.A standard approach would be to perform the following sequence of operationsH = Merge(H1, H2);m = Min(H).Alternatively, we may perform the following sequence of operationsm1 = Min(H1);m2 = Min(H2);m = min{m1, m2};H = Merge(H1, H2).
Project 4: Maze Solver (JAVA) The purpose of this assignment is to assess your ability to: Implement stack and queue abstract data types in JAVA Utilize stack and queue structures in a computational problem. For this question, implement a stack and a queue data structure. After testing the class, complete the depth-first search method (provided). The method should indicate whether or not a path was found, and, in the case that a path is found, output the sequence of coordinates from start to end. The following code and related files are provided. Carefully ready the code and documentation before beginning. A MazeCell class that models a cell in the maze. Each MazeCell object contains data for the row and column position of the cell, the next direction to check, and a bool variable that indicates whether or not the cell has already been visited. A Source file that creates the maze and calls your depth-first search method. An input file, maze.in, that may be used for testing. You…
Question 1:Prepare a menu driven C program for inserting and deletion operation for a queue structureof employee information “struct student“ and the structure of a queue “struct queue”.a. Create a Circular queue using tenStudent array (copy from array into the queuewill be done).b. Using the circular queue which is populated at step 1, create two new circularqueues, one for Male and one for Female employees. These new queues will becreated during the deletion of the circular queue and use gender fields fordetermining Male(M) and Female(F) queues.c. End of operation
Please implement the following problem in C++: Although a queue is "best" implemented with a list, it can be implemented with a vector if you take into account the starting position of the queue. For example, if five elements are pushed onto the queue, the start of the queue is at position zero and the end is at position 4. If we, then, pop two elements, the start would be at position 2 and the end at position 4. The two "popped" elements are not really removed from the vector, and that avoids the O(N) time problem for the pop function.Implement a class which uses a vector to store the queue. Be mindful of performance, such that if the queue is empty, the size of the underlying vector is "reset."
2.2.14 Sorted queues being combined. Create a static function that receives two queues of sorted items as inputs and returns a queue formed by combining the two queues into a single sorted order queue. 2.2.15 Bottom-up mergesort of a queue. Create an implementation of the bottom-up mergesort using the following strategy: Make N queues, each holding one of the N things, given N items. assemble the N queues into a queue. Apply Exercise 2.2.14's merging process to the first two queues several times, and at the conclusion, reinsert the combined queue.Continue until there is just one queue left in the queue of queues.
(a) In implementing a Queue using an array, a problem might arise if the Queueis implemented in such a way that items in the Queue are inserted at thenext available location and removed from the next leading position, butsuch that, once deleted, the emptied space is unused. The problem thatarises is one where there is free space still in the array, but it is not usablebecause it is not at the end.Demonstrate this problem with a Queue that is stored in an array of size 5for the following instructions. Next, explain how you might resolve thisproblem.Queue q = new Queue(5); // assume the Queue constructor takes 5 asthe size of the arrayq.enqueue(3);q.enqueue(4);q.enqueue(1);q.dequeue( );q.dequeue( );q.enqueue(6);q.enqueue(5);q.dequeue( ); // at this point,// there are only 2 item2 in the queueq.enqueue(7); // this enqueue cannot occur, why??
(2) Answer the following questions concerning lists, stacks, and queues: Please be thorough with explanation! (b) Now consider implementing a stack as a class that relies on a vector, keeping track of the current size and capacity of the vector in the main object. You consider two possibilities. The first is to push (insert) to the beginning and pop (remove) from the beginning of the vector. The second is to push to the end and pop from the end of the vector. (Either way, if the vector is full and a push is applied, the vector will be resized to double its current capacity.) Is one of these possibilities better than the other? Briefly explain your answer.