Consider the following functions as time complexities of some algorithms. (a) First write the worst-case runtime of each algorithm in Big-O notation. (b) Then arrange functions from low to high (Consider their Big-O notations as you arrange them; as n grows, the function that grows slower should come sooner than the one that grows faster). (c) Arbitrary, select TWO of arrangements in part (b) and for each one of them justify why you have chosen such an ordering for the corresponding function. Provide formal proof. For example if fl<=f2<= f3<= f4<=f5 you may choose to formally justify why (1) fl<=f2 and why (2) f4<=f5. fl(n)=n°,

Consider the following functions as time complexities of some algorithms. (a) First write the worst-case runtime of each algorithm in Big-O notation. (b) Then arrange functions from low to high (Consider their Big-O notations as you arrange them; as n grows, the function that grows slower should come sooner than the one that grows faster). (c) Arbitrary, select TWO of arrangements in part (b) and for each one of them justify why you have chosen such an ordering for the corresponding function. Provide formal proof. For example if fl<=f2<= f3<= f4<=f5 you may choose to formally justify why (1) fl<=f2 and why (2) f4<=f5. fl(n)=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

The search algorithm developed will be used for users to search the catalog for all items matching the search keyword(s), and there are a total of 15000 items in the catalog. During development, three different algorithms were created. • Algorithm A runs in constant time, with a maximum runtime of 1.10 seconds and returns all matching results. ● Algorithm B runs in logarithmic time, with a maximum runtime of 0.3 seconds, and returns only the first result. ● Algorithm C runs in linear time, with a maximum runtime of 1.50 seconds and returns all matching results. Which algorithm would be the least suitable for the requirements stated? In your answer, justify your choice by explaining why you picked that algorithm, and why you did not pick the other two algorithms.OND OND OND DAD
Another recursive algorithm is applied to some data A = (a₁, ..., am) where m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer ≥ 1. The running time T is characterised using the following recurrence equations: T(1) = c when the size of A is 1 T(m) = 2T (2) + c otherwise Determine the running time complexity of this algorithm.
Let us assume that we have two algorithms A and B. Algorithm A has run time given by (10n)2 and algorithm B has run time given by (Sin2n + Cos2n +1)n where n is the input size. Also assume that both algorithms are run on the same computer. Find the smallest value of n for which the runtime of algorithm A is less than the run time of algorithm B.
In this programming assignment, you are expected to design an experimental study for thecomparison between Hoare’s partitioning and Lomuto’s partitioning in Quicksort algorithm.You must implement the recursive Quicksort algorithm using two partitioning algorithms inJava. You must design the experiments for the comparison of two algorithms both theoreticallyand empirically. You must write a detailed report including the pseudo-code of the algorithms,the time complexity of the algorithms, the experimental design, and your results. You canprovide some plots (scatter, line etc.) to illustrate your results.
Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for solving a problem of size n. Select the dominant term(s) having the steepest increase in n and specify the lowest Big-Oh complexity of each algorithm. For example, the dominant term in 0.1n + 10n4 is 10n4 and it is O(n4). Expression Dominant term(s) O(. . .) 5 + 0.001n3 + 0.025n 500n + 100n1.5 + 50n log10 n 0.3n + 5n1.5 + 2.5 · n1.75 n2 log2 n + n(log2 n)2 n log3 n + n log2 n 100n + 0.01n2 0.01n + 100n2 2n + n0.5 + 0.5n1.25 0.01n log2 n + n(log2 n)2 100n log3 n + n3 + 100n
You are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to each nut. Design an algorithm for this problem with Θ(n log n) average-case complexity (in terms of nut-bolt comparisons). Explain why your algorithm has Θ(n log n) average-case complexity. You may use any result without explicitly solving recurrence equations.
2. For a problem we have come up with three algorithms: A, B, and C. Running time of Algorithm A is O(n1000), Algorithm B runs in 0(2¹) and Algorithm C runs in O(n!). How do these algorithms compare in terms of speed, for large input? Explain why.
for i:=1 to n for i:=1 to 2n a = 2-n+i-j next j next i a. Number of additions, subtractions, multiplications, divisions that must be performed when the algorithm segment is executed (ignore operations handled by control flow structures): b. Use the theorem on polynomial orders to find an order for the algorithm segment.
The Fibonacci function f is usually defined as follows. f (0) = 0; f(1) = 1; for every n e N>1, f (n) = f(n – 1) + f(n – 2). Here we need to give both the values f(0) and f(1) in the first part of the definition, and for each larger n, f(n) is defined using both f(n - 1) and f(n- 2). Use induction to show that for every neN, f(n) 1; checking the case n = 1 separately is comparable to performing a second basis step.)
You are given a collection of n bolts of different widths and n corresponding nuts. You are allowed to try a nut and bolt together, from which you can determine whether the nut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However, there is no way to compare two nuts together or two bolts together. The problem is to match each bolt to each nut. Design an algorithm for this problem with Θ(n log n) average-case complexity (in terms of nut-bolt comparisons). Explain why your algorithm has Θ(n log n) average case complexity.
A problem called S reduces to a problem called T if a T solver can be used as a subroutine to solve S. In pseudocode: Solves(...): ... SolveT(...) ... Assuming that this reduction is correct, answer the following questions regarding what the reduction tells us. If we know that an algorithm exists for solving Problem S, what does that tell us about Problem T? [ Select ] If we know that an algorithm cannot exist for solving Problem S, what does that tell us about Problem T? [Select ] [ Select ] An algorithm cannot exist for solving Problem TT. what does that tell us about Problem S? If we know An algorithm exists for solving Problem T Nothing [ Select] If we know that an algorithm cannot exist for solving Problem T, what does that tell us about Problem S? [ Select ]
A problem called S reduces to a problem called T if a T solver can be used as a subroutine to solve S. In pseudocode: Solves(...): ... SolveT(...) ... Assuming that this reduction is correct, answer the following questions regarding what the reduction tells us. If we know that an algorithm exists for solving Problem S, what does that tell us about Problem T? [ Select] If we know that an algorithm cannot exist for solving Problem S, what does that tell us about Problem T? [ Select] If we know that an algorithm exists for solving Problem T, what does that tell us about Problem S? [ Select ] [ Select ] An algorithm cannot exist for solving Problem S,r solving Problem T, what does that tell us about Nothing An algorithm exists for solving Problem S