Discrete Mathematics for Computer Science (COMP 2130)

COMP 1010 Home > Back to Chapter Topics

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 A 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) Course Homepage cs homepage Official Description Aurora

{{{Body}}}

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).