CSE 101 Study Guide for the Final Examination

1. Do the homework.
2. Review Appendix A of your textbook.
3. Read Appendix B of your textbook.
4. Review reccurrences.
5. Read Chapter 1 of your textbook.
6. Read Sections 2.1, 2.2., 2.3, and 2.4 of your textbook.
7. Read Sections 3.1, 3.2, and 3.3 of your textbook.
8. Read Sections 4.1, 4.2., 4.3, and 4.4 of your textbook.
9. Read Sections 5.1 and 5.2 of your textbook.
10. Read Section 6.4 of your textbook.
11. Read Section 7.3 of your textbook.
12. Read Chapter 8 of your textbook.
13. Read Chapter 9 of your textbook.
14. Read Section 11.1 of your textbook.
15. Review your class notes, in particular
    1. Graph algorithms:
       1. Data structures used to represent graphs.
       2. Topological sorting (Section 5.3 of your textbook.)
       3. Dijkstra's algorithm.
       4. Minimum spanning trees, including Kruskal's and Prim's algorithms.
    2. Sorting (all algorithms given in class)
    3. Huffman's algorithm.
    4. The Hu-Tucker algorithm.
    5. Backtracking, dynamic programming, divide and conquer, greedy algorithms.
    6. Prefix, infix, and postfix expressions.
    7. Preorder, inorder, and postorder traversals of a binary tree.
    8. Radix sort, bucket sort, polyphase mergesort.
    9. Hashing. (Section 7.3 of your textbook.)
    10. Fast addition in parallel.