Question #24 comparisons in any merge sort of 2k elements is at mostk2* – 2k+1. Give a specific example of a list of length 2*,that reverses a sequence; that is, upon input of aị, a2,23. [BB] To output the distinct items of a given list a1, a2.d how long it takes to drive between any two delivery points.Problem, will be encounterad again, Here,o minimize total traveling time? This prob-very points. She knows how long it takes to drive from the bak-- a2,and- 2k + 1 comparisons are requiredwhere precisely k2*..., an, the following method is proposed. For esearch the elements preceding az and, ifoutput a. Show that this algorithm can bewith O(log n!) comparisons.i re-is not found,accomplishedaklistsor-- 1algorithm24. Modify the Bubble Sort Algorithm to find ancars..., an, the algorithm outputs the sequence an, an-1,a2, a1. How many swaps are required? Give a Big Ohestimate of complexity.susor-hmffi-rch25. [BB] It is suggested that one way of searching for a num-ber x in a given unordered list is first to sort the list usinga merge sort and then to use a binary search algorithm. Isthis more or less efficient than a linear search?prered26. Given a list a1, a2, . , an, each item of which is 0 or 1, itis desired to put the list into increasing order. Would youuse one of the sorting methods discussed in this section,or is there a better method? Explain.purorofutations and Combinationslistseluxe Bakery has to deliver bread to many supermarkets scal-arge metropolitan area. She has a map showing the precisethative

Bubble sort is the sorting algorithm that arranges the elements in either ascending order (from…

24. Modify the Bubble Sort Algorithm to find an algorithm that reverses a sequence; that is, upon input of a o ..., an, the algorithm outputs the sequence an, an-1,. a2, a1. How many swaps are required? Give a Big Ob estimate of complexity.

24. Modify the Bubble Sort Algorithm to find an algorithm that reverses a sequence; that is, upon input of a o ..., an, the algorithm outputs the sequence an, an-1,. a2, a1. How many swaps are required? Give a Big Ob estimate of complexity.

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

The off-line minimum problem maintains a dynamic set T of elements from the domain {1, 2,...,n}under the operations INSERT and EXTRACT-MIN. A sequence S of n INSERT and m EXTRACT-MIN calls are given, where each key in {1, 2,...,n} is inserted exactly once. Let a sequence S berepresented by I1 , E, I2, E, ... , E, Im+1 , where each Ij stands for a subsequence (possibly empty) ofINSERT and each E stands for a single EXTRACT-MIN. Let Kj be the set of keys initially obtainedfrom insertions in Ij. The algorithm to build an array extracted[1..m], where for i = 1, 2, ..., m,extracted[i] is the key returned by the ith EXTRACT-MIN call is given below: Off-Line-Minimum(m, n)for i = 1 to n determine j such that i ∈ Kj if j ≠ m + 1 extracted[j] = i let L be the smallest value greater than j for which KL exists KL = KL U Kj, Kjreturn extracted (1) Given the operation sequence 9, 4, E, 6, 2, E, E, 5, 8, E, 1, 7, E, E, 3; where eachnumber stands for its insertion. Draw a…
The off-line minimum problem maintains a dynamic set T of elements from the domain {1, 2,...,n}under the operations INSERT and EXTRACT-MIN. A sequence S of n INSERT and m EXTRACT-MIN calls are given, where each key in {1, 2,...,n} is inserted exactly once. Let a sequence S berepresented by I1 , E, I2, E, ... , E, Im+1 , where each Ij stands for a subsequence (possibly empty) ofINSERT and each E stands for a single EXTRACT-MIN. Let Kj be the set of keys initially obtainedfrom insertions in Ij. The algorithm to build an array extracted[1..m], where for i = 1, 2, ..., m,extracted[i] is the key returned by the ith EXTRACT-MIN call is given below: Off-Line-Minimum(m, n)for i = 1 to n determine j such that i ∈ Kj if j ≠ m + 1 extracted[j] = i let L be the smallest value greater than j for which KL exists KL = KL U Kj, destoying Kjreturn extracted Given the operation sequence 9, 4, E, 6, 2, E, E, 5, 8, E, 1, 7, E, E, 3; where eachnumber stands for its insertion.…
The off-line minimum problem maintains a dynamic set T of elements from the domain {1, 2,...,n}under the operations INSERT and EXTRACT-MIN. A sequence S of n INSERT and m EXTRACT-MIN calls are given, where each key in {1, 2,...,n} is inserted exactly once. Let a sequence S berepresented by I1 , E, I2, E, ... , E, Im+1 , where each Ij stands for a subsequence (possibly empty) ofINSERT and each E stands for a single EXTRACT-MIN. Let Kj be the set of keys initially obtainedfrom insertions in Ij. The algorithm to build an array extracted[1..m], where for i = 1, 2, ..., m,extracted[i] is the key returned by the ith EXTRACT-MIN call is given below: Off-Line-Minimum(m, n)for i = 1 to n determine j such that i ∈ ?? if j ≠ m + 1 extracted[j] = i let L be the smallest value greater than j for which KL exists KL = KL U Kj, destroying ????return extracted (1) Given the operation sequence 9, 4, E, 6, 2, E, E, 5, 8, E, 1, 7, E, E, 3; where eachnumber stands for its…
The off-line minimum problem maintains a dynamic set T of elements from the domain {1, 2,...,n}under the operations INSERT and EXTRACT-MIN. A sequence S of n INSERT and m EXTRACT-MIN calls are given, where each key in {1, 2,...,n} is inserted exactly once. Let a sequence S berepresented by I1 , E, I2, E, ... , E, Im+1 , where each Ij stands for a subsequence (possibly empty) ofINSERT and each E stands for a single EXTRACT-MIN. Let Kj be the set of keys initially obtainedfrom insertions in Ij. The algorithm to build an array extracted[1..m], where for i = 1, 2, ..., m,extracted[i] is the key returned by the ith EXTRACT-MIN call is given below: Off-Line-Minimum(m, n)for i = 1 to n determine j such that i ∈ Kj if j ≠ m + 1 extracted[j] = i let L be the smallest value greater than j for which KL exists KL = KL U Kj, destoying Kjreturn extracted Given the operation sequence 9, 4, E, 6, 2, E, E, 5, 8, E, 1, 7, E, E, 3; where eachnumber stands for its insertion.…
Professor JAson uses the following algorithm for merging k sorted lists, each having n/k elements. He takes the first list and merges it with the second list using a linear-time algorithm for merging two sorted lists, such as the merging algorithm used in mergesort. Then, he merges the resulting list of 2n/k elements with the third list, merges the list of 3n/k elements that results with the fourth list, and so forth, until he ends up with a single sorted list of all n elements. Analyze the worst-case running time of the professor’s algorithm in terms of n and k.
In the sequence alignment problem, suppose you knew that the input strings were relatively similar, in the sense that there is an optimal alignment that uses at most k gaps, where k is much smaller than the lengths m and n of the strings. Show how to compute the NW score in O((m+n)k) time.
Consider the LCS problem discussed in class. Suppose we only want to compute the length of the LCS of x[1..m] and y[1..n] (i.e. we do not care about the actual subsequence itself). This means we do not need to “traceback” to find the LCS. In this setting, show how the algorithm can be altered so that it only needs min(m,n) + O(1) space rather than m · n space (note that it must be min(m,n) and not O(min(m, n))).
Consider the following variation of mergesort:(a) If n ≤ 1, we are done.(b) Divide the n elements into b subarrays of n/b elements each.(c) Recursively call mergesort to sort each of the b subarrays.(d) Merge the b sorted subarrays.For example, the standard mergesort has b = 2, and merging takes Θ(n) comparisons.If b = 3, then we have a 3-way mergesort, and one can show that it takes Θ(n) comparisons to merge 3 sorted lists. In fact, one may show that merging b sorted lists (for any fixed b) can be done in Θ(n) comparisons.Now consider the following argument: if we set b = n, we recursively sort n subarrays of size 1, and then merge them into one list with Θ(n) comparisons. Thus, the complexitycan be expressed by:T(1) = 0T(n) = nT(1) + Θ(n) = Θ(n)Therefore, this variation of mergesort sorts an array in Θ(n) comparisons.What is wrong with this argument? Hint: think about how to implement this variation.
Consider the sequential insertion of the elements 5, 8, 7, 17, 2, 6, 11, 13 into an empty skip list using the following sequence of random coin tosses where H denotes the outcome head and T denotes the outcome tail. TTHTTTTHTTHTTTTHTTHTTHTTTHTTTH What is the height of element 8 in the resulting skip list?
solution should have O(l1.length + l2.length) time complexity, since this is what you will be asked to accomplish in an interview. Given two singly linked lists sorted in non-decreasing order, your task is to merge them. In other words, return a singly linked list, also sorted in non-decreasing order, that contains the elements from both original lists.
Considering the cost of compares only, and assuming that it takes t compares to find the largest of t items, find the value of t that minimizes the coefficient of N lg N in the compare count when a t-ary heap is used in heapsort. First, assume a straightforward generalization of sink(); then, assume that Floyd’s method can save one compare in the inner loop.
Given and nxn matrix filled with either 0 or 1 your task is to turn as few 0 as possible into 1 such that every index meets the requirement that its neighbour (i+1,i-1,j+1,j-1) sum is even. return minimum no of zero you need to convert into 1, return -1 if no soltuion possible constraints : 1<=tc<=10 1<=n<=10 input: tc = 2 n = 3 1 1 1 1 1 1 0 0 0 n = 3 0 0 0 1 0 0 0 0 0 output : for first tc : -1 for second : 3