Which of the following statements about time complexity analysis is true? a. It is impossible for a correct algorithm to have a time complexity so high that it is impractical to use, but the program may feel "sluggish". b. When there are multiple possible input values with the same size, we usually only care about the input values which would cause the algorithm to run the fastest. c. Two different algorithms that solve a particular program correctly can have different time complexities. d. We usually only care about the behaviour of the algorithm as the input size gets small

Which of the following statements about time complexity analysis is true? a. It is impossible for a correct algorithm to have a time complexity so high that it is impractical to use, but the program may feel "sluggish". b. When there are multiple possible input values with the same size, we usually only care about the input values which would cause the algorithm to run the fastest. c. Two different algorithms that solve a particular program correctly can have different time complexities. d. We usually only care about the behaviour of the algorithm as the input size gets small

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 17PE

See similar textbooks

Similar questions

43- Suppose that you implement an algorithm to solve a problem. It works correctly and quickly for small inputs, but you notice that your program runs much slower as the input size grows (to the point of becoming unusable). In fact, each time you increase the input size by one the execution time of your program roughly doubles! Which of the following options is the most effective way of addressing this issue? You may assume that program outputs which are close to optimal are acceptable. a. Purchase a faster computer---this is a worthwhile investment as a programmer and will resolve this kind of issue. b. Design a new approximate algorithm with lower time complexity. c. Remove comments and any other non-essential elements in your source code that may be slowing things down. d. Switch to a more efficient programming language, such as machine code, because although Python is readable it is also too slow. e. Invoke Python with the --linear-time option to force…
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]>=…
c. How many times is the basic operation executed?d. What is the efficiency class of this algorithm?e. Suggest an improvement, or a better algorithm altogether, and indicate itsefficiency class. If you cannot do it, try to prove that, in fact, it cannot bedone.
Provided the problem statement below, which of the following algorithms will solve the problem? A student name and three test marks are entered, the average mark must be calculated and it must be determined if the student passes or fails (mark equal or above 50%). The student name, average and result must be displayed on screen. Select one: a. Function CalcAve (valTest1, valTest2, valTest3) return (valTest1 + valTest2 + valTest3) / 3 Function DetermineResults(valAve) if valAve < 50 then message = “fail” else message = “pass” endif return message ShowResults display “Enter the student name” enter studentName display “Enter the first test mark” enter testMark1 display “Enter the second test mark” enter testMark2 display “Enter the third test mark” enter testMark3 average = CalcAve() display “The average mark for “, studentName, “ is “, average display “This student will “, DetermineResults() end b. Function CalcAve (valTest1,…
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
Consider the following algorithm. a) What does this algorithm compute?b) What is its basic operation?c) How many times is the basic operation executed?d) What is the efficiency class of this algorithm?e) Suggest an improvement, or a better algorithm altogether, and indicate itsefficiency class. If you cannot do it, try to prove that, in fact, it cannot bedone
# Exercise 1. Implement the algorithm covered in lectures that determines if an integer n is prime. Your function should return True, if n is prime, and False otherwise. Your algorithm has to be effective for n ~ 1,000,000,000,000.def isPrime(n):
Find the error in the following argument: Theorem. All computer programs contain the same number of bugs. Proof. If we show that any set of n programs contains the same number of bugs, then we have proved the theorem. We argue by induction on n. If n=1 then in any set of 1 program, all the programs contain the same number of bugs, so the statement is true, in this case. Now suppose that for every set of programs containing less then n programs, all the programs have the same number of bugs. Let DD be a set of n programs p1,p2,…,pn. Now the set D1={p2,…,pn} contains n−1 programs and hence they all contain the same number of bugs, by the induction hypothesis. Similarly the set D2={p1,…,pn−1} contains n−1 programs and hence they all contain the same number of bugs. In particular p1 and pn contains the same number of bugs as the other programs in the set. Hence all the programs contain the same number of bugs.
1. Analyze the following code using step account (total number of steps). Give the detailed analysis. What is the asymptotic complexity of the above algorithm?(a) int s = 0;(b) for( int i = 1; i < n; i + +)(c) for (int j = 1; j <= i; j + +)(d) s = s + j;
a. What does this algorithm compute? b. What is its basic operation? c. How many times is the basic operation executed" d. What is the efficiency class of this algorithm? e. Suggest an improvement, or a better algorithm altogether, and in-dicate its efficiency class. If you cannot do it, try to prove that, in fact, it cannot be done.
Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. b. You have a file of n student records indicating each student’s number, name, home address, and date of birth. Find out the number of students from each of the 50 U.S. states.
The following snippet of pseudocode fails to live up to all of the clarity, correctness, and termination requirements of algorithms. In each case, describe the failing step, and thenrewrite the pseudocode as a proper algorithm. def long_division(numerator, denominator): quotient = numerator/denominator remainder = numerator % denominator