Consider two algorithms for the same problem: • Algorithm A, which runs in O(n) and produces a correct answer with probability 0.7, and a wrong answer with probability 0.3. • Algorithm B, which runs in O(n log n) and produces a correct answer with probability 0.99, and a wrong answer with probability 0.01. Which of the two algorithms should you use to build a more asymptotically (in n) efficient algorithm with probability 0.99 of producing a correct answer? Justify. Assume that you can always check if an answer is correct in constant time.

Consider two algorithms for the same problem: • Algorithm A, which runs in O(n) and produces a correct answer with probability 0.7, and a wrong answer with probability 0.3. • Algorithm B, which runs in O(n log n) and produces a correct answer with probability 0.99, and a wrong answer with probability 0.01. Which of the two algorithms should you use to build a more asymptotically (in n) efficient algorithm with probability 0.99 of producing a correct answer? Justify. Assume that you can always check if an answer is correct in constant time.

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

2. For a problem we have come up with three algorithms: A, B, and C. Running time of Algorithm A is O(n¹000), 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.
A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are T,(n) = 3 n logn and T2(n) = n6/5 a) Which algorithm is better? Why? b) If we run both algorithms at the same time with an input size of 105, which algorithm produces results faster than the other one? Why?
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
Al and Bob are arguing about their algorithms. Al claims his O(nlogn)-time method is always faster than Bob's O(n²)-time method. To settle the issue, they perform a set of experiments. To Al's dismay, they find that if n 100 is the O(nlogn)-time one better. Explain how this is possible.
For a given problem with inputs of size n, algorithms running time,one of the algorithm is o(n), one o(nlogn) and one o(n2). Some measured running times of these algorithm are given below: Identify which algorithm is which and explain the observed running Times which algorithm would you select for different value of n?
4 points Given an n-element array X of integers, Algorithm A executes an O(n3.4)-time computation for each even positive number in X, an Oin2.3-time computation for each odd positive number in X, and an O(n2.5)-time computation for each negative number in X. What are the best-case and worst-case running times of Algorithm A? Justify your answer. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac) BIUS Paragraph V Arial 10pt EVE 2 IXO QFS3E
2. Algorithm A has a running time described by the recurrence T(n) = 7T(n/2) + n². A competing algorithm B has a running time described by the recurrence T(n) = aT (n/4) + n². What is the largest integer value for a such that B is asymptotically faster than A? Explain your answer.
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.
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.
Suppose that you have five different algorithms (A. B. C. Dand E) for solving a problem. To solve a problem of size n, the number of operations used by each algorithm is as follows. As n grows, which algorithm uses the most operations? Algorithm number of operations n2+n3 B 2n+1 log n100 26 + log n6 nlogn)2 +1 Ainorithm
There are n different sizes of boxes, from 1 to n. There is an unlimited supply of boxes of each size t, each with a value vt . A box of size t can hold several smaller boxes of sizes a1, a2, . . . , ak as long as the sum of sizes a1 + a2 + . . . + ak is strictly less than t. Each of these boxes may be filled with yet more boxes, and so on. Design an algorithm which runs in O(n2 ) time and finds the maximum value that can be attained by taking one box, potentially with smaller boxes nested inside it.
A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are ?1(?) = 3 ? log ? and ?2(?) = ? 6/5a) Which algorithm is better? Why?b) If we run both algorithms at the same time with an input size of 105 which algorithm produces results faster than the other one? Why?