Subject: Computer Science
Credit units: 3
Offered: Either Term 1 or Term 2
Weekly hours: 3 Lecture hours and 1.5 Practicum/Lab hours
College: Arts and Science
Department: Computer Science


This course builds on CMPT 141 by introducing additional problem solving methods and computer science principles, to solve larger problems that are more data intensive, or require more sophisticated techniques. These principles include data structures for efficient storage and retrieval of data, selection of appropriate data structures, algorithmic paradigms for solving difficult problems, and analysis of algorithms time and space requirements. This course also emphasizes fundamental principles of coding style, testing, and top-down design for writing robust, maintainable software.

Prerequisite(s):CMPT 141; or CMPT 111 and permission of the department.
Note:Students with credit for CMPT 270 cannot take CMPT 145 for credit.

Upcoming class offerings

For full details about upcoming courses, refer to the class search tool or, if you are a current student, the registration channel in PAWS.


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.

Once an instructor has made their syllabus publicly available on USask’s Learning Management System, it will appear below. Please note that the examples provided below 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. Unless otherwise specifically stated on the content, the copyright for all materials in each course belongs to the instructor whose name is associated with that course. The syllabus is the intellectual property of instructors or the university.

For more information, visit the Academic Courses Policy , the Syllabus page for instructors , or for students your Academic Advising office.