Difference between revisions of "Analysis of Algorithms (COMP 2080)"
From CompSciWiki
(changed prerequisite list format) |
|||
| Line 4: | Line 4: | ||
|Body= | |Body= | ||
===Prerequisites=== | ===Prerequisites=== | ||
| − | [[Discrete Mathematics for Computer Science (COMP 2130)]] | + | [[Discrete Mathematics for Computer Science (COMP 2130)]], [[Data Structures and Algorithms (COMP 2140)]] |
| − | [[Data Structures and Algorithms (COMP 2140)]] | + | |
===Course Homepage=== | ===Course Homepage=== | ||
[http://www.cs.umanitoba.ca/~comp2080 cs homepage] | [http://www.cs.umanitoba.ca/~comp2080 cs homepage] | ||
Revision as of 22:06, 2 December 2010
COMP 1010 Home > Back to Chapter Topics
|
IntroductionProblem solving can be complicated. This course is essential to gain the necessary problem solving skills for advance Computer Science study. Analysis of Algorithms introduces various approaches for analyzing and evaluating commonly used algorithms when solving computing problems. |
...By StudentsThis is a tough one. You will become quite familiar with math terms such as induction. Highly recommended that students have a decent mathematical background prior to taking this course. If not, don't be alarmed because practice makes perfect and in the end you would at least be able to bump up your program's speed. |
|---|
Prerequisites
Discrete Mathematics for Computer Science (COMP 2130), Data Structures and Algorithms (COMP 2140)
