Skip to main content
B.Eng DegreeFaculty of Faculty of Engineering & TechnologyComputer Engineering

CPE 213: Discrete Mathematics for Computer Engineers

Propositional/predicate logic, mathematical induction, relations, graph theory, combinatorics, and algebraic structures.

Instructor
Created by PAMCET Learning Team
beginner2 - 4 weeksEnglish

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-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
•
16 Lecture
•
24h
Subtopic 1Document LectureOpen Access~3 min read

Propositional Logic, Logical Equivalences, Predicates, and Quantifiers: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 1 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Propositional Logic, Logical Equivalences, Predicates, and Quantifiers: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 1 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 1 Formative Assessment: Propositional Logic, Logical Equivalences, Predicates, and Q

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

Rigorous formative competency assessment for Chapter 1: Propositional Logic, Logical Equivalences, Predicates, and Quantifiers. Aligned with NUC CCMAS and COREN OBE standards.

Module 1 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Rules of Inference and Formal Proof Methods: Direct, Contradiction, and Induction: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 2 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Rules of Inference and Formal Proof Methods: Direct, Contradiction, and Induction: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 2 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 2 Formative Assessment: Rules of Inference and Formal Proof Methods: Direct, Contrad

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

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.

Module 2 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Sets, Set Operations, Functions, Invertibility, and Cardinality of Sets: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 3 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Sets, Set Operations, Functions, Invertibility, and Cardinality of Sets: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 3 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 3 Formative Assessment: Sets, Set Operations, Functions, Invertibility, and Cardinal

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

Rigorous formative competency assessment for Chapter 3: Sets, Set Operations, Functions, Invertibility, and Cardinality of Sets. Aligned with NUC CCMAS and COREN OBE standards.

Module 3 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Relations: Equivalence Relations, Equivalence Classes, and Partial Orderings (Hasse Diagrams): Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 4 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Relations: Equivalence Relations, Equivalence Classes, and Partial Orderings (Hasse Diagrams): Computations, Implementation & Verification

CPE 213 • 200L &b

Module 4 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 4 Formative Assessment: Relations: Equivalence Relations, Equivalence Classes, and P

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

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.

Module 4 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Combinatorics: Permutations, Combinations, Pigeonhole Principle, and Binomial Theorem: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 5 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Combinatorics: Permutations, Combinations, Pigeonhole Principle, and Binomial Theorem: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 5 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 5 Formative Assessment: Combinatorics: Permutations, Combinations, Pigeonhole Princi

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

Rigorous formative competency assessment for Chapter 5: Combinatorics: Permutations, Combinations, Pigeonhole Principle, and Binomial Theorem. Aligned with NUC CCMAS and COREN OBE standards.

Module 5 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Recurrence Relations: Homogeneous and Non-Homogeneous Linear Recurrences: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 6 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Recurrence Relations: Homogeneous and Non-Homogeneous Linear Recurrences: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 6 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 6 Formative Assessment: Recurrence Relations: Homogeneous and Non-Homogeneous Linear

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

Rigorous formative competency assessment for Chapter 6: Recurrence Relations: Homogeneous and Non-Homogeneous Linear Recurrences. Aligned with NUC CCMAS and COREN OBE standards.

Module 6 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Trees, and Graph Coloring: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 7 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Trees, and Graph Coloring: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 7 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 7 Formative Assessment: Graph Theory Fundamentals: Paths, Cycles, Trees, Spanning Tr

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

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.

Module 7 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fields, and Cryptographic Applications: Theoretical Foundations, Modeling & Architecture

CPE 213 • 200L &b

Module 8 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fields, and Cryptographic Applications: Computations, Implementation & Verification

CPE 213 • 200L &b

Module 8 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 8 Formative Assessment: Algebraic Structures: Semigroups, Monoids, Groups, Rings, Fi

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

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.

Module 8 • Formative Assessment

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
CPE 213: Discrete Mathematics for Computer Engineers
Free$24.99100% Off
Certificate available separately for $7 after completion

Course Includes

8 Chapters
16 Lectures
2 - 4 weeks
Skill Level beginner
Taught in English
Lifetime Access
Certification of Completion
Category: University - Computer Engineering
Share On

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.

CPE 213: Discrete Mathematics for Computer Engineers | PAMCET University — B.Eng | PAMCET