CS 2040 - Algorithms I
Course Description
Help with Course Description CS 2040 - Algorithms I 3 (3-0-1) UT | |
---|---|
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. |
Prerequisite: |
|
Transfers To: |
Refer to the Transfer Alberta website for up to date information. |
Time: | 15 Weeks, 60 Hours |
Timetable for CS2040
Code | Sec | Dates | Instructor | Room | Days | Time | Cost | Add to Timetable |
---|---|---|---|---|---|---|---|---|
CS2040 | A2 |
Sep 5, 2023 to Dec 21, 2023 On-Campus (Attend On-Campus, In-Person) |
Yehoshyna, Hanna | G111 | W | 16:30-17:50 | $572.32 | |
G111 | F | 10:00-11:20 | ||||||
CS2040 | L1 |
Sep 5, 2023 to Dec 21, 2023 On-Campus (Attend On-Campus, In-Person) |
Yehoshyna, Hanna | G111 | F | 11:30-12:20 |
Latest 10 Course Outlines for CS2040
Code | Section | Instructor | Semester | Download |
---|---|---|---|---|
CS2040 | A2 | Yehoshyna H | Sep-Dec 2023 | |
CS2040 | A2 | Carlacci F | Sep-Dec 2022 | |
CS2040 | A2 | Abbasi U | Sep-Dec 2021 | |
CS2040 | A2 | Abbasi U | Sep-Dec 2020 | |
CS2040 | A2 | Abbasi U | Sep-Dec 2019 | |
CS2040 | Carlacci F | Sep-Dec 2014 | ||
CS2040 | Carlacci F | Sep-Dec 2013 | ||
CS2040 | Carlacci F | Sep-Dec 2012 | ||
CS2040 | Carlacci F | Sep-Dec 2011 | ||
CS2040 | A3 | Gregg D | Jan-Apr 2010 | |
Find more course outlines for CS2040 ... |