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

SWE 103: Discrete Mathematics for Software Engineers

Rigorous mathematical foundations underpinning computation, logic, and formal software verification. Covers propositional and predicate logic, Boolean algebra, set theory, formal proofs by induction, relations and functions, combinatorics, finite sta...

Instructor
Created by PAMCET Learning Team
beginner2 - 4 weeksEnglish

Course Overview

Rigorous mathematical foundations underpinning computation, logic, and formal software verification. Covers propositional and predicate logic, Boolean algebra, set theory, formal proofs by induction, relations and functions, combinatorics, finite sta... Curriculum Structure &...

What You'll Learn

  • Construct formal propositional and first-order predicate logic statements for software preconditions and postconditions.
  • Apply mathematical induction to prove the correctness and termination of recursive algorithms.
  • Model database relations, equivalence classes, and partial orderings using formal relation theory.
  • Represent software architectures, call graphs, and network topologies using graph theory.
  • Formulate finite state automata and regular grammars for compiler lexers and state machine design.

Requirements

  • Foundational academic standing in computing or science.

Degree Programme Curriculum Context

This course is a curriculum unit of the Bachelor of Engineering (B.Eng.) in Software 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~17 min read

Propositional Logic, Truth Tables & Logical Equivalences: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 1: Propositional Logic, Truth Tables & Logical Equivalences — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundations P...

Module 1 • Subtopic 1•13,891 characters of authentic academic content
Subtopic 2Document LectureOpen Access~10 min read

Propositional Logic, Truth Tables & Logical Equivalences: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 1: Propositional Logic, Truth Tables & Logical Equivalences — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Objective...

Module 1 • Subtopic 2•7,950 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 1: Propositional Logic, Truth Tables & Logical Equivalences — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Propositional Logic, Truth Tables & Logical Equivalences.

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

Predicate Calculus, Quantifiers & Formal Proof Systems: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 2: Predicate Calculus, Quantifiers & Formal Proof Systems — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundations Whi...

Module 2 • Subtopic 1•13,121 characters of authentic academic content
Subtopic 2Document LectureOpen Access~10 min read

Predicate Calculus, Quantifiers & Formal Proof Systems: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 2: Predicate Calculus, Quantifiers & Formal Proof Systems — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Objectives...

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

Chapter 2: Predicate Calculus, Quantifiers & Formal Proof Systems — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Predicate Calculus, Quantifiers & Formal Proof Systems.

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

Set Theory, Relations, Partitions & Functions: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 3: Set Theory, Relations, Partitions & Functions — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundations Set theory p...

Module 3 • Subtopic 1•13,023 characters of authentic academic content
Subtopic 2Document LectureOpen Access~11 min read

Set Theory, Relations, Partitions & Functions: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 3: Set Theory, Relations, Partitions & Functions — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Objectives Practical...

Module 3 • Subtopic 2•8,945 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 3: Set Theory, Relations, Partitions & Functions — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Set Theory, Relations, Partitions & Functions.

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

Methods of Proof: Direct, Contradiction & Mathematical Induction: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 4: Methods of Proof: Direct, Contradiction & Mathematical Induction — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Found...

Module 4 • Subtopic 1•14,528 characters of authentic academic content
Subtopic 2Document LectureOpen Access~9 min read

Methods of Proof: Direct, Contradiction & Mathematical Induction: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 4: Methods of Proof: Direct, Contradiction & Mathematical Induction — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational O...

Module 4 • Subtopic 2•7,145 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 4: Methods of Proof: Direct, Contradiction & Mathematical Induction — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Methods of Proof: Direct, Contradiction & Mathematical Induction.

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

Boolean Algebra, Logic Minimization & Karnaugh Maps: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 5: Boolean Algebra, Logic Minimization & Karnaugh Maps — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundations The sy...

Module 5 • Subtopic 1•15,473 characters of authentic academic content
Subtopic 2Document LectureOpen Access~9 min read

Boolean Algebra, Logic Minimization & Karnaugh Maps: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 5: Boolean Algebra, Logic Minimization & Karnaugh Maps — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Objectives Pra...

Module 5 • Subtopic 2•7,110 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 5: Boolean Algebra, Logic Minimization & Karnaugh Maps — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Boolean Algebra, Logic Minimization & Karnaugh Maps.

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

Combinatorics, Recurrence Relations & Generating Functions: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 6: Combinatorics, Recurrence Relations & Generating Functions — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundations...

Module 6 • Subtopic 1•15,465 characters of authentic academic content
Subtopic 2Document LectureOpen Access~9 min read

Combinatorics, Recurrence Relations & Generating Functions: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 6: Combinatorics, Recurrence Relations & Generating Functions — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Objecti...

Module 6 • Subtopic 2•7,131 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 6: Combinatorics, Recurrence Relations & Generating Functions — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Combinatorics, Recurrence Relations & Generating Functions.

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

Graph Theory: Trees, Cycles, Planarity & Network Flows: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 7: Graph Theory: Trees, Cycles, Planarity & Network Flows — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundations The...

Module 7 • Subtopic 1•14,355 characters of authentic academic content
Subtopic 2Document LectureOpen Access~9 min read

Graph Theory: Trees, Cycles, Planarity & Network Flows: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 7: Graph Theory: Trees, Cycles, Planarity & Network Flows — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Objectives...

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

Chapter 7: Graph Theory: Trees, Cycles, Planarity & Network Flows — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Graph Theory: Trees, Cycles, Planarity & Network Flows.

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

Finite State Automata, Regular Languages & Transition Systems: Theoretical Foundations, System Architecture & Subtopic Deep-Dive

SWE 103 • 100L • Mathematical Foundations Chapter 8: Finite State Automata, Regular Languages & Transition Systems — Theoretical Foundations, System Architecture & Analytical Modeling Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Benchmark: IEEE/ACM CS2023-MSF-DM 1. Executive Overview & Theoretical Foundati...

Module 8 • Subtopic 1•15,621 characters of authentic academic content
Subtopic 2Document LectureOpen Access~9 min read

Finite State Automata, Regular Languages & Transition Systems: Worked Engineering Problems, Production Code & Simulation Protocols

SWE 103 • 100L • Mathematical Foundations Chapter 8: Finite State Automata, Regular Languages & Transition Systems — Applied Engineering Computation, Production Systems & Verification Course: Discrete Mathematics for Software Engineers Curriculum: CCMAS-SWE-103 Accreditation: COREN-SWE-MTH-01 Standard: IEEE / ACM SE Practice Guidelines 1. Laboratory & Computational Obje...

Module 8 • Subtopic 2•7,136 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 8: Finite State Automata, Regular Languages & Transition Systems — Formative Engineering Quiz

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

Rigorous formative evaluation assessing theoretical knowledge, mathematical formulations, and engineering principles for Finite State Automata, Regular Languages & Transition Systems.

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
SWE 103: Discrete Mathematics for Software 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 - Software Engineering
Share On

Download Syllabus & Study Guide

Receive the full lecture syllabus, reading list, and milestone schedule for SWE 103: Discrete Mathematics for Software Engineers.

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

SWE 103: Discrete Mathematics for Software Engineers | PAMCET University — B.Eng | PAMCET