Given a min-priority queue A[1..7] = <2, 4, 3, 5, 7, 8, 6>, consider calling Heap-Decrease-Key(A, 5, 1). Note that index starts from 1.HEAP-DECREASE-KEY(A, i, k)1 if k > A[i]2error "new key is greater than current key"3 A[i] = k4 while i>1 and A[PARENT(i)] > A[i]56swap A[i] with A[PARENT(i)]i = PARENT(i)What will be the resulting min-priority queue A?1, 2, 3, 5, 4, 8, 61, 2, 3, 4, 5, 6, 82, 4, 3, 5, 1, 8, 61, 2, 3, 4, 7, 8, 6

The Heap- Decrease-Key operation decreases the key value of an element at a given index i to a new…

Given a min-priority queue A[1..7] = <2, 4, 3, 5, 7, 8, 6>, consider calling Heap- Decrease-Key(A, 5, 1). Note that index starts from 1. HEAP-DECREASE-KEY(A, i, k) 1 if k>A[i] 2 3 A[i] = k 4 while i>1 and A[PARENT(i)] > A[i] 5 6 error "new key is greater than current key" swap A[i] with A[PARENT(i)] i = PARENT(i) What will be the resulting min-priority queue A? 1, 2, 3, 5, 4, 8, 6 1, 2, 3, 4, 5, 6, 8 2, 4, 3, 5, 1, 8, 6 1, 2, 3, 4, 7, 8, 6

Given a min-priority queue A[1..7] = <2, 4, 3, 5, 7, 8, 6>, consider calling Heap- Decrease-Key(A, 5, 1). Note that index starts from 1. HEAP-DECREASE-KEY(A, i, k) 1 if k>A[i] 2 3 A[i] = k 4 while i>1 and A[PARENT(i)] > A[i] 5 6 error "new key is greater than current key" swap A[i] with A[PARENT(i)] i = PARENT(i) What will be the resulting min-priority queue A? 1, 2, 3, 5, 4, 8, 6 1, 2, 3, 4, 5, 6, 8 2, 4, 3, 5, 1, 8, 6 1, 2, 3, 4, 7, 8, 6

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

Please assume that you have been given an implementation of a stack that supports both push and pop in O(1) time. With this information, you would like to implement a queue with these stacks. (a) In what way can you efficiently implement a queue using two of these stacks? “Efficiently” in this case means in a way which will allow you to do part B. (b) Please prove that the amortized cost of each dequeue and enqueue operation is O(1) for your stack-based queue by using the aggregate amortized analysis technique.
you are given ten(10) numbers 9,5,4,5,7,3,2,9,10,1 Store these elements in a stack ADT in the order shown (i.e. start with 9 and end with 1). Pop elements from this stack and store the elements in a binary search tree. Traverse the binary search tree above and store the elements in a priority queue. Remove the elements from the priority queue in (iii) and construct a directed graph G such that (x,y) is an edge as long as x>y whenever x and y are vertices of G. Traverse the graph in (iv) using depth first search(DFS)
Prove that building a minimum-oriented priority queue of size k then doing N k replace the minimum (insert followed by remove the minimum) operations leaves the k largest of the N items in the priority queue.
Write a function that converts a given min heap which is implemented by arravs to a max heap. The prototype of the function is queue "convert(queue "q).in c language
Suppose we have an ArrayHeap that uses the array representation from class (also called "tree representation 3B" in lecture). Recall that in this representation that the leftmost item is unused. Consider a heap with the following underlying array: | •| | 2|•| • | •| | -8 5 1 10 | 10 | 12 --- Suppose we are using our heap to represent a priority queue. If we call removeSmallest on the heap above, where will the 12 end up after removeSmallest has completed execution? Assume removeSmallest works as described in the lecture. By "completed execution", we mean the entire operation is done and the array again obeys our heap properties. O 12 will not move. O 12 will not be present in the heap. O In the root position previously occupied by a -8. O In a position previously occupied by a 5. O In a position previously occupied by a -2. O In a position previously occupied by a 9. O In a position previously occupied by a 8. O In a position previously occupied by a 0. O In a position previously…
Create a priority-queue implementation that makes use of a dway heap. Determine the optimal d value for various edge-weighted digraph models.
Consider the following linked list and write an algorithm/function to determine the node just before the tail node. [ A ] -> [ P ] -> [ R ] -> [ k ] -> NULL
30. In the implementation for a breadth-first search we studied, a queue was used. The code below replaces the queue with a stack. List the pre-order enumeration that the vertices in the graph below are visited using this modified method, starting from vertex 0. } 3 /** stack-based search */ static void modSearch (Graph G, int start) { Stack S new AStack (G.n()); S.push(start); } 6 G.setMark (start, VISITED); while (S.length) > 0) { } modSearch: intv S.pop(); PreVisit (G, v); for (int w = G.first (v); w < G.n(); w = G.next(v, w)) if (G.getMark (w) == UNVISITED) { G.setMark (w, VISITED); S.push(w);
Implement a queue using two stacks. Your solution should have a time complexity of O(1) for enqueue and dequeue operations.
Consider your ID as an array of 9 elements. Example ID: 201710340 arr 2. 1 1. 3 4 Consider a Linear Queue implemented using an array of length 6. Show the contents of the queue after executing each of the following segments of code in order. a. g.engueue (arr[0]): Aaenaueue (ar[1]); g.engueue (arr[2]): Aaenaueue (ar[3]); b. Audegueue (): Aadeaueue (L: c. Quenqueue (arr[4]): 9. engueue (arr[5]); d. What is the output of the following statements? System.out.println(a.size()); System.out.println(g.first)):
merge binomial min-queue A with heap B. A: 13 62 98 43 16 24 B: 29 84 67 19 15 44