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

From CompSciWiki
Jump to: navigation, search
 
Line 1: Line 1:
 +
{{Template:CSCourse
 +
|Overview='''COMP 1010''', or '''Introductory Computer Science 1''' is the introductory programming course offered at the University of Manitoba.  It is a prerequisite for further studies in Computer Science, Engineering, and some fields of Mathematics.
 +
|OfficialDescription= http://aurora.umanitoba.ca/banprod/bwckctlg.p_disp_course_detail?cat_term_in=201150&subj_code_in=COMP&crse_numb_in=2130
 +
|CourseHome= http://courses.cs.umanitoba.ca/index.aspx?sec=5478
 +
|Prerequisites= COMP 1020 (Introductory computer science 2), MATH 1210 or MATH 1300 (Linear algebra) and MATH 1500 (Calculus).
 +
|ParentPage= 2000-Level Courses
 +
|Overview = 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.
 +
 +
|OurThoughts= A really exciting course. Students explore logical statements and fun puzzles. A background in critical thinking is not required, but improves interest in the course.
 +
}}
 +
 
====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=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].
 
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].

Revision as of 11:22, 2 December 2010

Main_Page > Computer Science Courses > 2000-Level Courses


Overview

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. 

A really exciting course. Students explore logical statements and fun puzzles. A background in critical thinking is not required, but improves interest in the 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 1020 (Introductory computer science 2), MATH 1210 or MATH 1300 (Linear algebra) and MATH 1500 (Calculus).

Template loop detected:

Official Links

For an official course description refer to this link. For what is currently going on in the course, you can refer to this link.

Prerequisites

COMP 1020 (Introductory computer science 2), MATH 1210 or MATH 1300 (Linear algebra) and MATH 1500 (Calculus).

Course Overview

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.

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