Computer Science 302
Data Structures

CSC 302 Study Guide for the First Midterm Examination Spring 2006

1. There will be true/false questions.
2. There will be some fill-in-the-blank questions.
3. Code fragments: analyzing the asymptotic time complexity.
4. Possibly a question to see if you know what "big O" really means.
5. Possibly write a small code fragment: 5 lines or so.
6. Possibly a question to probe whether you understand recursion.
7. Possibly a question to see whether you understand
   1. selection sort,
   2. insertion sort,
   3. bubblesort,
   4. mergesort.
8. Question(s) to see whether you know what queues and stacks are, and how to use implement them and use them, including array and linked list implementations, depth-first and breadth-first search, finding shortest paths using a queue, and finding a solution to a puzzle such as Sudoku, using a stack.
9. Question(s) about binary trees and traversal.
10. Question(s) about search structures, including specific questions about
    1. unordered lists and ordered lists used as search structures,
    2. binary search trees,
    3. 2-3 trees,
    4. AVL trees and heaps, including perhaps a question to see if you know how to do rotation.
11. Check here tomorrow (Wednesday) morning at 7:00 AM for possibly more topics.