CPSC
1160
Algorithms and Data Structures I
Lecture Hours
4.0
Seminar Hours
0.0
Lab Hours
2.0
Credits
3.0
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.
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 Sections
Campus: Main Campus, Course Number: 20052, Instructor ID: 90338656
Campus: Main Campus, Course Number: 20051, Instructor ID: 90504628
Campus: Main Campus, Course Number: 20053, Instructor ID: 90485939
Campus: Main Campus, Course Number: 20729, Instructor ID: 90588720
Online Course
Off
Preparatory Course
Off