Q1: Analyze the following Algorithms. Find their running time and asymptotic notations. Algorithm 1 int fun(int n) { int count = 0; for (int i = 0; i < n; i++) { for (int j = i; j> 0; j-) { count = count + 1; } return count;

Q1: Analyze the following Algorithms. Find their running time and asymptotic notations. Algorithm 1 int fun(int n) { int count = 0; for (int i = 0; i < n; i++) { for (int j = i; j> 0; j-) { count = count + 1; } return count;

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

Related questions

Q: The algorithm solves the problem of size n by dividing it into 64 sub- problems of size n/8,…

A: Solution - In the given question, we have to find the complexity of the given algorithm's…

Q: for i: = 1 to 4n S:= 0 for j:= 1 to i - 1 s:= s+j• (i - j+ 1) next j r:= s? next i (a) What is the…

A: LINE 1 - for i := 1 to 2nLINE 2 - s := 0LINE 3 - for j := 1 to…

Q: int foo1(int n) { int i, sum = 0; if (n==1) { return 1; } for(i=1; i<=n; i*=3) { sum += i; %3D }

A: Big Oh notations explains the worst-case running time of an algorithm,in simple words. It is the…

Q: 2. Consider the pseudocode below. Algorithm Total(n) total = 1 for i = 1 to n j = 0 while j…

A: As per our company guidelines, we are supposed to answer only one question at a time. Kindly, post…

Q: Consider the pseudocode below. Algorithm Total(n) total = 5 for i = 1 to n + 1 for j = i to…

Q: Write at least three different algorithms that prints all multiples of 7 and odd numbers between 1…

A: To print multiples of 7 in range 1 to 100: Algorithm 1:Declare the range 1 to 100.Check if…

Q: What is the time complexity of the algorithm below? void algorithm ( int n ) { int i, j, k; int m =…

A: The answer is...

Q: Consider the following algorithm segment. Assume that n is a positive integer. for i:=1 to 4n S := 0…

A: (A) outer for loop iterate 4n times. So the statement "s=0" executes 4n times. for each value of…

Q: Design an algorithm for testing if a given number belongs to the following sequence or not, compute…

A: Here we can acquire this task by recursion. Recursion is a function that calls itself. We can…

Q: Points Study the two methods below both will do the same work. If you use your algorithm analysis…

A: Linked List is a data structure where elements are linearly arranged, and can be traversed in 1…

Q: Find the complexity of the following blocks of code or algorithm's description. [Note: your answer…

A: 1) Given block of code for i=1 to n do for k = 1 to n do for ( j=2; j < n…

Q: Find the complexity of the following blocks of code or algorithm's description. [Note: your answer…

A: Given: We have to find the Complexity of the following blocks of code. As per the Company…

Q: create assignments for algorithms with given running time:

A: Given running time is O(n) This can be achieved if we use a single loop for iteration Let's see few…

Q: What is the time complexity of the algorithm below? void algorithm1 (int n) { int x = 0; for (int i…

Q: Traverse your two way list for forward and backward, must write separate algorithm f both. TEST FORW…

A: Traversal of a two-way linked list can be done in both the ways, i.e., in forward direction as well…

Q: You are advised to refer to the recommended textbook “Introduction to Algorithms (3rd edition) by…

A: compute the big-oh of given T(n)= 4T(n/2) +n3

Q: uppose three algorithms A, B, and C, can be implemented to perform a task. The ilgorithms have the…

A: Answer:- C < A < B explanation:- first, we will know, what is Time Complexity?…

Q: What does the ff algorithm return? (Note: indentation is important) algorithm foo(a1, a2, ..., an :…

Q: Consider the following recursive algorithm. ALGORITHM Q(n) //Input: A positive integer n if n = 1…

A: Task : Given the algorithm. The task is to find the task of algorithm basic operation time…

Q: create assignments for algorithms with given running time: O(n^2)

A: Given running time is O(n^2) The runtime can be of this only if we use nested loop where each has n…

Q: How many times will the innermost loop be iterated when the algorithm segment is implemented and…

A: According to the Bartelby we are suppose to answer only one question at a time. Kindly repost the…

Q: 4. Consider the following algorithm. ALGORITHM Mystery(n) I/Input: A nonnegative integer n S+0 for i…

A: Given algorithm: ALGORITHM Mystery(n) //Input: A nonnegative integer n S <- 0 for i <- 1 to n…

Q: Consider the following recursive algorithm. 1]) ALGORITHM Riddle(A[0..n â^' 7/Input: An array A[0..n…

A: Answer: I have done code and also I have attached code and code screenshot as well as output

Q: 2. Complete the Table given below for the growth rates of the funtions in the analysis of the…

A: Completed the given table for the growth rates of functions

Q: Give an example of an algorithm that is O(1), an algorithm that is O(n) and an algorithm that is…

A: Consider an example of array of size n and we can provide examples for all time complexities O(1),…

Q: Consider the following algorithm segment. Assume that n is a positive integer such that n 2 4. for k…

A: Elementary operations can allude to: the tasks in rudimentary number juggling: expansion, deduction,…

Q: Find the intersection of two sets of numbers. Your algorithm's time complexity should be 0(n log n)…

A: Input : Two arrays of size n i.e. A[1....n] and B[1....n], each with distinct values. Output :…

Q: Compute the order of the following algorithm segment: for i := 1 to n for j:= 1 to 2i X:= (n - i) ·…

A: As per the requirement program is developed. Algorithm: Step 1: Write the main() method Step 2:…

Q: For the following algorithms, find their i) worst-case complexity, ii) best-case complexity, and…

A: I. An algorithm that finds the largest number in a list of n numbers. Worst-case complexity: it is…

Q: Describe an algorithm that takes as input a list of n integers in non-decreasing order and produces…

A: Answer: Input: List of integers with length n in nondecreasing order.Output: List of all values that…

Q: 4. T(n) = 15n² – 9 log n is O(n²) %3D 5. T(n) = 4n log n – 17 is O(n log n)

A: Given expressions: T(n)=15n2-9log n T(n)=4nlog n -17 To prove: T(n)=15n2-9log n is θ(n2)…

Q: Design a type of sieve algorithm that would (1) Create a list of consecutive integers from 1 to n.…

A: import java.util.*; public class main5 { public static void main(String args[]){ Scanner…

Q: 4. Consider the following algorithm. Algorithm Mystery(n) //Input: A nonnegative integer n S- 0 for…

A: Since you are asking multiple questions we are answering first 4 for you. If you want to get…

Q: Following are the various algorithms time complexities expressions. Find the dominant terms and…

A: Solutions:

Q: This is a recursive algorithm, the time complexity is given by T(n,m) = T(n/2, m) + O(mn) T(2m, m) =…

A: Provided the time complexity for the above given recursive equation with detailed step by step…

Q: algorithms have the following time complexities: A~0(n), B~0(n²), C~ 0( "AL

A: The answer is

Q: algorithms

A: According to the question, we have to find the values of n for which n < 50*log2n So, we have to…

Q: Following are the various algorithms time complexities expressions. Find the dominant terms and…

A: Calculate: Find the dominant terms and specify the Big-Oh complexity of each algorithm.

Q: Following are the various algorithms time complexities expressions. Find the dominant terms and…

A: Answer: 1. Dominant Term: n1.3 O(..)=O(n) 2. Dominant Term:50n log10 n O(..)=O(nlog(n)) 3. Dominant…

Q: Consider the following algorithm segment. Assume that n is a positive integer such that n 2 6. for i…

Q: Do the following algorithms contain recursion and/or iteration? int algorithm1(int x) { int…

A: A finite series of well-defined, instructions implementable by a computer used to resolve a series…

Q: An algorithm randomly combined three-digit number, with no repeated digits in any combination (for…

A: Take the string String containing no repeated digits Find the minimum number of executions Then…

Q: Dominant Term 0(?) Expression n²log2n + n(log2n)² nlog3n + nlog2n 3logsn + logzlog2log2n 0.001 n² +…

A: n2log2n + n(log2n)2 Every time the growth of Quadratic function is more dominating than…

Q: Find the complexity of the following blocks of code or algorithm's description. [Note: your answer…

A: 1. count=1 for( int i=1;i<=100;i++) // for loop runs 100 times which is constant so it takes…

Q: from A-J inclusively: Perform an experimental analysis of the two algorithms prefixAverage1 and…

Q: Determine which properties of algorithms the following algorithms lack (there may be more than one…

A: An algorithm is a set of instructions to perform a specific task. It is a step-by-step…

Q: Algorithm Loops(n): for i= 1 to 2.n do for k = 1 to 4.n do S =s+k.k.k return s a. What is its basic…

A: a. The basic operation in the above program is s=s+k*k*k b. The basic operation will be executed…

Q: Consider the following algorithm segment. Assume that n is a positive integer such that n 2 6. max…

A: Explanation: For Example n=10 Elements are a[0] a[2] a[3] a[4] a[5] a[6] a[7]…

Q: Discuss another algorithm under Divide and Conquer. In your discussion, include the following: 1.…

A: Divide And Conquer : This technique can be divided into the following three parts: => Divide:-…

Question

Q1: Analyze the following Algorithms. Find their running time and asymptotic notations.
Algorithm 1
int fun(int n)
{
int count = 0;
for (int i = 0; i < n; i++)
{
for (int j = i; j > 0; j-)
{
count = count + 1;
}
}
return count;

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Problem Analysis :

VIEW

Answer :

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

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
1.Consider the pseudocode below. Algorithm Total(n) total = 5 for i = 1 to n + 1 for j = i to n for k = 1 to 3 total= total+ i ∗ j ∗ k end for end for end for return total What is the asymptotic class of the above algorithm as a function of n? Prove your assertions! 2. Consider the pseudocode below. Algorithm Total(n) total = 1 for i = 1 to n j = 0 while j < i total = 3 + total end while end for return total What is the asymptotic class of the above algorithm? O(1) O(n) O(n log n) O(n2) None of the above. Which of the following is a negation of the statement: A ∨ B′ ? A’ ∧ B A’ ∨ B A ∧ B′ A → B′ None of the above.
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
Let n be a positive integer, and consider the following algorithm segment. for i := 1 to n for j := 1 to i [Statements in body of inner loop. None contain branching statements that lead outside the loop.] next j next i How many times will the inner loop be iterated when the algorithm is implemented and run?
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?
Discuss 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
If your first name starts with a letter from A-J inclusively: Perform an experimental analysis of the two algorithms prefixAverage1 and prefixAverage2, from lesson examples. Optionally, visualize their running times as a function of the input size with a log-log chart. Use either Java or Python graphical capabilities for visualization. Hint: Choose representative values of the input size n, similar to StringExperiment.java from class examples. class PrefixAverage { /** Returns an array a such that, for all j, a[j] equals * the average of x[0], ..., x[j]. * A[j] = (X[0] + X[1] + … + X[j])/(j+1) * * ******************************************************/ // inner loop size will be 1, 2, 3, ..., n (based on j=0,1,2,...,n-1) // we know that 1+2+3+...+ n-1+n = n(n+1)/2 // so, the running time os O(n^2) public static double[] prefixAverage1(double[] x) { int n = x.length; double[] a = new double[n]; // filled with zeros by default for (int j=0; j < n; j++)…
Determine which properties of algorithms the following algorithms lack (there may be more than one property, but you only have to find one). A. procedure sum (n: integer) { for i =: 1 to n do sum =: sum + 1 return sum } B. procedure increment ( ) { for i =: 1 to n do ai =: ai + 1 return a } C. procedure decrement (a: array of integers) { for i =: 1 to n do ai =: ai − 1 } D. procedure divide (n: integer > 1 ) { i =: 1 while n > 0 do n =: n − 1/i i =: 2 * 1 return n }
Consider the pseudocode below. Algorithm Total(n) total = 5 for i = 1 to n + 1 for j = i to n for k = 1 to 3 total= total+ i ∗ j ∗ k end for end for end for return total What is the asymptotic class of the above algorithm as a function of n? Prove your assertions!
Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
TOPIC: Recurrence what is the running time of the algorithms beding described (in big‐O notation)? State the method you are using and show your work for determining the runtime. 1. T(n) = 10 * T(n/2) + n T(0) = T(1) = 1 2. T(n) = 2 * T(n - 1) + c T(0) = T(1) = 1
design an algorithm to find all the common elements in two sorted lists of numbers. For example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5.What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?