Asymptotic-Complexity
October 26, 2023Asymptotic-Complexity
October 26, 2023Asymptotic-Complexity
| Question 10 |
Match the following asymptotic notations used in the time and space analysis of algorithms-with their meanings
A: O-notation
B: Θ-notation
C: Ω-notation
I. Greater than or equal to (“≥”)
II. Less than or equal to (“≤”)
III. Equal to (“=”)
| A-III, B-II, C-I | |
| A-II, B-III, C-I | |
| A-I, B-II, C-III | |
| None |
Question 10 Explanation:
O-notation is less than or equal to.
Θ-notation is equal to.
Ω-notation is greater than or equal to.
Θ-notation is equal to.
Ω-notation is greater than or equal to.
Correct Answer: B
Question 10 Explanation:
O-notation is less than or equal to.
Θ-notation is equal to.
Ω-notation is greater than or equal to.
Θ-notation is equal to.
Ω-notation is greater than or equal to.
Subscribe
Login
0 Comments