Question: (a) Suppose that a particular algorithm has time complexity (T(n) = 3 times 2^n), and that executing an implementation of it on a particular machine

(a) Suppose that a particular algorithm has time complexity \(T(n) = 3 \times 2^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?

(b) Suppose that another algorithm has time complexity \(T(n) = n^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?

(c) A third algorithm has time complexity \(T(n) = 8n\). Executing an implementation of it 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?

Step by Step Solution

3.37 Rating (150 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a The time complexity of the first algorithm is Tn 3 times 2n which is an exponential time complexit... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Practical Introduction To Data Structures Questions!