Algorithms and Data Structures
Complexity and Measured Performance
Relate asymptotic growth to the time and memory consumed by real implementations.
0/5Articles read
0/12Latest correct answers
12Unanswered questions
0Due for review
Loading learning records…
Readings and practice
Complexity and Measured Performance
Unread
Big-O notation: bounding growth for large inputs
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Amortized analysis: charge the whole operation sequence
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Compare storage for the same graph
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Measure Bloom-filter false positives by condition
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered