ADAA Final PASSED Exam Questions and CORRECT Answers
ADAA Final PASSED Exam Questions and CORRECT Answers The notation big O(n^2) means that, up to a scaler, a data structure or algorithm is bounded above and below by n^2 - CORRECT ANSWER- False The notation θ(nlogn) means that, up to a scaler, a data structure or algorithm is bounded above by n and below by logn - CORRECT ANSWER- False The notation O(n) means that, up to a scaler, a data structure or algorithm is bounded below by n - CORRECT ANSWER- False
Written for
- Institution
- ADAA
- Course
- ADAA
Document information
- Uploaded on
- June 15, 2024
- Number of pages
- 9
- Written in
- 2023/2024
- Type
- Exam (elaborations)
- Contains
- Questions & answers
Subjects
Also available in package deal