CPSC 1160: Algorithms and Data Structures I
| Course Format | Lecture 4.0 h + Seminar 0.0 h + Lab. 2.0 h |
| Credits | 3.0 |
Course Description
Students focus on practicing and developing programing skills. Students implement algorithms along with appropriate data structures to produce good software. Students apply recursion, abstract data types, algorithm analysis, sorting and searching algorithms, pointers, arrays, dynamic memory management, linked lists, stacks, and queues. Students also learn about low-level data representations and systematic software development. As a tool, object-oriented programming is introduced.
Prerequisite(s): A minimum "C" grade in 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 »