CSE 101 Study Guide for Second Examination

The second examination may have question on it that relate to the material covered in the first examination.
Old Material:
  1. Do the homework.
  2. Review Appendix A of your textbook.
  3. Read Appendix B of your textbook.
  4. Review reccurrences. (Except for problems 2, 7, 9, 10, and 18.)
  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 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. Prefix, infix, and postfix expressions.
  11. Preorder, inorder, and postorder traversals of a binary tree.
  12. Radix sort, bucket sort, polyphase mergesort.
  13. There will not be a question about the fast parallel method of adding.
New Material:
  1. Do the homework. (It would be advisable to do the homework before Wednesday.)
  2. Read Sections 3.2 and 3.3 of your textbook.
  3. Read Section 6.4 of your textbook.
  4. Read Chapter 8 of your textbook.
  5. Read Chapter 9 of your textbook.
  6. Read Section 11.1 of your textbook.
  7. Review your class notes, in particular
    1. Dijkstra's algorithm.
    2. Sorting (all algorithms given in class)
    3. Huffman's algorithm.
    4. The Hu-Tucker algorithm.
    5. Minimum spanning trees.
    6. Backtracking, dynamic programming, divide and conquer, greedy algorithms.
    7. When do you use the various techniques?