CS 216 - Data Structures Syllabus

Topics:

• Sets
• Array-based Stacks
• Array-based Queues
• Linked Lists
• Linked-list-based Stacks and Queues
• AI Tree Search Algorithms (uninformed) (see http://cs.gettysburg.edu/~tneller/resources/ai-search/index.html)
  • Breadth-First Search
  • Depth-First Search (Iterative and Recursive)
  • Depth-Limited Search
  • Iterative-Deepening Depth-First Search
• Analysis of Algorithms
• Algorithm Tradeoffs - Time vs. Space vs. Quality
• Hash Tables (chained and open address)
• Binary Search Trees
• Binary Heaps
• Elective Topics

Note: This syllabus is provided solely for review purposes and is subject to change.  It is not exhaustive and does not constitute a guarantee of what will or will not be covered in exams.