We Define the ___________ of an Algorithm to Be F(n)

question 30

Multiple Choice

We define the ___________ of an algorithm to be f(n) if, for all n and all inputs of length n the execution of the algorithm takes at most f(n) steps.this is a common measure of the efficiency of an algorithm.

• A)time complexity
• B)one-way function
• C)timing attack
• D)OAEP

---

Definitions:

Principal

The original sum of money borrowed in a loan, or the amount of the investment, excluding any interest or growth.

Present Value

The present value of an anticipated sum of money or series of cash flows, considering a certain return rate.

Discounting

The process of determining the present value of a payment or a stream of payments that will be received in the future.