You need to take any one of COMP283/MATH381/STOR315 regardless of if you are a BS/BA/Minor in CS. The courses are mathematical/theory-based.
The stuff you learn in these courses will be useful for COMP455 and COMP550.
COMP283
This course is the Computer Science version of Discrete Math. Many students find this course difficult. Some students say that this is their favorite course. Some students say that this is the hardest course they took. Start studying early and start homework/assignments early. You would need to study for many hours and practice many questions every day, you will probably need to spend a lot of time at office hours.
The usual content is
- Logic
- Set Theory
- Counting
- Relations
- Functions
- Recursion
- Proofs
- Mathematical Induction
- Graphs and Trees
Different Professors teach similar content with minor differences.
Textbook- Professor Jack Snoeyink has his own textbook (I am a big fan of this book).
- Discrete Mathematics and its Applications by Kenneth H. Rosen
- Discrete Mathematics by Kenneth A. Ross
Professor Alyssa Lytle has a video playlist on COMP283.
Another video playlist.
MATH381
Math majors/minors are required to take this course. Many students also find this to be a hard course.
The contents are similar to COMP283 with some differences.
Textbook- Discrete Matehmatics and its Applications by Kenneth H. Rosen
- Discrete Mathematics by Kenneth A. Ross
STOR315
This is the STOR version of Discrete Math. If you are a STOR major, you should take this course.
Which is easier of the three?
I have heard varying views from students, where they say one is easier than the other.
But to
be
honest,
this
may be a difficult course whichever professor you take it with.
Check the Study Strategy.