Let M(m,n) denote the number of comparisons required to merge two sorted lists of sizes m and n. a) Derive an "information theoretic" lower bound on M(m,n). b) Find an interesting relation between M(m,n) and the analogous function S defined for sorting. Use this relation to derive a lower bound for M(m,n) in terms of S. (Hint: Start with an upper bound on S(m+n).

Let M(m,n) denote the number of comparisons required to merge two sorted lists of sizes m and n. a) Derive an "information theoretic" lower bound on M(m,n). b) Find an interesting relation between M(m,n) and the analogous function S defined for sorting. Use this relation to derive a lower bound for M(m,n) in terms of S. (Hint: Start with an upper bound on S(m+n).

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

solve this using master theorem plz
I need help question
3.
Nine elements 1, 2, ..., 9, initially in different sets. Show the result of the following sequence of operations: union (1, 2), union (3, 4), union (3, 5), union (1, 3), union (6, 7), union (8, 9), union (6, 8) and (3, 6) when the unions are performed by size. If the sizes of two sets are equal, make the smaller ID as the root of the new set. b) For the tree created in part a, show the result of the find(9) with path compression.
Provide a tight theoretical lower bound for the problems given below. Provide justification for your answer. a) Given a list of sizencontaining Trues and Falses, determine whether True or False is more common (or if there is a tie). b) Given a list ofnnumbers, all assumed to be integers between 1 and 100 , sort them. c) Given ann×narray whose rows are sorted (but whose columns may not be), find the largest overall entry in the array. For example, the array could look like: \[ \left(\begin{array}{ccccccccc} -2 & 4 & 7 & 8 & 10 & 12 & 20 & 21 & 50 \\ -30 & -20 & -10 & 0 & 1 & 2 & 3 & 21 & 23 \\ -10 & -2 & 0 & 2 & 4 & 6 & 30 & 31 & 35 \end{array}\right) \] This is ann×narray, withn=9(there are 3 rows and 9 columns). Each row is sorted, but the columns aren't. Please give proper explanation and typed answer only.
Question 4 Full explain this question and text typing work only thanks
28. please explain
Design algorithm for maximum sum problem using dynamic programming approach. For example, given the sequence 3, -5, 4, -3, 10, the output is 11 (4-3+10). Present your algorithm in pseudo code. Trace your algorithm and show how it works on a small example, show the step-by-step process and the final result. Analyze the time complexity of the algorithm using order notation.
3. Solve the recurrence relation for n = 1 T(n) = {2T (n/2) + log₂n; n >1
Recall the problem of finding the number of inversions. As in the text, we are given a sequence of n numbers a1, . . . , an, which we assume are all distinct, and we define an inversion to be a pair i < j such that ai > aj. We motivated the problem of counting inversions as a good measure of how different two orderings are. However, one might feel that this measure is too sensitive. Let’s call a pair a significant inversion if i < j and ai > 2aj. Give an O(n log n) algorithm to count the number of significant inversions between two orderings. EXPLAIN COMPLEXITY AND PROVE ITS CORRECTNESSS
Using the recursion tree method, show to work to derive the runtime for the following recurrence relation: Hint:The resulting runtime should should be O(n*n^(1/log3(4/3))) or O(n^4.8188). need the process how to reach the answer and that was the whole question Note: will like the correct and detailed answer. Thank you!
3. Answer each of the short questions: a) For 1000 sorted data, what will be the worst-case runtime if you use a Binary Search Algorithm? First, use the right formula and then compute. b) For the same problem as above, if you use the Binary Search Tree algorithm, how would the runtime be different as compared to the Binary Search Algorithm? Again use the correct formula and find it out. c) Given the following Binary search Tree: (The root is 50, it is not showing up correctly on the image below) 12 17 23 SU 54 72 76 (14) 67 You need to write down the pre-order and post-order data arrangements. d) Illustrate from the tree given in part (c) how would you delete the root, and what will be the new tree look like. Explain the algorithm for deleting the root.