CSSE 230 - Data Structures and Algorithm Analysis
- Credit Hours: 3R-3L-4C
- Term Available: F,W,S
- Prerequisites: MA 112 - Calculus II, and either CSSE 220 - Object-Oriented Software Development or CSSE 221 - Fundamentals of Software Development Honors with a grade of C or better
- Corequisites: None
This course reinforces and extends students’ ability to independently design, develop, and debug object-oriented software that uses correct, clear, and efficient algorithms and data structures. Students study and implement classical data structures such as list, stack, queue, tree, priority queue, hash table, graph, set, and dictionary. Formal efficiency analysis is used to evaluate the complexity of algorithms for these data structures. Students gain proficiency in writing recursive methods. Students design and implement software individually, in small groups, and in a challenging multi-week team project.