Hello, can you please help me do exercise 3 (with subparts 1,2,3, and 4)?Thank you so much! Exercise 1:Consider two algorithms A and B that solve the same class of problems.The time complexity of A is 5000n. The time complexity for B is ceiling(1.1) or 1.17Find the time required to execute each for n=10, n=100, n= 1000, n=1000000Tabulate your results? which algorithm has better performance for n>1000Exercise 2:Find an upper bound and a lower bound for each of the function f(x).f(x)=x²+2x+1.1)2) f(x)= 3x²+2x² + x3) f(n)-(6n+4)(1+lg n)Exercise 3:Consider the algorithm below:1. ien;2. while (i z1) {3. x=x+14. i=i/2}Trace the algorithm, and fill the table that indicates the number of times x=x+1 for the followingvalues of nn81632i (range)(8,4,2,1)#times x=x+1 executed4Find a theta notation in terms of n for the number of times the statement x-x+1 is executed based ongeneralizing the results above for n=2". Note that if n=2", then k=log2 (n).

Before we delve into the solution, it's important to understand what we're dealing with. The…

Consider two algorithms A and B that solve the same class of problems. The time complexity of A is 5000n. The time complexity for B is ceiling(1.1") or 1.1"] Find the time required to execute each for n=10, n=100, n= 1000, n=1000000 Tabulate your results? which algorithm has better performance for n>1000 Exercise 2: Find an upper bound and a lower bound for each of the function f(x). 1) f(x)=x²+2x+1.

Consider two algorithms A and B that solve the same class of problems. The time complexity of A is 5000n. The time complexity for B is ceiling(1.1") or 1.1"] Find the time required to execute each for n=10, n=100, n= 1000, n=1000000 Tabulate your results? which algorithm has better performance for n>1000 Exercise 2: Find an upper bound and a lower bound for each of the function f(x). 1) f(x)=x²+2x+1.

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

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.
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
2) 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 T1(n) = 3 n logn and T2(n) = nº/5 . a) Which algorithm is better? Why? b) If we run both algorithms at the same time with an input size of 10°, which algorithm produces results faster than the other one? Why?
Q2. The following algorithm returns the product of two numbers, a and b. The parameters x and y are natural numbers. First, prove the correctness of the algorithm. Then, analyze the time complexity of the algorithm in the worst case scenario. function mult (a, b) if b = 0: return 0 else if b is odd: return (mult (2a, b/2 ) +a) else: return (mult (2a, b/2 ) )
Question 16 Choose the incorrect option from the following: An algorithm with O(n) time complexity consumes less time than an O(n log n) algorithm. O(1) time complexity is called as constant time. An algorithm with O(log n) time complexity consumes more time than an O(n) algorithm. A good algorithm must be space and time efficient
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
Problem 2 Write the recurrence for the runtime of the following algorithm and estimate its asymptotic complexity: Mystery2(int n) if (n == 1) return 1 1:=1 for i := 1 to n for j := 1 to i for k := 1 to j 1:= 1+1 Mystery2(n/4) Mystery2(n/4) Mystery2(n/4) return 1
Design an algorithm to read the bus rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm.
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.
The two different algorithms that perform the same complexity process are called B and C. The total number of operations (operations) performed with algorithm B is 64n. The total number of operations performed with the C algorithm is 16 n ^ 2. Here is my question: Determine the problem size n0 where B is better than C for n> n0 please.
You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms. You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below. A1: -2 A2: 11 A3: -4 A4: 13 A5: -5 A6: 2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20). The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below. A1: 1…
Consider array A of n numbers. We want to design a dynamic programming algorithm to find the maximum sum of consecutive numbers with at least one number. Clearly, if all numbers are positive, the maximum will be the sum of all the numbers. On the other hand, if all of them are negative, the maximum will be the largest negative number. The complexity of your dynamic programming algorithm must be O(n2). However, the running time of the most efficient algorithm is O(n). Design the most efficient algorithm you can and answer the following questions based on it. To get the full points you should design the O(n) algorithm. However, if you cannot do that, still answer the following questions based on your algorithm and you will get partial credit. Write the recursion that computes the optimal solution recursively based on the solu- (a) tion(s) to subproblem(s). Briefly explain how it computes the solution. Do not forget the base case(s) of your recursion.