Algorithms and Data Structures
Arrays, Lists, Stacks, Queues, Hash Tables, and Trees
Choose and implement data structures according to the operations a program needs.
Loading learning records…
Readings and practice
Arrays: why indexed access is constant time
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
Linked lists: cheap insertion does not imply cheap search
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
Hash tables: the conditions behind expected O(1)
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
Binary heaps: repeatedly extracting the smallest value
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
Binary search trees: height determines operation cost
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
Tries: sharing common prefixes in a search tree
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
Bloom filters: compactly ruling out membership
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
Choose a data structure from the operations you need
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
Arrays versus linked lists
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
Implementing a heap-based priority queue
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
Testing hash tables across collision workloads
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
Measuring array and linked-list traversal
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
Deques
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
Circular buffers
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
AVL trees
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
Red–black trees
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
Build ordered shortcuts with a skip list
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
Represent bounded sets with bits
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
Preserve segment-tree versions by path copying
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