Preparing for the Final Exam
To prepare for the Final Exam it is recommended that you have completed the following practice quizzes – I will choose 10 questions from these quizzes (possibly make a few minor modifications) and these will make up your final exam. The final exam will be open book/open notes – but will have a one hour time limit once you start;
Data Structures Mock Tests
- Linked List(18)
- Stack(11)
- Queue(13)
- Binary Trees(19)
- Binary Search Trees(17)
- Balanced Binary Search Trees(14)
- Graph(10)
- Hash(8)
- Array(4)
- Misc(15)
- B and B+ Trees(11)
- Heap(16)
- Tree Traversals(17)
Algorithms Mock Tests
- Analysis of Algorithms(33)
- Sorting(32)
- Divide and Conquer(8)
- Greedy Algorithms(9)
- Dynamic Programming(9)
- Backtracking(1)
- Misc(39)
- NP Complete(15)
- Searching(7)
- Analysis of Algorithms (Recurrences)(16)
- Recursion(18)
- Bit Algorithms(4)
- Graph Traversals(18)
- Graph Shortest Paths(19)
- Graph Minimum Spanning Tree(16)
Previous Final Exams with Answers