Course Description:

Data Structures and Algorithms extends the topics of AP Computer Science A and provides a more formal and more in-depth study of algorithms, data structures, and data abstraction. Binary trees, recursive data structures and dynamically allocated structures are fundamental to Data Structures and Algorithms.

Taught by: Alan Friebe

Prerequisite: Algebra II and AP Computer Science A Students should have an C or better in AP Computer Science A.

Classes after: iT Programming DE

Learning targets:

  • Heaps and Priority Queues
  • Files I/O and scanner chopper review
  • Review of base systems
  • Inheritance
  • Interfaces and abstract classes
  • Booleans
  • Binary Search Trees and Nodes
  • HashSets and HashMaps
  • Graph theories
  • Searching and Sorting
  • LinkedLists and ListNodes
  • Stacks and Queues

Student Perspective:

Data Structures and Algorithms was challenging, but in comparison with Computer Science A, it was a breeze. In this class you will review what you learned in Computer Science A.  There are a few units that will be entirely new topics, but the time given to learn those topic is longer.  This is true with the labs as well. The labs are harder, but the due dates are often longer. My advice is to keep up with your school work for this class because once you fall behind it is impossible to catch up.