Discrete Mathematics for Computer Science (COMP 2130)
Main_Page > Computer Science Courses > 2000-Level Courses
|
OverviewDiscrete 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 InformationFor more information on this course please visit Aurora or look up this course here. CAUTION: |
|
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.
