CMPS 2020 — Programming II: Data Structures & Algorithms
Catalog description: Builds on the foundation provided by CMPS 2010 to introduce the fundamental concepts of data structures and algorithms that proceed from within the framework of object-oriented programming technology. Topics include: recursion, fundamental data structures (including lists, stacks, queues, hash tables, trees and graphs) and basics of algorithmic analysis. Necessary components of object-oriented programming method will be introduced. Each week lecture meets for 150 minutes and lab meets for 150 minutes.
Requisite(s): Prerequisite: CMPS 2010 with a grade of C- or better and MATH 1030 or 1040 or 1050 or 1055 or 1060 or 2310 or 2510 with a grade of C- or better.
When
Tue/Thu
Lecture: 5.30pm - 6.45pm
Lab: 7.00pm - 8.15pm
Where
Sci 3, Room 315
Syllabus will be available closer to the start of the semester.