Purchase Solution

Algorithm Timing

Not what you're looking for?

Ask Custom Question

How much time does an algorithm take to solve a problem of size n if this algorithm uses 2n^2 + 2^n bit operations, each requiring 10^-9 second, with these values of n?
i) 10
ii) 20
iii) 50
iv) 100

I need help with a question, the attachment contains the question as well as what I think is the answer. Could someone please tell me if my answer looks right. If it is not right what steps should be taken to solve the problem.

thanks

Attachments
Purchase this Solution
Solution Summary

The expert examines algorithm timing problems.

Solution Preview

How much time does an algorithm take to solve a problem of size n if this algorithm uses 2n^2 + 2^n bit operations, each requiring 10^-9 second, with these values of n?
i) 10
ii) 20
iii) 50
iv) 100

We need to go through a ...

Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Write a small program in C++ to time the given algorithm.

    Algorithm: SUM[n=0 to 100] n(n x 3n)(n+1)/(77n - 4) Hint: you can use a timing function such as: clock_t begin = clock(); ... clock_t end = clock(); See attachment for a better illustration of the math.

  • Algorithm Implementation of Edge Triggered

    The output in the timing diagrams are discussed.

  • Algorithm analysis for N elements

    Just functions that show the timing. This is how I did it.

  • Discrete Logarithms

    For coding part, I successfully coded shank's algorithm, Pollard's rho algorithm and Pohlig-Hellman algorithm. In my document and code, I not only gave the final solution for each problem, but also gave some intermediate results.

  • A basic overview of algorithm analysis

    284625 A basic overview of algorithm analysis An Algorithm is a set of steps that defines how a task must perform to produce expected results. An algorithm can be represented in many ways.

  • Election Algorithm

    540941 Election Algorithm Derive an election algorithm for bidirectional rings that is more efficient than the ring algorithm: The ring algorithm assumes that the links are unidirectional and that each process sends its message to the neighbor on the

  • Explanation of how to make an algorithm more efficient

    This solution takes an n-squared algorithm for finding the two closest elements in an array and shows how that algorithm can be converted to a much faster algorithm.

  • Algorithm Efficiency: Example Problems

    Consider the following algorithm where n is a positive integer. What is the efficiency class of this algorithm? Show your reasoning. Please see the attachment. Provides steps necessary to determine the algorithm efficiency problems.

  • Runtime Analysis of Search Algorithm

    Suppose an algorithm that processes a data set of size 8 has a runtime of 72, and the same algorithm on a data set of size 20 has a runtime of 420.

View More Related Solutions