Description The first course of a two course sequence on algorithm design and analysis stream, with the emphasis on the fundamentals such as searching, sorting and graph algorithms. Examples include divide and conquer, dynamic programming, greedy method, backtracking, and local search methods. Analysis techniques will be developed to aid in judging program efficiency. Requisites Complete the following:CS1150 - Elementary Data Structures (3)CS2720 - Formal Systems and Logic in Computing Science (3)MA1130 - Elementary Calculus I (3) Course Timetable A3 Tue, Thu from 11:30 to 12:50 Jan 6 2026 - Apr 23 2026 Grande Prairie Campus Room G112 Instructor MMirbagheri Open: 3 of 20 spots filled Add to timetable add L1 Mon from 13:00 to 13:50 Jan 6 2026 - Apr 23 2026 Grande Prairie Campus Room G112 Instructor MMirbagheri Open: 3 of 20 spots filled Add to timetable add Course Outlines Find out everything you need to know about your upcoming or past courses. Understand the learning outcomes, evaluation methods, delivery mode, and prerequisites. A2 Sep 2023 - Dec,2023 Yehoshyna H Course Outline PDF download A2 Sep 2022 - Dec,2022 Carlacci F Course Outline PDF download View all historical course outlines
Related Programs Find your fit with career-focused education and practical connections at every step. Explore All Programs