2) Estimate the number of inputs that could be processed in the following cases: (a) Suppose that a particular algorithm has time complexity T(n) = 3 x 2", and that executing an implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we are presented with a machine that is 64 times as fast. How many inputs could we process on the new machine in t seconds? (b) Suppose that another algorithm has time complexity T(n) = n², and that executing an implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we are presented with a machine that is 64 times as fast. How many inputs could we process on the new machine in t seconds? (c) A third algorithm has time complexity T(n) = 8n. Executing an implementation of the algorithm on a particular machine takes t seconds for n inputs. Given a new machine that is 64 times as fast, how many inputs could we process in t seconds?
2) Estimate the number of inputs that could be processed in the following cases: (a) Suppose that a particular algorithm has time complexity T(n) = 3 x 2", and that executing an implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we are presented with a machine that is 64 times as fast. How many inputs could we process on the new machine in t seconds? (b) Suppose that another algorithm has time complexity T(n) = n², and that executing an implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we are presented with a machine that is 64 times as fast. How many inputs could we process on the new machine in t seconds? (c) A third algorithm has time complexity T(n) = 8n. Executing an implementation of the algorithm on a particular machine takes t seconds for n inputs. Given a new machine that is 64 times as fast, how many inputs could we process in t seconds?
Related questions
Question
help please
![2) Estimate the number of inputs that could be processed in the following cases:
(a) Suppose that a particular algorithm has time complexity T(n) = 3 x 2", and that executing an
implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we
are presented with a machine that is 64 times as fast. How many inputs could we process on the
new machine in t seconds?
(b) Suppose that another algorithm has time complexity T(n) = n², and that executing an
implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we
are presented with a machine that is 64 times as fast. How many inputs could we process on the
new machine in t seconds?
(c) A third algorithm has time complexity T(n) = 8n. Executing an implementation of the
algorithm on a particular machine takes t seconds for n inputs. Given a new machine that is 64
times as fast, how many inputs could we process in t seconds?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Feb46c4d0-e51e-4455-871b-ccff7df69ddd%2F7b78d40e-3c0e-4e08-b84b-07ab39023d79%2Fkzumgm_processed.png&w=3840&q=75)
Transcribed Image Text:2) Estimate the number of inputs that could be processed in the following cases:
(a) Suppose that a particular algorithm has time complexity T(n) = 3 x 2", and that executing an
implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we
are presented with a machine that is 64 times as fast. How many inputs could we process on the
new machine in t seconds?
(b) Suppose that another algorithm has time complexity T(n) = n², and that executing an
implementation of it on a particular machine takes t seconds for n inputs. Now suppose that we
are presented with a machine that is 64 times as fast. How many inputs could we process on the
new machine in t seconds?
(c) A third algorithm has time complexity T(n) = 8n. Executing an implementation of the
algorithm on a particular machine takes t seconds for n inputs. Given a new machine that is 64
times as fast, how many inputs could we process in t seconds?
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)