The course develops
students' ability to design, implement, and analyze fundamental data structures
used in computer science. Students will explore linear structures such as
arrays and linked lists, apply stack and queue operations to solve algorithmic
problems, and construct efficient solutions using hash tables with appropriate
collision resolution techniques. Additionally, students will differentiate and
implement hierarchical structures like trees and binary search trees, perform
various traversals, and evaluate expressions using binary expression trees.
Emphasis is placed on diagnosing implementation errors, evaluating time and
space complexities, and justifying data structure choices based on problem
requirements.
- Faculty: Kent Claire Apple Joy Pallomina