Scribd
Upload
14 views1 page

PDF Assignment 01

This document outlines Assignment #1 for the EE303 Digital System course, focusing on Boolean Algebra. It includes tasks such as simplifying expressions using theorems, drawing circuits with specific gates, finding complements using DeMorgan’s relationships, and reducing expressions to minimum sums of products. The assignment consists of seven distinct problems that require application of Boolean algebra principles.

Uploaded by

오영웅
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views1 page

PDF Assignment 01

This document outlines Assignment #1 for the EE303 Digital System course, focusing on Boolean Algebra. It includes tasks such as simplifying expressions using theorems, drawing circuits with specific gates, finding complements using DeMorgan’s relationships, and reducing expressions to minimum sums of products. The assignment consists of seven distinct problems that require application of Boolean algebra principles.

Uploaded by

오영웅
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

<2025 Spring: EE303 Digital System>

Assignment #1: Boolean Algebra

1. Simplify each of the following expressions by applying one of the theorems.


State the theorem used.

① A(C + D′B) + A′

② (A + BC) + (DE + F)(A + BC)′

2. Draw a circuit that uses only one AND gate and one OR gate to realize the
following function: (V + W + Y + Z)(U + W + Y + Z)(W + X + Y + Z)

3. Use only DeMorgan’s relationships and Involution to find the complements of


the following function: f(A, B, C, D) = AB′C + (A′ + B + D)(ABD′ + B′)

4. Reduce to a minimum sum of products in four terms:


(AÅBC) + BD + ACD

5. Simplify algebraically to a minimum sum of products (five terms):


(A + B′ + C + E′)(A + B′ + D′ + E)(B′ + C′ + D′ + E′)

6. Factor to obtain a product of sums (four terms):


K′M′N + KL′N′ + K′MN′ + LN

7. Find all possible terms that could be added to the expression using the
consensus theorem. Then reduce to a minimum sum of products:
A′C′D′ + BC′D + AB′C′ + A′BC

You might also like