Suppose the number of operations required by a particular algorithm is exactly T(n) = 2n and ou...
Suppose the number of operations required by a particular algorithm is exactly T(n) = 2n and our 1.6 Ghz computer performs exactly 1.6 billion operations per second. What is the largest problem, in terms of n, that can be solved in under a second? In under a day?
Homework Answers
Add Answer to:
Suppose the number of operations required by a particular algorithm is exactly T(n) = 2n and ou...
You are given an algorithm that uses T(n) a n2b.3" basic operations to solve a problem...
You are given an algorithm that uses T(n) a n2b.3" basic operations to solve a problem of size n, where a and b are some real non-negative constants. Suppose that your machine can perform 400,000,000 basic operations per second (a) If a = b = 1, how long does it take for your algorithm to solve problems of size n = 10, 20, 50. For each size of n, include the time in seconds and also using a more appropriate...
Consider four algorithms for doing the same task with exact running times of n log2 n,...
Consider four algorithms for doing the same task with exact running times of n log2 n, n 2 , n 3 , and 2n (the algorithms take n log2 n, n 2 , n 3 , and 2n operations to solve the problem), respectively, and a computer that can perform 10^10 operations per second. Determine the largest input size n that can be processed on the computer by each algorithm in one hour.
Suppose that an algorithm takes 30 seconds for an input of 224 elements (with some particular,...
Suppose that an algorithm takes 30 seconds for an input of 224 elements (with some particular, but unspecified speed in instructions per second). Estimate how long the same algorithm, running on the same hardware, would take if the input contained 230 elements, and that the algorithm's complexity function is: Big theta not Big O a) Big theta(N) b) Big theta (log N) c) Big theta (N log N) d) Big theta(N^2) Assume that the low-order terms of the complexity functions...
1. Fractional Knapsack Problem Algorithm Which best describes the tightest range of the number of items...
1. Fractional Knapsack Problem Algorithm Which best describes the tightest range of the number of items with only fractional inclusion (i.e. not entirely included or excluded) in the knapsack? (Let n denote the number of items for possible inclusion.) A) At least 0 items and at most n items B) At least 1 items and at most n items C) Exactly n items D) At least 0 items and at most n-1 items E) At least 1 items and at...
It is due in 2 hours.. Thanks ! Suppose that an algorithm runs on a tree...
It is due in 2 hours.. Thanks !
Suppose that an algorithm runs on a tree containing n nodes. What is the time complexity of the algorithm if the time spent per node in the tree is proportional to the number of grandchildren of the node? (Assume that the algorithm spends O(1) time for every node that does not have a grandchild.) In modern software development, a useful utility called make is usually employed to manage the compilation order of...
When counting the number of arithmetic operations in evaluating an expression, we often make the simplifying...
When counting the number of arithmetic operations in evaluating an expression, we often make the simplifying assumption that each operation has the same cost. For example, consider the following statement from the Merge-Sort algorithm for dividing the problem into two equal problems. q = ⌊(? + ?)/2⌋ we would say that the evaluation requires a total of 3 arithmetic operations (+, / and “floor”). That is, the time cost is 3. If that statement was embedded in a loop that...
Java (Please answer in a specific way and not just show the program) Determine the largest...
Java (Please answer in a specific way and not just show the program) Determine the largest values of n for which the corresponding Fibonacci Numbers can be computed within the given time. n = _____ time required: less than 10 seconds n = _____ time required: less than 30 seconds n = _____ time required: less than 1 minute n = _____ time required: less than 5 minutes Estimate the value of n for the largest value of fib(n) that...
4.) Suppose the demand D and unit price p of a particular baseball player's jerseys are...
4.) Suppose the demand D and unit price p of a particular baseball player's jerseys are related by the exponential demand function D = 7500e -0.001p, a.) Find the unit price that maximizes revenue. b.) What is the maximum revenue that can be earned when selling these jerseys? T(t) 5.) The total number of online orders a company receives is given by 15 1 + 250-0.5 thousand orders t weeks after the website began advertising. Use your calculator to graph...
3. [10 marks] Suppose we would like to buy n items from SuperCheapStore (SCS); all items...
3. [10 marks] Suppose we would like to buy n items from SuperCheapStore (SCS); all items are currently priced at 1 CAD. Unfortunately there is no delivery and we have to deliver them home. The bad news are: we can fit only 1 item in our truck: it takes one day to drive home and back. There is even worse news -SCS charges us for the storage of undelivered items and the charge for storage of te i growth exponentially...
In terms of the programming language required, the algorithm needs to be written in pseudocode Dynamic Programming Cons...
In terms of the programming language required, the algorithm
needs to be written in pseudocode
Dynamic Programming Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be 0-red. 1-yellow, 2-blue, 3-pink. , c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4...
You are given an algorithm that uses T(n) a n2b.3" basic operations to solve a problem of size n, where a and b are some real non-negative constants. Suppose that your machine can perform 400,000,000 basic operations per second (a) If a = b = 1, how long does it take for your algorithm to solve problems of size n = 10, 20, 50. For each size of n, include the time in seconds and also using a more appropriate...
It is due in 2 hours.. Thanks !
Suppose that an algorithm runs on a tree containing n nodes. What is the time complexity of the algorithm if the time spent per node in the tree is proportional to the number of grandchildren of the node? (Assume that the algorithm spends O(1) time for every node that does not have a grandchild.) In modern software development, a useful utility called make is usually employed to manage the compilation order of...
4.) Suppose the demand D and unit price p of a particular baseball player's jerseys are related by the exponential demand function D = 7500e -0.001p, a.) Find the unit price that maximizes revenue. b.) What is the maximum revenue that can be earned when selling these jerseys? T(t) 5.) The total number of online orders a company receives is given by 15 1 + 250-0.5 thousand orders t weeks after the website began advertising. Use your calculator to graph...
3. [10 marks] Suppose we would like to buy n items from SuperCheapStore (SCS); all items are currently priced at 1 CAD. Unfortunately there is no delivery and we have to deliver them home. The bad news are: we can fit only 1 item in our truck: it takes one day to drive home and back. There is even worse news -SCS charges us for the storage of undelivered items and the charge for storage of te i growth exponentially...
In terms of the programming language required, the algorithm
needs to be written in pseudocode
Dynamic Programming Consider the following problem based on the transformation of a sequence (or collection) of coloured disks Assume that you have a very large collection of disks, each with an integer value representing the disk colour from the range [0, c. For example, the colour mapping might be 0-red. 1-yellow, 2-blue, 3-pink. , c-black For a given sequence of coloured disks e.g., ( 0,1,2,3,4...
Most questions answered within 3 hours.
-
Two concentric current loops lie in the same plane. The smaller
loop has a radius of...
asked 23 minutes ago -
1)Which of the following is an
important difference between qualified and nonqualified retirement
plans?
a. Qualified...
asked 35 minutes ago -
What's the streaming business's problem on the
horizon?
asked 1 hour ago -
I need help with writing the conclusion for this online lab
report
Abstract
By testing the...
asked 1 hour ago -
For the reaction 1N2+3H2-----> 2NH3, would the reaction rate
trend be: delta[NH3]/ delta t = -2...
asked 2 hours ago -
Within your current/past organization, identify a problem/issue
and format a design to address same. You may...
asked 2 hours ago -
A sock stuck to the side of a clothes-dryer barrel has a
centripetal acceleration of 24...
asked 3 hours ago -
A perfect gas undergoes an isentropic process such that its
volume doubles. If the ratio of...
asked 3 hours ago -
list the elements in groups 3A to 6A in the same order as in the
periodic...
asked 3 hours ago -
Estimating effect size. Peng and Chen (2014)
evaluated effect size estimates for various tests. In their...
asked 3 hours ago -
Write a script in MySQL that creates and calls a stored
procedure name test. This procedure...
asked 3 hours ago -
If we test the following: H0: μ = 17
vs. H1: μ ≠ 17 and the...
asked 3 hours ago