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.
CPE 213: Discrete Mathematics for Computer Engineers
Propositional/predicate logic, mathematical induction, relations, graph theory, combinatorics, and algebraic structures.
Course Overview
Propositional/predicate logic, mathematical induction, relations, graph theory, combinatorics, and algebraic structures. Curriculum Structure & Core Modules: • 1. Propositional Logic, Logical Equivalences, Predicates, and Quantifiers • 2. Rules of Inference and Formal Proof...
What You'll Learn
- Construct formal logic proofs using truth tables, natural deduction, and resolution theorem proving.
- Prove mathematical conjectures using strong mathematical induction and structural induction.
- Model binary relations, equivalence relations, partial orders, and lattices for database theory.
- Apply graph theory algorithms (Eulerian, Hamiltonian, planar graphs, coloring) to network topologies.
- Solve linear recurrence relations for algorithm computational complexity analysis.
Requirements
- Completion of CPE 101.
Degree Programme Curriculum Context
This course is a curriculum unit of the Bachelor of Engineering (B.Eng.) in Computer Engineering 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 Curriculum
Browse complete theoretical foundations, worked calculations, laboratory protocols, and board assessment questions under each topic.
Propositional Logic, Logical Equivalences, Predicates, and Quantifiers: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Propositional Logic, Logical Equivalences, Predicates, and Quantifiers: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 1 Formative Assessment: Propositional Logic, Logical Equivalences, Predicates, and Q
Rigorous formative competency assessment for Chapter 1: Propositional Logic, Logical Equivalences, Predicates, and Quantifiers. Aligned with NUC CCMAS and COREN OBE standards.
Rules of Inference and Formal Proof Methods: Direct, Contradiction, and Induction: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Rules of Inference and Formal Proof Methods: Direct, Contradiction, and Induction: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 2 Formative Assessment: Rules of Inference and Formal Proof Methods: Direct, Contrad
Rigorous formative competency assessment for Chapter 2: Rules of Inference and Formal Proof Methods: Direct, Contradiction, and Induction. Aligned with NUC CCMAS and COREN OBE standards.
Sets, Set Operations, Functions, Invertibility, and Cardinality of Sets: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Sets, Set Operations, Functions, Invertibility, and Cardinality of Sets: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 3 Formative Assessment: Sets, Set Operations, Functions, Invertibility, and Cardinal
Rigorous formative competency assessment for Chapter 3: Sets, Set Operations, Functions, Invertibility, and Cardinality of Sets. Aligned with NUC CCMAS and COREN OBE standards.
Relations: Equivalence Relations, Equivalence Classes, and Partial Orderings (Hasse Diagrams): Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Relations: Equivalence Relations, Equivalence Classes, and Partial Orderings (Hasse Diagrams): Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 4 Formative Assessment: Relations: Equivalence Relations, Equivalence Classes, and P
Rigorous formative competency assessment for Chapter 4: Relations: Equivalence Relations, Equivalence Classes, and Partial Orderings (Hasse Diagrams). Aligned with NUC CCMAS and COREN OBE standards.
Combinatorics: Permutations, Combinations, Pigeonhole Principle, and Binomial Theorem: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Combinatorics: Permutations, Combinations, Pigeonhole Principle, and Binomial Theorem: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 5 Formative Assessment: Combinatorics: Permutations, Combinations, Pigeonhole Princi
Rigorous formative competency assessment for Chapter 5: Combinatorics: Permutations, Combinations, Pigeonhole Principle, and Binomial Theorem. Aligned with NUC CCMAS and COREN OBE standards.
Recurrence Relations: Homogeneous and Non-Homogeneous Linear Recurrences: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Recurrence Relations: Homogeneous and Non-Homogeneous Linear Recurrences: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 6 Formative Assessment: Recurrence Relations: Homogeneous and Non-Homogeneous Linear
Rigorous formative competency assessment for Chapter 6: Recurrence Relations: Homogeneous and Non-Homogeneous Linear Recurrences. Aligned with NUC CCMAS and COREN OBE standards.
Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Trees, and Graph Coloring: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Trees, and Graph Coloring: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 7 Formative Assessment: Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Tr
Rigorous formative competency assessment for Chapter 7: Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Trees, and Graph Coloring. Aligned with NUC CCMAS and COREN OBE standards.
Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fields, and Cryptographic Applications: Theoretical Foundations, Modeling & Architecture
CPE 213 • 200L &b
Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fields, and Cryptographic Applications: Computations, Implementation & Verification
CPE 213 • 200L &b
Chapter 8 Formative Assessment: Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fi
Rigorous formative competency assessment for Chapter 8: Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fields, and Cryptographic Applications. Aligned with NUC CCMAS and COREN OBE standards.
Academic Ecosystem & Connected Pathways
Deepen your studies across connected learning pathways in the PAMCET academic network:
Instructor
PAMCET Learning Team
Institutional Course Curation · PAMCET
Qualifications:
PAMCET Learning Team — Institutional Course Curation, Digitpen Hub LtdMy Skills:
- Curriculum Curation
- Course Content Review
- Learning Outcome Design
- Course Publishing & Quality Assurance
- Platform Content Operations
Reviews
Course Includes
Download Syllabus & Study Guide
Receive the full lecture syllabus, reading list, and milestone schedule for CPE 213: Discrete Mathematics for Computer Engineers.
By submitting, you agree to receive educational updates. You can unsubscribe anytime. Read our Privacy Policy.

