Skip to main content
B.Sc. DegreeFaculty of Faculty of Computing & Information TechnologyComputer Science

Discrete Mathematics

Master Discrete Mathematics in University - Computer Science with this structured course, covering 8 modules and practice assessments.

Instructor
Created by PAMCET Learning Team
intermediate1 weekEnglish

Course Overview

Master Discrete Mathematics in University - Computer Science with this structured course, covering 8 modules and practice assessments. Curriculum Structure & Core Modules: • 1. Mathematical Logic, Propositional Calculus, and Automated Reasoning • 2. Proof Techniques,...

What You'll Learn

  • Understand and apply the principles of Set Theory and Relations
  • Work confidently through Functions and Their Properties and its practical applications
  • Analyse real-world scenarios involving Mathematical Induction and Recursion
  • Develop applied skills in Graph Theory
  • Critically evaluate approaches to Trees in Discrete Mathematics

Requirements

  • A foundational understanding of University - Computer Science concepts, from an introductory course or equivalent experience
  • A computer, tablet or smartphone with a stable internet connection
  • Willingness to commit regular study time to complete lessons, quizzes and assignments

Degree Programme Curriculum Context

This course is a curriculum unit of the B.Sc. Computer Science degree framework in Nigeria.

Earn Your Certificate

Showcase your skills with a certificate! Complete the course, submit your project, and earn your certificate. Here's a sample of what you'll receive to show off your accomplishments.

course-certificate
Lecture Board & Syllabus

Course Curriculum

Browse complete theoretical foundations, worked calculations, laboratory protocols, and board assessment questions under each topic.

Launch Course Reader →
8 Chapters
•
24 Lecture
•
0s
Subtopic 1Document Lecture

Propositional Logic: Syntax, Semantics, Truth Tables, and Logical Equivalences

Sign in or enroll to access the full lecture notes and interactive reader.

Module 1 • Subtopic 1
Subtopic 2Document Lecture

Predicate Calculus, First-Order Logic, Nested Quantifiers, and Semantic Models

Sign in or enroll to access the full lecture notes and interactive reader.

Module 1 • Subtopic 2
Subtopic 3Document Lecture

Rules of Inference, Natural Deduction, Resolution Refutation, and SAT Solvers in Formal Verification

Sign in or enroll to access the full lecture notes and interactive reader.

Module 1 • Subtopic 3
Subtopic 1Document Lecture

Direct Proof, Contraposition, Proof by Contradiction, and Counterexamples

Sign in or enroll to access the full lecture notes and interactive reader.

Module 2 • Subtopic 1
Subtopic 2Document Lecture

Mathematical Induction, Strong Induction, and the Well-Ordering Principle

Sign in or enroll to access the full lecture notes and interactive reader.

Module 2 • Subtopic 2
Subtopic 3Document Lecture

Structural Induction and Invariant Proofs for Iterative Loops and Recursive Algorithms

Sign in or enroll to access the full lecture notes and interactive reader.

Module 2 • Subtopic 3
Subtopic 1Document Lecture

Sets, Power Sets, Cardinality of Infinite Sets, and Cantor's Diagonal Argument

Sign in or enroll to access the full lecture notes and interactive reader.

Module 3 • Subtopic 1
Subtopic 2Document Lecture

Binary Relations, Equivalence Relations, and Quotient Sets in Relational Database Theory

Sign in or enroll to access the full lecture notes and interactive reader.

Module 3 • Subtopic 2
Subtopic 3Document Lecture

Partial Orders, Total Orders, Well-Founded Sets, Hasse Diagrams, and Lattices

Sign in or enroll to access the full lecture notes and interactive reader.

Module 3 • Subtopic 3
Subtopic 1Document Lecture

Injective, Surjective, and Bijective Functions, Function Composition, and Inverse Mappings

Sign in or enroll to access the full lecture notes and interactive reader.

Module 4 • Subtopic 1
Formative Assessment10 Points • 15 Mins

Mid-Course Progress Assessment

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Test your knowledge of Graph Theory

Module 4 • Formative Assessment
Subtopic 3Document Lecture

Asymptotic Notation: Big-O, Big-Omega, Big-Theta, and Little-o Growth Analysis

Sign in or enroll to access the full lecture notes and interactive reader.

Module 4 • Subtopic 3
Subtopic 4Document Lecture

Pigeonhole Principle and Generalized Ramsey Theory in Hashing and Algorithmic Bounds

Sign in or enroll to access the full lecture notes and interactive reader.

Module 4 • Subtopic 4
Subtopic 1Document Lecture

Basic Counting Principles, Permutations, Combinations, and the Binomial Theorem

Sign in or enroll to access the full lecture notes and interactive reader.

Module 5 • Subtopic 1
Subtopic 2Document Lecture

Advanced Combinatorics: Inclusion-Exclusion, Stirling Numbers, and Integer Partitions

Sign in or enroll to access the full lecture notes and interactive reader.

Module 5 • Subtopic 2
Subtopic 3Document Lecture

Ordinary and Exponential Generating Functions for Discrete Combinatorial Structures

Sign in or enroll to access the full lecture notes and interactive reader.

Module 5 • Subtopic 3
Subtopic 4Open Access~3 min read

Mid-Semester Case Study & Research Paper

Sign in or enroll to access the full lecture notes and interactive reader.

Module 5 • Subtopic 4•108 characters of authentic academic content
Subtopic 1Document Lecture

Linear Homogeneous Recurrence Relations with Constant Coefficients

Sign in or enroll to access the full lecture notes and interactive reader.

Module 6 • Subtopic 1
Subtopic 2Document Lecture

Non-Homogeneous Recurrence Relations and Annihilator Operator Methods

Sign in or enroll to access the full lecture notes and interactive reader.

Module 6 • Subtopic 2
Subtopic 3Document Lecture

Divide-and-Conquer Recurrences, Master Theorem, and Akra-Bazzi Method

Sign in or enroll to access the full lecture notes and interactive reader.

Module 6 • Subtopic 3
Subtopic 1Document Lecture

Graph Fundamentals: Degree Sum Formula, Bipartite Graphs, Subgraphs, and Isomorphism

Sign in or enroll to access the full lecture notes and interactive reader.

Module 7 • Subtopic 1
Subtopic 2Document Lecture

Eulerian Paths, Hamiltonian Cycles, Graph Traversals, and Network Flow Topologies

Sign in or enroll to access the full lecture notes and interactive reader.

Module 7 • Subtopic 2
Subtopic 3Document Lecture

Graph Coloring, Chromatic Numbers, Planarity, Euler's Characteristic, and Kuratowski's Theorem

Sign in or enroll to access the full lecture notes and interactive reader.

Module 7 • Subtopic 3
Subtopic 1Document Lecture

Tree Properties, Spanning Trees, Cayley's Formula, and Huffman Encoding

Sign in or enroll to access the full lecture notes and interactive reader.

Module 8 • Subtopic 1
Formative Assessment10 Points • 15 Mins

Comprehensive End-of-Course Examination

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Test your knowledge of Recurrence Relations

Module 8 • Formative Assessment
Subtopic 3Document Lecture

Algebraic Structures: Semigroups, Monoids, Groups, Cosets, and Lagrange's Theorem

Sign in or enroll to access the full lecture notes and interactive reader.

Module 8 • Subtopic 3
Subtopic 4Document Lecture

Rings, Fields, Modular Arithmetic, Polynomial Rings, and Cryptographic Foundations

Sign in or enroll to access the full lecture notes and interactive reader.

Module 8 • Subtopic 4

Instructor

PAMCET Learning Team

PAMCET Learning Team

Institutional Course Curation · PAMCET

The PAMCET Learning Team is the institutional curriculum and content group behind course publishing on this platform. PAMCET (Professional and Academic Management Centre for Education and Training) is operated by Digitpen Hub Ltd, a company registered in Lagos, Nigeria. Courses credited to the PAMCET Learning Team are structured, organized, and published centrally by the platform rather than authored by a single named individual instructor — each course's syllabus, learning outcomes, and content are reviewed before publication under this institutional account. For questions about a specific course or to report a content issue, please use the platform's Help & Support or Contact Us pages.

Qualifications:

PAMCET Learning Team — Institutional Course Curation, Digitpen Hub Ltd

My Skills:

  • Curriculum Curation
  • Course Content Review
  • Learning Outcome Design
  • Course Publishing & Quality Assurance
  • Platform Content Operations

Reviews

No reviews available
Discrete Mathematics
Free$24.99100% Off
Certificate available separately for $7 after completion

Course Includes

8 Chapters
24 Lectures
1 week
Skill Level intermediate
Taught in English
Lifetime Access
Certification of Completion
Category: University - Computer Science
Share On

Download Syllabus & Study Guide

Receive the full lecture syllabus, reading list, and milestone schedule for Discrete Mathematics.

By submitting, you agree to receive educational updates. You can unsubscribe anytime. Read our Privacy Policy.