Difference between revisions of "Analysis of Algorithms (COMP 2080)"

From CompSciWiki
Jump to: navigation, search
Line 9: Line 9:
 
===Official Description===
 
===Official Description===
 
[http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2080 Aurora]
 
[http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2080 Aurora]
}}
 
 
 
 
 
 
{{Template:CSCourse
 
|OfficialDescription= http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2080
 
|CourseHome= http://www.cs.umanitoba.ca/~comp2080
 
|Prerequisites= COMP 2130 (Discrete math), COMP 2140 (Data structures and Algorithms).
 
|ParentPage= 2000-Level Courses
 
|Overview = Problem 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.
 
|OurThoughts= Highly recommended that students have a decent mathematical background prior to taking this course.
 
 
 
}}
 
}}

Revision as of 19:35, 2 December 2010

COMP 1010 Home > Back to Chapter Topics


Introduction

Problem 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 Students

Highly recommended that students have a decent mathematical background prior to taking this course.

Prerequisites

Discrete Mathematics for Computer Science (COMP 2130), Data Structures and Algorithms (COMP 2140)

Course Homepage

COMP 2080

Official Description

Aurora