Algorithm Analysis
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 55% Most missed: “Primitive operation 3”
Algorithm Analysis
Time left 00:00
25 Questions

1. General Rules for time complexity 1

2. Experimental Studies step 3

3. Basic operation 2

4. Classification of algorithms based on

5. Greedy

6. Primitive operation 7

7. Theoretical Analysis help by reason 3

8. Want to establish algorithm efficiency

9. Average case time is often

10. Branch and bound step 2

11. The number of input data item (=n) is directly

12. Count how many primitive operation are excuted and

13. Example of divde and conquer

14. Limitation of experiments 1

15. Theoretical Analysis help by reason 2

16. General rule for time complexity for calculating fragments - example: for(n) for(n) nested loop

17. Example of backtracking

18. big-O asymptotic is denoted as

19. Primitive operation 3

20. Most algorithms transform input objects into

21. We assume that it takes a constant amount of time

22. g(n) is

23. Experimental Studies step 2.

24. Randomized

25. Dynamic programming step 3