Big-O Big-Theta
Not what you're looking for?
Given the algorithm below, suppose the number of times the "beep" instruction is executed is f(n). Choose all true statements below, and no false ones...
for i := 1 to n
for j : = 1 to i
for k := 1 to 18
BEEP
next k
next j
next i
a. f(n) is big-Theta (n^2)
b. f(n) is big-Omega (n^3)
c. f(n) is O(n^3)
d. f(n) is O (n log n)
Purchase this Solution
Solution Summary
This is a programming exercise that counts the number of times "beep" is executed,
Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
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.
Probability Quiz
Some questions on probability
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.