November 13, 1999
The 2nd midterm covers all lecture, up to and including linked lists. It also covers labs 1 through 9. The reading material below goes into more detail than the lectures. If there is something in the book that was not covered in the lectures, you will not be expected to know it.

Readings:

• Chapter 1
• Section 1.1 to 1.3
• Problems 1-7, 10-12, 19
• Chapter 2
• Sections 2.1 to 2.3
• Problems 1-4, 13, 14, 18
• Chapter 3
• Sections 3.1, 3.2, 3.4 to 3.8
• Problems 1, 6, 7, 9, 10, 13-15, 18, 19, 22-24
• Chapter 4
• Sections 4.1-6, 8, 9
• Problems 1, 3-10, 13, 14, 19, 20
• Chapter 5
• Sections 5.1, 5.2, 5.4, 5.5
• Problems 5, 6, 17-21
• Chapter 6
• Sections 6.1
• Problems 1-7, 11-17, 23-25, 29
• Chapter 12
• Sections 12.1, 2, 3
• Problems 1-5, 7-10, 13-17, 19
• Chapter 13
• Sections 13.1, 2
• Problems 1, 3, 7, 11-13, 15
• (replace ``insertion sort'' with ``quicksort'' in above problems)
• Chapter 16
• Sections 16.1, 2
• Problems 1-3, 8-11, 19
• Appendix B
• Binary & Hex Numbers
• Appendix D
• Precedence Rules
• Appendix G
• Style Guide
• Handouts (not covered in textbook)
• Quicksort
• Time Complexity