Difference between revisions of "Discrete Mathematics for Computer Science (COMP 2130)"
From CompSciWiki
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=2130 Aurora] | [http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2130 Aurora] | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
}} | }} |
Revision as of 21: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 StudentsA really exciting course. Students explore logical statements and fun puzzles. A background in critical thinking is not required, but makes the course more interesting. |
---|
Prerequisites
Introductory Computer Science 2 (COMP 1020), Linear Algebra (MATH 1300), and Calculus (Math 1500)