1. Memory requirements for a specific algorithm doesn\'t include which character

Question

1. Memory requirements for a specific algorithm doesn't include which characteristic?

A. Subsets of Complexity

B. Finite memory

C. Time requirements must be considered

D. in theory, an algorithm can have as much memory as necessary

E. the contents of the memory

2. which of the following does not apply to algorithmic orders of complexity?

A. remove lower order of complexity formula

B. consider the coefficient of the highest order term of the complexity formula

C. complexity formulae apply to time and memory analysis

D. used to compare one algorithm to another

E. can involve mathematical limits.

3. Which is the highest in complexity?

A. (n) * 2n

B. (n2) * n

C. n2

D.nlog(n)

E. 3n

4. Which is the lowest Complexity"

A. (n) * 2n

B. (n2) * n

C. n2

D.nlog(n)

E. 3n

5. Highest polynomial complexity?

A. (n) * 2n

B. (n2) * n

C. n2

D.nlog(n)

E. 3n

6. Find the least integer n such that F(x) is O(Xn) for the following function:

F(X) = 1X4 + (2log x)3

A.1

B.2

C.3

D.4

E.5

Explanation / Answer

1 D

2 E

3 B it is n^3 which will have the highest complexity

4. D nlogn will have the lowest complexity

5. it will be B

6. it will be 1as already it is O(n)

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.