CPSC 1160: Algorithms and Data Structures I

« Back to Course Listing

Course Format Lecture 4.0 h + Seminar 0.0 h + Lab. 2.0 h
Credits 3.0

Course Description

Covers low-level operations, recursion, systematic software development, abstract data types, creation of libraries of reusable routines, sorting and searching algorithms, efficiency, algorithm analysis, pointers, arrays, dynamic memory management, linked lists, stacks, queues, introduction to hashing, binary trees and tree traversals, and advanced data manipulation. Object-oriented programming will be introduced.

Prerequisite(s): A minimum "C" grade in one of CPSC 1150 or 1155; and one of the following: a minimum "B" grade in Precalculus 12; or a minimum "C" grade in MATH 1170, 1171, 1173, or 1174; or a minimum "C+" in Precalculus 12 and a minimum "C-" grade in Calculus 12; or MDT 85. Prerequisites are valid for only three years.

Course Attributes (New Window)

Check course schedule availability » Check if this course is Transferable »
Check Bookstore for required textbooks »

Course Outline