CSC 236 Data Structures

Prerequisite: CSC 226 with a grade of C or higher

This course continues the study of software design and implementation from an object-oriented perspective. The design and implementation of software is fundamentally about tradeoffs between how fast our code runs and the amount of memory it consumes while running. We will explore the common structure used to represent data (queues, lists, trees, and hash tables, to name a few), the design tradeoffs we must make when choosing between them, and the experimental analysis of our algorithms and structures as expressed in code.

Credits

1 Course Credit