Discrete Mathematics
Earn college credit with Discrete Mathematics—a self-paced online course covering logic, sets, functions, proof ideas, counting, graphs, and foundational concepts for computer science. Complete short lessons, quizzes, and assignments on your schedule, then finish with a proctored final exam. Ideal for CS/math requirements and transfer credit, with transcript options.
UPI Study offers 70+ affordable online college courses Business, Computer Science, Natural Sciences, Psychology, English, Math & More. Earn transferable college credit through UPI Study for elective or primary requirements.
Over 48750 students have already transferred credits to over 1750 universities till 2026 via ACE & NCCRS Credit Accreditation.
Upon the successful completion of this course, students will be able to: apply discrete mathematical concepts essential for advanced mathematical reasoning and problem-solving; construct logical proofs, including identifying fallacies, manipulating logical connectors, and interpreting conditional statements; apply set theory, functions, sequences, and series to solve counting problems and analyze probabilistic scenarios; solve recursive solutions to advanced counting problems and combinatorial scenarios, utilizing techniques such as generating functions and the inclusion-exclusion principle; evaluate core principles in graph theory, including graph properties, algorithms, and their practical applications in computer science and engineering; and design and optimize circuits in digital electronics and computer science using tree structures, matrices, and Boolean Algebra.
Learn more about Discrete Mathematics
Learning Outcomes
Upon the successful completion of this course, students will be able to: apply discrete mathematical concepts essential for advanced mathematical reasoning and problem-solving; construct logical proofs, including identifying fallacies, manipulating logical connectors, and interpreting conditional statements; apply set theory, functions, sequences, and series to solve counting problems and analyze probabilistic scenarios; solve recursive solutions to advanced counting problems and combinatorial scenarios, utilizing techniques such as generating functions and the inclusion-exclusion principle; evaluate core principles in graph theory, including graph properties, algorithms, and their practical applications in computer science and engineering; and design and optimize circuits in digital electronics and computer science using tree structures, matrices, and Boolean Algebra.
Major Course Topics
Major topics include fundamentals of mathematical logic and proof techniques; fundamentals of sets and functions in discrete Mathematics; sequences, series, and mathematical induction; counting principles and combinatorial analysis; discrete probability and expected values; binomial probability analysis; recursive methods and advanced counting techniques; fundamentals of graph theory; fundamentals of trees in discrete Mathematics; fundamentals of matrices in discrete Mathematics; and Boolean algebra and logic circuits.