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

CPE 207: Digital Logic Design & Boolean Algebra

Boolean algebra, logic gates, Karnaugh maps, Quine-McCluskey, combinational MSI circuits, adders, and multiplexers.

Instructor
Created by PAMCET Learning Team
beginner2 - 4 weeksEnglish

Course Overview

Boolean algebra, logic gates, Karnaugh maps, Quine-McCluskey, combinational MSI circuits, adders, and multiplexers. Curriculum Structure & Core Modules: • 1. Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR) • 2. Universal...

What You'll Learn

  • Minimize complex Boolean functions into canonical SOP and POS forms using Karnaugh maps and Quine-McCluskey.
  • Design combinational arithmetic logic blocks including half/full adders, subtractors, and lookahead carry adders.
  • Synthesize multiplexers, demultiplexers, decoders, priority encoders, and code converters.
  • Analyze propagation delays, dynamic hazards, static hazards, and fan-out constraints in logic networks.
  • Simulate and verify combinational logic circuits using digital logic simulators (Logisim, Digital, ModelSim).

Requirements

  • Completion of CPE 111.

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

Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR): Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR): Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 1 Formative Assessment: Boolean Algebra Axioms, De Morgan's Theorems, and Standard L

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

Rigorous formative competency assessment for Chapter 1: Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR). Aligned with NUC CCMAS and COREN OBE standards.

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

Universal Logic Property of NAND and NOR Gates and Multilevel Gate Networks: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Universal Logic Property of NAND and NOR Gates and Multilevel Gate Networks: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 2 Formative Assessment: Universal Logic Property of NAND and NOR Gates and Multileve

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

Rigorous formative competency assessment for Chapter 2: Universal Logic Property of NAND and NOR Gates and Multilevel Gate Networks. Aligned with NUC CCMAS and COREN OBE standards.

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

Canonical SOP and POS Forms, Min-terms, and Max-terms Formulation: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Canonical SOP and POS Forms, Min-terms, and Max-terms Formulation: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 3 Formative Assessment: Canonical SOP and POS Forms, Min-terms, and Max-terms Formul

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

Rigorous formative competency assessment for Chapter 3: Canonical SOP and POS Forms, Min-terms, and Max-terms Formulation. Aligned with NUC CCMAS and COREN OBE standards.

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

Karnaugh Map Minimization (2, 3, 4, and 5 Variables) with Don't-Care Conditions: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Karnaugh Map Minimization (2, 3, 4, and 5 Variables) with Don't-Care Conditions: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 4 Formative Assessment: Karnaugh Map Minimization (2, 3, 4, and 5 Variables) with Do

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

Rigorous formative competency assessment for Chapter 4: Karnaugh Map Minimization (2, 3, 4, and 5 Variables) with Don't-Care Conditions. Aligned with NUC CCMAS and COREN OBE standards.

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

The Quine-McCluskey Tabular Minimization Algorithm for High-Variable Functions: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

The Quine-McCluskey Tabular Minimization Algorithm for High-Variable Functions: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 5 Formative Assessment: The Quine-McCluskey Tabular Minimization Algorithm for High-

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

Rigorous formative competency assessment for Chapter 5: The Quine-McCluskey Tabular Minimization Algorithm for High-Variable Functions. Aligned with NUC CCMAS and COREN OBE standards.

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

Combinational Arithmetic Blocks: Adders, Subtractors, Carry-Lookahead, and Multipliers: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Combinational Arithmetic Blocks: Adders, Subtractors, Carry-Lookahead, and Multipliers: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 6 Formative Assessment: Combinational Arithmetic Blocks: Adders, Subtractors, Carry-

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

Rigorous formative competency assessment for Chapter 6: Combinational Arithmetic Blocks: Adders, Subtractors, Carry-Lookahead, and Multipliers. Aligned with NUC CCMAS and COREN OBE standards.

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

Medium-Scale Integration (MSI) Circuits: MUX, DEMUX, Decoders, and Priority Encoders: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Medium-Scale Integration (MSI) Circuits: MUX, DEMUX, Decoders, and Priority Encoders: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 7 Formative Assessment: Medium-Scale Integration (MSI) Circuits: MUX, DEMUX, Decoder

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

Rigorous formative competency assessment for Chapter 7: Medium-Scale Integration (MSI) Circuits: MUX, DEMUX, Decoders, and Priority Encoders. Aligned with NUC CCMAS and COREN OBE standards.

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

Logic Circuit Timing Analysis: Gate Propagation Delays, Glitches, and Hazards: Theoretical Foundations, Modeling & Architecture

CPE 207 • 200L &b

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

Logic Circuit Timing Analysis: Gate Propagation Delays, Glitches, and Hazards: Computations, Implementation & Verification

CPE 207 • 200L &b

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

Chapter 8 Formative Assessment: Logic Circuit Timing Analysis: Gate Propagation Delays, Glit

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

Rigorous formative competency assessment for Chapter 8: Logic Circuit Timing Analysis: Gate Propagation Delays, Glitches, and Hazards. 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 207: Digital Logic Design & Boolean Algebra
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 207: Digital Logic Design & Boolean Algebra.

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

CPE 207: Digital Logic Design & Boolean Algebra | PAMCET University — B.Eng | PAMCET