Algorithms quiz: 58 questions
58 questions from the 18 lessons of Algorithms. Each answer is explained, with a link back to the lesson it comes from, and your best score stays on this device.
Test yourself
58 questions from this course's lessons, in a random order. See what you remember, then go back to the lessons behind the questions you missed.
What the quiz covers
- Analysing algorithms (3 questions)
- Binary search (3 questions)
- Bubble, selection and insertion sort (3 questions)
- Merge sort (3 questions)
- Quick sort (3 questions)
- Heap sort and counting sort (3 questions)
- Recursion and backtracking (3 questions)
- Greedy algorithms (3 questions)
- Dynamic programming (3 questions)
- Knapsack and longest common subsequence (3 questions)
- Topological sort (3 questions)
- Shortest paths: Dijkstra and Floyd–Warshall (3 questions)
- Minimum spanning trees (3 questions)
- Number algorithms (3 questions)
- Divide and conquer and the master theorem (4 questions)
- String matching: naive search and KMP (4 questions)
- Searching grids: BFS and A* (4 questions)
- Bit manipulation (4 questions)