Discrete Mathematics for Computer Science (COMP 2130)
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 StudentsThis is a tough one. You will become quite familiar with math terms such as induction. Highly recommended that students have a decent mathematical background prior to taking this course. If not, don't be alarmed because practice makes perfect and in the end you would at least be able to bump up your program's speed. |
---|
Prerequisites
Introductory Computer Science 2 (COMP 1020), Linear Algebra (MATH 1300), and Calculus (Math 1500)
Course Homepage
Official Description
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 A really exciting course. Students explore logical statements and fun puzzles. A background in critical thinking is not required,
|
||
Contents
|
Further InformationFor more information on this course please visit Aurora or look up this course here. CAUTION: |
Template loop detected: