Difference between revisions of "Discrete Mathematics for Computer Science (COMP 2130)"

From CompSciWiki
Jump to: navigation, search
 
 
(10 intermediate revisions by one other user not shown)
Line 1: Line 1:
−
====Official Links====
+
{{Template:1010Topic
−
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=2130 link]. For what is currently going on in the course, you can refer to this [http://courses.cs.umanitoba.ca/index.aspx?sec=5478 link].
+
|Chapter_TOC=[[Computer Science Courses]]
−
 
+
|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.
−
====Prerequisites====
+
|ByStudents= I really enjoyed this course. Students explore logical statements and fun puzzles. I found myself reading chapters in the textbook for fun and ended up moving at a faster pace than the class. A background in critical thinking is not required, but makes the course more interesting.
−
COMP 1020 (Introductory computer science 2), MATH 1210 or MATH 1300 (Linear algebra) and MATH 1500 (Calculus).
+
|Body=
−
 
+
===Prerequisites===
−
====Course Overview====
+
[[Introductory Computer Science 2 (COMP 1020)]]<br>
−
Discrete Mathematics involves the study of ideas that can be divided into separated or discontinuous parts. The purpose of this course is to prepare the students for understanding complex algorithm. You will study and describe computer algorithm and programming language mathematically using Discrete Mathematics theories in this course.
+
Linear Algebra (MATH 1300)<br>
 +
Calculus (Math 1500)
 +
===Course Homepage===
 +
[http://www.cs.umanitoba.ca/~comp2130/ cs homepage]
 +
===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]
 +
}}

Latest revision as of 08:24, 9 December 2010

COMP 1010 Home > Computer Science Courses


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

I really enjoyed this course. Students explore logical statements and fun puzzles. I found myself reading chapters in the textbook for fun and ended up moving at a faster pace than the class. 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)
Calculus (Math 1500)

Course Homepage

cs homepage

Official Description

Aurora

Retrieved from "https://hci.cs.umanitoba.ca/mediawiki/index.php?title=Discrete_Mathematics_for_Computer_Science_(COMP_2130)&oldid=14712"