Credit units: 3
Offered: Term 2 only
Weekly hours: 3 Lecture hours and 1.5 Practicum/Lab hours
College: Arts and Science
Department: Computer Science
Continues the development of programming skills started in CMPT 116, with an emphasis on object-oriented programming. Data structures for the storage and efficient retrieval of information will be studied and analyzed, in particular stacks, queues, linked lists and simple binary trees. Examples and exercises will be drawn from engineering applications and numerical methods.
Restriction(s): Restricted to students in College of Arts and Science and College of Engineering.
Prerequisite(s): CMPT 116, or a grade of at least 75% in CMPT 113 and permission of the instructor.
Note: Students can have credit for at most one of CMPT 117 and 115. Students may not take CMPT 100, 102, 106, 120 or 175 for credit concurrently with or after CMPT 117.
Upcoming class offerings
Examples of current or recently-offered class syllabus material can be found on the Open CourseWare website.
The syllabus is a public document that provides detail about a class, such as the schedule of activities, learning outcomes, and weighting of assignments and examinations. Please note that the examples provided in Open CourseWare do not represent a complete set of current or previous syllabus material. Rather, they are presented solely for the purpose of indicating what may be required for a given class.
For more information about syllabi, visit the Academic Courses Policy.