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: | CS1150, CS2720, and MA1130 or MA1140 |
| Transfers To: |
University of Alberta University of Calgary University of Lethbridge Athabasca University Augustana Faculty, University of Alberta Concordia University College Grant MacEwan University King's University College |
| Time: | 15 Weeks, 60 Hours |
Timetable for CS2040
| Code | Sec | Dates | Instructor | Room | Days | Time | Cost | Add to Timetable |
|---|---|---|---|---|---|---|---|---|
| CS2040 |
 A2 |
Sep 4, 2014 to Dec 19, 2014 | Carlacci, Franco | E304 | W F | 13:00-14:20 | $398.40 |
|
| CS2040 |
L1 |
Sep 4, 2014 to Dec 19, 2014 | Carlacci, Franco | J101 | M | 12:00-12:50 |
|
Latest 10 Course Outlines for CS2040
| Code | Section | Instructor | Semester | Download |
|---|---|---|---|---|
| CS2040 | Carlacci F | Sep-Dec 2014 | CS2040_FCARLACCI_F2014-2014.pdf | |
| CS2040 | Carlacci F | Sep-Dec 2013 | CS2040_FCARLACCI_F2013-2013.pdf | |
| CS2040 | Carlacci F | Sep-Dec 2012 | CS2040_FCARLACCI_F2012-2012.pdf | |
| CS2040 | Carlacci F | Sep-Dec 2011 | CS2040_FCARLACCI_F2011-2011.pdf | |
| CS2040 | A2 | Gregg D | Sep-Dec 2010 | CS2040A2_DGREGG_F2010-2010.pdf |
| CS2040 | A3 | Gregg D | Jan-Apr 2010 | CS2040A3_DGREGG_W2010-2010.pdf |
| CS2040 | Gregg D | Jan-Apr 2009 | CS2040_DGREGG_W2009-2009.pdf | |
| CS2040 | Gregg D | Jan-Apr 2007 | CS2040_DGREGG_W2007-2007.pdf | |
| CS2040 | Ding G | Jan-Apr 2005 | CS2040_GDING_W2005-2005.pdf | |
| CS2040 | Ding G | Jan-Apr 2003 | CS2040_GDING_W2003-2003.pdf | |
| Find more course outlines for CS2040 ... | ||||