
(see top of "General" section)
- Docente: Suzanne Lindell
- Docente: David Wonnacott
An introduction to the fundamental data structures of computer science: strings, lists, stacks, queues, trees, BSTs, graphs, sets, and their accompanying algorithms. Principles of algorithmic analysis and object reasoning and design will be introduced using mathematical techniques for both complexity and correctness. The course will also cover more practical issues, such as memory management and hashing. The programming language used to illustrate and implement these concepts will be able to support functional, imperative, and object-oriented approaches.
Prerequisites: ((CS H105 OR BMC equivalent) AND ≥ 2.0) OR (Placement AND instructor consent)
Prerequisites: ((CS H105 OR BMC equivalent) AND ≥ 2.0) OR (Placement AND instructor consent)
- Docente: John Dougherty
- Docente: Michael Wehar