CS 206 - Data Structures

Updated March 13, 2020

• Week 1. Jan 21-24
  Introduction, Java Review
  • Reading: Chapters 1, 2.1-2.4
• Week 2.
  Object-oriented programming (OO design and inheritance), Array Lists
  • Reading: Chapters 2.5, 2.6, 3.1 and 7.2
• Week 3.
  Linked Lists
  • Reading: Chapters 3.2 and 3.4. Possibly some discussion of 3.3 and 3.6
• Week 4.
  OO review, Algorithm Analysis
  • Reading: Chapters 4.1 and 4.3
• Week 5.
  Stacks and Queues
  • Reading: Chapters 6 (focus on 6.1 and 6.2)
• Week 6.
  Midterm review and Midterm 1
• Week 7.
  Recursion
  • Reading : Chapter 5.1, 5.3, 5.4, 5.5
• Week 8. (March 16 ..)
  Trees
  • Reading: Tuesday: Chapter 8.1.3, 8.2-8.3.1
  • Reading Thursday: Chapter 8.3 and 8.4.1-8.4.4
• Week 9.
  Priority Queues and Heaps
  • Reading: Tuesday: Chapter 9.1-9.2
  • Reading: Thursday Chapter 9.3-9.4
• Week 10.
  Sorting and a return to Recursion
  • Reading: Chapter 12.1-12.2
  • Midterm 2 material ends here
• Week 11.
  Hashtables and Maps; Midterm Review
  • Reading: Chapter 10.1-10.2
• Week 12.
• Week 13. Binary Search trees and Balanced trees, Graphs
  • Reading: Chapter 11.1-11.3, Ch 14.1-2
  AVL rotations lab
• Week 14. Graphs, Final Review
  • Reading: 14.6
  Lab: sample final quesions
• Week 15. Final exam week - the final exam will be self-scheduled through the Office of the Registrar.