CS2040 - Course Description
|
CS2040 - 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: |
- Complete the following:
- CS1150 - Elementary Data Structures (3)
- CS2720 - Formal Systems and Logic in Computing Science (3)
- MA1130 - Elementary Calculus I (3)
|
| Transfers To: |
Refer to the Transfer Alberta website for up to date information.
|
| Time: |
60 Hours |
