Students will understand data structures and develop skills to design and analyze software algorithms. This course is designed for students with foundational programming knowledge. Topics include arrays, trees, dictionaries, sorting, searching, recursion, and graph traversal. Emphasis will be placed on understanding algorithmic efficiency, Big-O notation, and performance trade-offs, equipping students to write efficient code for complex problem-solving. Prerequisites: 110, MATH-261.