The course covers fundamentals of data organization and basic algorithms for data manipulation. Topics include arrays, lists, stacks, queues, trees, sets, and hash tables. Fundamentals of algorithm performance are introduced, with an emphasis placed on time complexity analysis. Special emphasis is placed on appropriate use of containers, iterators, and algorithms defined in the C++ standard library. Laboratory assignments involve both the use and implementation of common data structures.

Goals

• Understand and apply complex data structures and algorithms.
  • Lab 1: Spell Checking Using list
  • Lab 2: list Implementation
  • Lab 3: Generic Algorithm Implementation
  • Lab 4: Spell Checking Using set
  • Lab 5: Hash Table Implementation
  • Lab 6: Spell Checking Using a Hash Table Implementation
  • Midterm and Final Exams
  • Quizzes 4-6, and 8-10
• Use appropriate algorithms (and associated data structures) to solve complex problems.
  • Lab 1: Spell Checking Using list
  • Lab 2: list Implementation
  • Lab 3: Generic Algorithm Implementation
  • Lab 4: Spell Checking Using set
  • Lab 5: Hash Table Implementation
  • Lab 6: Spell Checking Using a Hash Table Implementation
  • Midterm and Final Exams
• Have a thorough understanding of the STL.
  • Lab 1: Spell Checking Using list
  • Lab 2: list Implementation
  • Lab 3: Generic Algorithm Implementation
  • Lab 4: Spell Checking Using set
  • Lab 5: Hash Table Implementation
  • Lab 6: Spell Checking Using a Hash Table Implementation
  • Midterm and Final Exams
  • Quizzes 4-6 and 8-10
• Be able to analyze the complexity of algorithms (both sequential and recursive).
  • Lab 7: Spell Checker Comparisons
  • Midterm and Final Exams
  • Quiz 2
• Understand the use of recursion in problem solving.
  • Midterm or Final Exam
  • Quiz 3
• Be able to use data structures in software design and implementation.
  • Lab 1: Spell Checking Using list
  • Lab 4: Spell Checking Using set
  • Lab 6: Spell Checking Using a Hash Table Implementation
• Be able to apply the STL in software design.
  • Lab 1: Spell Checking Using list
  • Lab 4: Spell Checking Using set
  • Lab 6: Spell Checking Using a Hash Table Implementation

Note: Lab 1: Spell Checking Using list will be used for the prerequisite assessment assessment.