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

From CompSciWiki
Jump to: navigation, search
Line 5: Line 5:
 
|Prerequisites= COMP 2130 (Discrete math), COMP 2140 (Data structures and Algorithms).
 
|Prerequisites= COMP 2130 (Discrete math), COMP 2140 (Data structures and Algorithms).
 
|ParentPage= 2000-Level Courses
 
|ParentPage= 2000-Level Courses
−
|Overview = This is an introductory programming course. You will learn fundamental programming concepts such as: [[Glossary#control_statement|control statements]], [[Glossary#for_loop|for loops]] and [[Glossary#array|arrays]], how to write a program using Java, and how to set up a computer to run your program. The purpose of this course is to help students that do not have any programming experience to get started in writing computer programs. Hence, no computer programming knowledge is required prior taking this course.
+
|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= Textpad is the recommended tool for programming on a Windows machine.
+
|OurThoughts= Highly recommended that students have a decent mathematical background prior to taking this course.
 +
 
 
}}
 
}}
  
Line 12: Line 13:
 
====Official Links====
 
====Official Links====
 
For an official course description refer to this [http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2080 link].
 
For an official course description refer to this [http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2080 link].
−
 
−
====Prerequisites====
 
−
COMP 2130 (Discrete math), COMP 2140 (Data structures and Algorithms).
 
−
 
−
====Course 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.
 
−
Highly recommended that students have a decent mathematical background prior to taking this course.
 

Revision as of 11:07, 2 December 2010

Main_Page > Computer Science Courses > 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. 

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





Further Information

For more information on this course please visit Aurora or look up this course here.

CAUTION:
Please make sure you have completed the required prerequisites (minimum grade of C):
COMP 2130 (Discrete math), COMP 2140 (Data structures and Algorithms).

Template loop detected:


Official Links

For an official course description refer to this link.

Retrieved from "https://hci.cs.umanitoba.ca/mediawiki/index.php?title=Analysis_of_Algorithms_(COMP_2080)&oldid=13836"