The primary focus of this course is the design and analysis of algorithms and abstract data types. To this end it introduces elementary data structures with related algorithms and their use in problem solving. The course also covers core computer science concepts such as abstraction, algorithm complexity, performance analysis and the tradeoffs between running time, storage size, clarity and extensibility that are at the core of software design. As a sequel to CSCI 135 it will also enhance your skills in C++ and Object Oriented Programming by introducing new tools such as Templates, Inheritance, Polymorphism, extend your understanding of pointers and dynamic memory allocation.
Lab 1001B – Drop-in Tutoring
Mo, Th – 11:00 – 5:00
We – 12:00 – 5:00
Tu, Fr – 1:00 – 5:00
Fridays 2-5 tutoring will be in Lab 1001C (one door down)