Basic Algorithms
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 62% Most missed: “Big Omega - Ω(g(n)) -definition”
Basic Algorithms
Time left 00:00
25 Questions

1. Closest Pair (Time Complexity)

2. Is average case efficiency often (worst case + best case)/2?

3. Important problem types

4. Sums of formulas theorems

5. How do you prove big theta?

6. DFS (Time Complexity)

7. Big Theta - Θ(g(n)) -meaning

8. Big Omega - Ω(g(n)) -definition

9. Assignment Problem

10. Time Efficiency (Def)

11. Requirements of an algorithm

12. BFS

13. Big Omega - Ω(g(n)) -meaning

14. Big Theta - Θ(g(n)) -definition

15. String Matching (Algorithm)

16. Sum from i=0 to n of a^i

17. GCD Algorithms Differences

18. Basic Operation (Def)

19. Space Efficiency (Def)

20. Bubble Sort

21. DFS (Algorithm)

22. Big Oh - O(g(n)) -definition

23. String Matching (Time Complexity/Worst Case)

24. BFS (Time Complexity)

25. DFS