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 n 100 26 + log n logn)² +1 Ic ID Algorithm C O Algorithm E Algorithm A O Algorithm D O Algorithm B

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 n 100 26 + log n logn)² +1 Ic ID Algorithm C O Algorithm E Algorithm A O Algorithm D O Algorithm B

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

Two algorithms A, B sort the same problem. When you go through each algorithm and break them down into their primitive operations, each can be represented as below A = n4 + 100n2 + 10n + 50 B = 10n3 + 2n2 + nlogn + 200 For very large values of n which of these algorithms explain why B will run in the shortest time to solve the problem
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/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?
What does the above Algorithm computes? Is it a memorized algorithm? Justify your answer. Execute the given algorithm when n=4 and k=2.
Give an example of an algorithm that is O(1), an algorithm that is O(n) and an algorithm that is O(n2). Discuss the difference between them.
Consider the following recursive algorithm, where // denotes integer division: 3//2 = 1, 5//2 = 2, etc. F(n):if n <= 1: returnF(n//2)for i from 0 to n for j from 0 to n//2 print(i+j) Let function T(n) denote the running time of this algorithm. Derive T(n) and prove its worst case timecomplexity
For relatively small values of n, algorithms with larger orders can be more efficient than algorithms with smaller orders. Use a graphing calculator or computer to answer this question. For what values of n is an algorithm that requires n operations more efficient than an algorithm that requires [50 log2(n)] operations? (Assume n is an integer such that n > 1.) n?
Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamic programming-based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer. Draw the recursion tree for the algorithm where N = 7. Derive the complexity bound of the algorithm. Do not need to prove the complexity bound formally, just derive it by analyzing each component in your algorithm.
Write an efficient algorithm for the following problem, and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem: Tower of Hanoi with Every Tower having some Disks Input: Each of the three towers contains roughly n/3 disks. Tower A contains floor(n/3) largest disks. Tower C contains ceiling(n/3) smallest disks. Tower B contains the remaining disks. The disks at each tower are already sorted according to the typical Tower of Hanoi rule. Output: A set of moves that transfers all the n disks to C maintaining the Tower of Hanoi rule that after each move, the smaller disks at a tower will always be above the larger ones.
Suppose you have algorithms with the two running times listed below. Suppose you have a computer that can perform 6 operations per second, and you need to compute a result in at most an hour of computation. For each of the algorithms, what is the largest input size n for which you would be able toget the result within an hour for: a) n^3b)10n^2
Let A be an algorithm which has an execution time O (N5), where N is the size of the entry. Which of the following statements is NOT true about Algorithm A? Question 3 options: For any N, there may be entries for which the execution time is greater than N4 seconds. For any N, there may be entries for which the execution time is greater than N6 seconds. For any N, there may be entries for which the execution time is less than N4 seconds. For any N, there may be entries for which the execution time is less than N6 seconds. There are constants A and B such that for all N the execution time is less than A × N5 + B seconds.
Write an efficient algorithm (to the best of your knowledge) for the following problem, briefly describe why it is a correct algorithm, and analyze the time complexity. If you cannot find any polynomial-time algorithm, then give a backtracking algorithm. Problem: Repeated Number Input: An array A[1...3n] of positive integers. Output: If any number in the array appears at least n times, then print such a number. Otherwise, print 'none'. Example: Input: A = [1,3,3,3,1,1]. Here 3n = 6 and n =2. Output: 3. Note that here 1 would also be a valid output. You just need to print one if there are many options. Example: Input: A = [4,3,5,7,9,1]. Here 3n = 6 and n =2. Output: 'none'
You are given 3 algorithms A1, A2 and A3 solving the same problem. Youknow that in the the running times are T1(n) = n5n T2(n) = 210n2 + n3 T3(n) = 105log10(nn) For which problem sizes is A2 better than A1 ? Justify. For which problem sizes is A2 better than A3 ? Justify.