the followings find the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: 1, log2 n, n, n log₂ n, n², n³,..., 2n, n!. 1. A binary search of n elements which are already in increasing order. 2. A linear search to find a number x in a list of n numbers. 3. An iterative algorithm to compute n!, (counting the number of multipli- cations) 4. An algorithm that prints all bit (binary digit) strings of length n. 5. A bubble sort algorithm to sort n numbers.

the followings find the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: 1, log2 n, n, n log₂ n, n², n³,..., 2n, n!. 1. A binary search of n elements which are already in increasing order. 2. A linear search to find a number x in a list of n numbers. 3. An iterative algorithm to compute n!, (counting the number of multipli- cations) 4. An algorithm that prints all bit (binary digit) strings of length n. 5. A bubble sort algorithm to sort n numbers.

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

please answer with proper explanation and step by step. don't give Direct answer. Question: If an algorithm takes n^2 operations, and the computer can perform 100 billion operations per second, what is a reasonable estimate of how long it will take to sort 2 billion elements (assuming there is ample memory, the computer doesn't crash, etc.)? a. 1 second b. 1 minute c. 1 hour d. 1 day e. 1 month f. 1 year g. 1 decade h. 1 century
1. a.An algorithm can be specified in various ways. Identify and explain four ways in which an algorithm can be specified. b. (b). 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 follows:A = 2n7 + 100n4 + 26n + 50 B = 7n4 + 22n2 + nlogn + 200For very large values of n, which of the algorithms A or B will runin the shortest time to solve the problem and why? (c). Two Computer Science students, Priscilla and Julius, are discussing how to compare two algorithms for solving a given problem. Priscilla suggests that they should use the execution times of the algorithms as criterion; but Julius insists that they should use the number of statements the algorithms execute as criterion. (i). Discuss the reasons why both criteria they are considering are not good for comparing algorithms.(ii). Recommend an ideal solution/criterion that they should rather use for comparing algorithms
Determine the big-O notation of the following algorithm: // A is an array with index from 0 to N-1Algorithm C(A, x, a, b); if (b<a) return a m = (b + a)/2 if (A[m] x) return C(A, x, a, m-1) else return C(A, x, m+ 1,b) Please answer max in 15-20 minutes thank u
Analyze another algorithm under Divide and Conquer. In your discussion, include the following: 1. Introduction about the algorithm. 2. The pseudocode 3. Explanation of its complexity
Euclid’s algorithm (or the Euclidean algorithm) is an algorithm that computes thegreatest common divisor, denoted by gcd, of two integers. Below are the original versions ofEuclid’s algorithm that uses repeated subtraction and another one that uses the remainder.int gcd_sub(int a, int b){ if (!a) return b; while (b) if (a > b) a = a – b; else b = b – a; return a;}int gcd_rem(int a, int b){ int t; while (b) { t = b; b = a % b; a = t; } return a;}1. Trace each of the above algorithm using specific values for a and b.2. Compare both algorithms.
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
Write a simple code (python). Given a list of n elments with each element between 1 and n. determine whether there are any duplicates. Then find the following: 1. What does the algorithms compute? 2. What is its basic operation? 3. How many times is the basic operation executed? 4. What is the efficiency class of the algorithm? Keep in mind it's an Analysis of Algorithms course.
The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers. Answer only 2 question
: The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers.
The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers. Answer 2 and 3 questions
The following questions are independent. 1. A palindrome is a string that reads the same forward and backward. Using our algorithmic language, propose an algorithm that determines whether a string of n characters is a palindrome. 2. Let x be a real number, and n be an integer. Devise an algorithm that computes xn. [Hint: First, give a procedure for computing xn when n is nonnegative by successive multiplication by x, starting with 1 until we reach n. Then, extend this procedure and use the fact that x–n = 1/xn to compute xn when n is negative.] 3. The median of a set of integers is the middle element in the list when these integers are listed in increasing order. The mean of a set of integers is the sum of integers divided by the number of integers in the set. Write an algorithm that produces the maximum, median, mean, and minimum of a set of three integers. Answer question 3 only with details
a) Consider a recursive function to return the Number of Binary Digits in the Binary Representation of a Positive Decimal Integer (n) using a recursive algorithm. int Process (int n) { if (n == 1) return 1; else return (Extra() + Process (n/4) + Process (n/4)); } Given that Extra(n) is a function of O(n)1) Find T(n) = number of arithmetic operations. 2) Calculate the complexity of this algorithm using Back Substitution.