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

Course Curriculum

Open-access academic curriculum. All foundational lectures available to read free.

8 Chapters
16 Lecture
24h
1. Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR): Theoretical Foundations, Mathematical Modeling & System Architecture

CPE 207 • 200 Level • Computer Engineering Chapter 1: Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR) — Theoretical Foundations, Mathematical Modeling & System Architecture Course: CPE 207: Digital Logic Design & Boolean Algebra Curriculum: NUC-CCMAS-CPE Accreditation: COREN-CPE-OBE Standard: IEEE/ACM-CE2024 1. Pedagogi...

2. Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR): Worked Engineering Problems, Design Computations & Simulation Protocols

CPE 207 • 200 Level • Computer Engineering Chapter 1: Boolean Algebra Axioms, De Morgan's Theorems, and Standard Logic Gates (AND, OR, NOT, NAND, NOR, XOR) — Worked Engineering Problems, Design Computations & Simulation Protocols Course: CPE 207: Digital Logic Design & Boolean Algebra Curriculum: NUC-CCMAS-CPE Accreditation: COREN-CPE-OBE Practice: COREN ERM / IEEE Design...

1 hour 30 minutes
3. Chapter 1 Formative Assessment: Boolean Algebra Axioms, De Morgan's Theorems, and Standard L

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

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