For example, if a program is using a data structure such as a list, but this data structure only allows new items to be added at one end, the resulting store will comprise data that is not ordered.

Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

Examines several design issues, including selection of data structures based on operations to be optimized, algorithm encapsulation using classes and templates, and how and when to use recursion.