6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Learning Guide Unit 3

Site: University of the People Printed by: Waseem Saeed

Course: CS 1111-01 Introduction to computer Science - AY2025-T5 Date: Friday, 20 June 2025, 5:21 AM
Book: Learning Guide Unit 3

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 1/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Description

Learning Guide Unit 3

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 2/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Table of contents

Overview
Introduction
Reading Assignment
Assignment Activity
Self-Quiz
Graded Quiz
Checklist

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 3/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Overview

UNIT 3: Boolean Algebra and Logic Gates

Topics
Laws of Boolean Algebra: Commutative law, Associative law, Distributive law, AND law, OR law, INVERSION law
De Morgan's theorems
Gate representation and truth table: AND, OR, NOT, NAND, NOR
Equivalence of Boolean expressions

Learning Objectives
By the end of this Unit, you will be able to:

1. Utilize the laws of Boolean algebra to simplify complex Boolean expressions.

2. Explain the relationship between De Morgan's theorems and other Boolean algebra laws in solving logical problems.
3. Construct truth tables for different logic gates and combinations of gates.
4. Determine the equivalence of Boolean expressions using algebraic manipulation and truth tables.

Tasks
Read through the Learning Guide and the Reading Assignment.
Complete and submit the Assignment Activity.
Take and submit the Self-Quiz.
Take and submit the Graded Quiz.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 4/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Introduction

Welcome to Unit 3- Boolean Algebra and Logic Gates! In this unit, you will explore the fascinating world of Boolean algebra and logic
gates. These principles are essential for understanding how information is processed and manipulated in digital circuits.

You will explore the fundamental laws such as Commutative law, Associative law, Distributive law, AND law, OR law, and
INVERSION law. Understanding these laws is crucial for simplifying complex Boolean expressions. You will learn about De Morgan's
theorems, which provide powerful tools for manipulating complex Boolean expressions. These theorems play a key role in solving
logical problems and simplifying Boolean equations.

You will be introduced to different logic gates, including AND, OR, NOT, NAND, and NOR gates. Understanding their representations
and constructing truth tables for these gates will be a fundamental skill in this unit. You will also explore methods to determine the
equivalence of Boolean expressions. This involves both algebraic manipulation and the use of truth tables to establish the equality of
different logical expressions.

Consider answering the following questions:

1. What is the role of Logic Gates in building the circuits?

2. Describe how De Morgan's Theorems can be used to simplify a complex Boolean expression.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 5/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Reading Assignment

Reading Assignment:

As you read through the resources, consider the following:

How are Boolean expressions simplified using the Boolean algebra laws and theorems?
How are logic circuits generated using the various logic gates?

Textbook:

For Boolean Algebra, De Morgans Theorem and Logic Gates read:

1. Ndjountche, T. (2016). Digital electronics 1: Combinational logic circuits. John Wiley & Sons, Incorporated.

Log into the UoPeople library and go to LIRN. Click on Access to Library and Information Resource Network, go to
Computer Science and click on EBook Central. Search for the entire name of the ebook. Use the Learning Resource Center
to read on how to use the online library.
View the online book.
Read Chapter 2 Logic Gates (pp. 67 to pp 81)
Section 2.1: Introduction
Section 2.2: Logic Gates
Section 2.4: Logic function
Section 2.6: Boolean algebra

2. Westcott, S., & Westcott, J. R. (2020). Basic electronics: Theory and practice. Mercury Learning & Information.

Log into the UoPeople library and go to LIRN. Click on Access to Library and Information Resource Network, go to
Computer Science and click on EBook Central. Search for the entire name of the ebook. Use the Learning Resource Center to
read on how to use the online library.
View the online book.
Read Chapter 14 - Digital Theory (pp.171 to pp.181)

Through both the above readings (Number 1 and Number 2), you will learn the foundational concepts of Boolean algebra and Logic
Gates in digital computation. You will acquire a comprehensive understanding of Boolean expression simplification, truth tables and
logic circuit building and simplification. It will help you develop the skills to develop and design the logic circuits efficiently.

Video

For Laws of Boolean Algebra: Commutative law, Associative law, Distributive law, AND law, OR law, INVERSION law, watch:

1. ALL ABOUT ELECTRONICS. (2021, October 16). The laws of Boolean algebra explained [Video]. YouTube.

In this video, you will learn the fundamental laws of Boolean algebra, such as the commutative, associative, distributive, AND, OR,
and inversion laws. These laws form the foundation for simplifying and analyzing digital logic circuits.

The Laws of Boolean Algebra Explained

2. Read Electric Vehicle. (2024, April 24). Boolean algebra/Boolean laws/De Morgan’s Theorem [Video]. YouTube.

In this video, you will explore key Boolean laws and De Morgan’s theorems, learning how to apply these rules to simplify complex
logic expressions used in digital electronics and computer science.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 6/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Boolean algebra/Boolean laws/De Morgan's Theorem

For De Morgan's theorems, watch:

1. Neso Academy. (2021, September 15). De Morgan's Law in Boolean Algebra Explained [Video]. YouTube.

In this video, you will learn De Morgan’s Laws in Boolean algebra, understanding how to transform and simplify complex logic
expressions using these fundamental theorems. The explanation will help you apply these laws confidently in digital logic design.

De Morgan's Law in Boolean Algebra Explained (with Solve…

Solve…

2. ALL ABOUT ELECTRONICS. (2021b, October 23). De Morgan’s Law in Boolean Algebra Explained (with Solved Examples) [Video].
YouTube.

In this video, you will learn De Morgan’s Laws in Boolean algebra with detailed explanations and solved examples. This will help you
understand how to simplify complex logic expressions and apply these laws effectively in digital circuit analysis and design.

De Morgan's Law in Boolean Algebra Explained (with Solve…

Solve…

For Gate representation and truth table: AND, OR, NOT, NAND, NOR, watch:

1. ALL ABOUT ELECTRONICS. (2021a, September 29). What is Logic Gate? Logic Gates Explained [Video]. YouTube.

In this video, you will learn what logic gates are, their basic types like AND, OR, and NOT, and how they form the building blocks of
digital circuits by performing fundamental logical operations.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 7/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

What is Logic Gate ? Logic Gates Explained

2. Mr Bulmer's Learning Zone. (2024, September 6). Logic Gates and Truth Tables [Video]. YouTube.

In this video, you will learn how to interpret truth tables for various logic gates and understand the relationship between logic gate
inputs and outputs, which is key to designing and analyzing digital systems.

Logic Gates and Truth Tables - Step-by-Step Lesson from t…

t…

Optional:

1. Neso Academy. (2021, September 20). Logic Gates, Truth Tables, Boolean Algebra AND, OR, NOT, NAND & NOR [Video]. YouTube.

This video provides a comprehensive overview of logic gates, truth tables, and Boolean algebra, including detailed explanations of
AND, OR, NOT, NAND, and NOR gates, helping you deepen your understanding of digital logic design.

Logic Gates, Truth Tables, Boolean Algebra AND, OR, NOT, …

For Equivalence of Boolean expressions, watch:

1. Kazemi, S. (2020, May 5). AP CSA 3.6 Equivalent Boolean expressions - Explore [Video]. YouTube.

In this video, you will learn how to determine when two Boolean expressions are equivalent, using logical identities and
simplification techniques important for computer science and digital logic design.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 8/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

AP CSA 3.6 Equivalent Boolean Expressions - Explore

2. DrOfEng. (2024, October 4). Equivalence of Boolean expressions - Discrete mathematics [Video]. YouTube.

In this video, you will learn about the equivalence of Boolean expressions. You’ll see how to use algebraic rules and truth tables to
prove that different Boolean expressions represent the same logical function, a key skill in simplifying digital logic circuits.

Equivalence of Boolean Expressions - Discrete Mathematics

3. CodeHS. (2024, May 5). Equivalent Boolean Expressions [Video]. YouTube.

In this tutorial, you will explore practical examples of equivalent Boolean expressions and learn how to simplify and transform
logical formulas, which is essential for optimizing digital circuits and programming logic.

Equivalent Boolean Expressions

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 9/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Assignment Activity

Assignment Instructions

In this assignment, you will be able to examine and apply the basic concepts of Boolean Algebra and Logic Gates. The focus is on
applying Boolean algebra and logic gates to create efficient representations of conditions and actions. You are also expected to explain
the relationship between De Morgan's Theorems and other Boolean algebra laws. Additionally, you will design truth tables for specific
logical conditions, illustrating the system's behavior in response to different conditions. This assignment not only tests your technical
skills but also provides a practical application of theoretical concepts in the field of digital logic design.

Scenario:

Suppose you are interning at a university’s IT department, where you are assisting in developing a security access control system
for restricted labs. The access logic is based on three inputs:

I (ID Scanned): Whether the user has scanned a valid ID card

L (Lab Available): Whether the lab is available and not in use
A (Admin Override): Whether the admin has allowed manual access override

The current logic expression that unlocks the lab door is: (I · A) + (L′· A)

Your task is to analyse, simplify, and implement this expression.

Based on above scenario answer the following questions:

1. Simplify the given Boolean expression (I·A) + (L′·A) using Boolean algebra laws. Clearly show each step and name the laws applied.
2. Apply De Morgan’s Theorem to the term L′· A. Explain how De Morgan’s laws relate to other Boolean laws and how they are helpful
in implementing logical expressions.
3. Use the simplified expression A· (I + L′) to:
a. Draw a logic gate diagram using AND, OR, and NOT gates
b. Construct a truth table for all possible input combinations
4. Construct truth tables for both the original expression (I · A) + (L′· A) and the simplified expression A· (I + L′). Compare the outputs
and verify that they are logically equivalent.

Submission Guidelines

Submission must include your answers, explanations, and any relevant diagrams.
Clearly label each task and subtask.
Provide step-by-step explanations for your Boolean algebra simplifications and applications of De Morgan's Theorems.
Include the truth tables with appropriate headings.

Submission Instructions

Read the rubric on how you are going to be graded before you start to work on this assignment.
Your assignment should be a minimum of 500 words and not more than 750 words (not including the reference list or the title);
double-spaced in Times New Roman font, which is no greater than 12 points in size.
You can submit your assignment in a Word document format.
Use in-text citations to properly attribute information, ideas, or quotes that are not your own. Format your references according to
APA guidelines. For assistance with APA formatting, view the Learning Resource Center: Academic Writing.
You can read more information about how to evaluate Information and its sources critically in the C.R.A.A.P (Currency, Relevance,
Authority, Accuracy, and Purpose) handout or the C.R.A.A.P PDF brochure.

This assignment will be assessed by your instructor using the rubric below.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 10/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Self-Quiz

The Self-Quiz gives you an opportunity to self-assess your knowledge of what you have learned so far.

The results of the Self-Quiz do not count towards your final grade. However,the quiz is an important part of the University’s learning
process and it is expected that you will take it to ensure understanding of the materials presented. Reviewing and analyzing your results
will help you perform better on future Graded Quizzes and the Final Exam.

Please access the Self-Quiz on the main course homepage; it is listed inside the Unit.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 11/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Graded Quiz

The Graded Quiz will test your knowledge of all the materials learned thus far. The results of the quiz will count towards your final
grade.

Please access the Graded Quiz on the main course homepage; it will be listed inside the Unit. After you click on it, the quiz’s introduction
will inform you of any time or attempt limits in place.

Good luck!

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 12/13
6/20/25, 3:21 PM Learning Guide Unit 3 | Home

Checklist

Read through the Learning Guide and the Reading Assignment.

Complete and submit the Assignment Activity.

Take and submit the Self-Quiz.

Take and submit the Graded Quiz.

https://my.uopeople.edu/mod/book/tool/print/index.php?id=472738 13/13