Study.com Math 108 Answers & Help — Discrete Mathematics
The hardest course in the Study.com math catalog. FMMC covers it.
Study.com Math 108 Help — Discrete Mathematics
Seven High-difficulty chapters in eleven. No easy stretch to recover in. FMMC handles the whole course.
Quick Answer
Math 108: Discrete Mathematics (SDCM-0210) is a 3-credit, ACE-recommended Study.com course covering 11 chapters across logic, proofs, sets, combinatorics, probability, recursion, graph theory, trees, matrices, and Boolean algebra. There are no assignments — grading is 100 points from chapter tests and 200 points from the final exam. All assessments are open-book and unproctored. No prerequisites are formally required, though the course is designed for students with prior algebra experience and is taken primarily by CS and engineering majors.
What Math 108 Covers
Study.com’s Math 108 is a discrete mathematics course accepted at over 2,000 colleges for lower-division credit. It is taken primarily by students in computer science, computer engineering, and mathematics degree programs where discrete math is a required course — not a general education elective. The content is abstract and proof-oriented in a way that sets it apart from every other course in the Study.com math catalog.
The course runs 11 content chapters. Each ends with a 15-question chapter test — open-book, up to 3 attempts, highest score counts. Chapter tests account for 100 of the 300 total points. The remaining 200 points come from the 50-question cumulative final exam.
| Chapter | Topics | Difficulty |
|---|---|---|
| Ch 1: Logic & Proofs | Propositional logic, truth tables, logical equivalences, proof techniques | Medium |
| Ch 2: Sets & Functions | Set notation, operations, relations, functions, cardinality | Medium |
| Ch 3: Sequences, Sums & Induction | Arithmetic and geometric sequences, summation notation, mathematical induction | High |
| Ch 4: Counting, Combinations & Permutations | Multiplication rule, permutations, combinations, inclusion-exclusion | High |
| Ch 5: Discrete Probability | Sample spaces, events, probability rules, conditional probability | Medium |
| Ch 6: Binomial Probability | Binomial theorem, binomial distribution, expected value | High |
| Ch 7: Recursion & Advanced Counting | Recursive functions, recurrence relations, generating functions, divide-and-conquer | High |
| Ch 8: Graph Theory | Graph terminology, Euler and Hamiltonian circuits, directed graphs, graph coloring | High |
| Ch 9: Trees | Tree definitions, rooted trees, spanning trees, tree traversal algorithms | High |
| Ch 10: Matrices | Matrix operations, matrix multiplication, Boolean matrices, applications | Medium |
| Ch 11: Boolean Algebra & Logic Gates | Boolean expressions, simplification laws, logic gate circuits, Karnaugh maps | High |
Where Students Get Stuck
Discrete Mathematics is the hardest course in the Study.com math catalog. Seven of eleven chapters are High difficulty, and the four Medium chapters still require careful work. Students who approach this course the way they would College Algebra or Statistics find themselves in serious trouble.
Chapter 3 (Mathematical Induction) is where CS students encounter formal proof writing for the first time. The concept is not difficult to understand — prove a base case, assume it holds for n, show it holds for n+1 — but executing a complete, structured proof on a chapter test is a different skill. Students who understand the idea but have never written proofs struggle to produce the formal argument the test expects.
Chapter 4 (Counting, Combinations, Permutations) is the most consistently failed chapter test in the course. The formulas are straightforward to compute. The problem is recognizing which formula applies to a given word problem. Students who cannot reliably distinguish ordered from unordered selection burn all three attempts before realizing the issue is conceptual, not computational.
Chapters 7 through 9 are the hardest sustained block. Recursion (Ch 7) requires writing equations that describe how an algorithm calls itself — students who understand recursion conceptually from programming often still struggle to set up and solve recurrence relations algebraically. Graph theory (Ch 8) introduces Euler and Hamiltonian circuits, which students confuse despite having distinct definitions — Euler traverses every edge once, Hamiltonian visits every vertex once. Tree traversal (Ch 9) adds pre-order, in-order, and post-order algorithms that require executing step-by-step procedures precisely, a skill that benefits CS students far more than math-track students.
Chapter 11 (Boolean Algebra) closes the course at high difficulty. Simplifying Boolean expressions using algebraic laws, and translating between expressions and logic gate diagrams, requires fluency in a notation system most students have not seen before. Karnaugh maps appear on the final and require specific technique that does not develop from watching videos alone.
The grading math: average 60% on the seven High chapters and 90% on the four Medium ones — your chapter test average is 71 out of 100, and you need 139 out of 200 on the final to pass. That is 69.5% on a 50-question cumulative exam with almost no margin for error.
How FMMC Helps with Math 108
Discrete Mathematics requires a different kind of support than algebra or statistics — it is proof-based and algorithmic in ways that demand expertise in both mathematics and computer science. FMMC’s team covers discrete math at the level CS degree programs require.
Chapter Test Support
Expert guidance through all seven High-difficulty chapters before using your attempts. Induction, combinatorics, recursion, graph theory, trees, and Boolean algebra covered at depth.
Final Exam Preparation
Targeted review across all 11 chapters before your first or remaining attempts. In discrete math there are no safe skips on a cumulative final.
Full Course Completion
FMMC handles all 11 chapter tests and final exam prep. Most students finish within one billing cycle even on this demanding course.
Frequently Asked Questions
Need help with Study.com Discrete Mathematics?
Chapter tests, final exam prep, or full course completion — FMMC handles it. A/B grade guaranteed.
Also support students in traditional math courses and statistics courses.
There are many reasons why students need help with their coursework. In any case, it is never too late to ask for help. So, what are you waiting for? Let’s connect!