Scribd
Upload
75 views4 pages

EE210 Assignment3 Solution

This document appears to be an assignment cover sheet for a digital logic systems course. It provides instructions for submitting assignment #3, which is due on March 21, 2021 and covers 7 problems related to simplifying and implementing Boolean logic functions using K-maps, sum-of-products, product-of-sums, and multi-level gate implementations using NAND and NOR gates. It also lists the course learning outcomes addressed by each problem.

Uploaded by

sarah alsh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
75 views4 pages

EE210 Assignment3 Solution

This document appears to be an assignment cover sheet for a digital logic systems course. It provides instructions for submitting assignment #3, which is due on March 21, 2021 and covers 7 problems related to simplifying and implementing Boolean logic functions using K-maps, sum-of-products, product-of-sums, and multi-level gate implementations using NAND and NOR gates. It also lists the course learning outcomes addressed by each problem.

Uploaded by

sarah alsh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 4

Alfaisal University - College of Engineering

Electrical Engineering Department


EE 210: Digital Logic Systems
Assignment #3
Spring 2021 - Due Date: March 21, 2021 at 11:59pm (midnight)

Student Name: SOLUTION

Student Number:

I declare that this submission is my own, and that no part of it has been copied from another source except
where properly acknowledged.
Student’s signature:_________________________

Follow the guidelines below in submitting your work.


1. Your homework should have this cover page duly filled out by you.
2. Where possible and applicable, your solution should be typed and printed.
3. Use white, preferably plain, A4-sized paper in your submission.
4. Start a new page for every new problem. However, more than one sub-problem (or short
problems) can be answered on the same sheet.
5. Arrange problems in the order they are assigned. Do not change problem numbers.
6. Show your work in an organized manner. Do not crowd your solution pages.
7. Elaborate on any assumptions made or shortcuts (jumps) taken in your solution.
8. Reference your figures, tables, constants, equations and conversions, used to complete the
problem.

Problem P1 P2 P3 P4 P5 P6 P7 Total
Mark
Maximum 10 10 10 10 10 10 10 70

Evaluator’s initials: _______________


Date: _______________

Course Learning Outcomes (CLO) Problems

Solve, with proper notation, and analyze digital logic systems using
CLO2 1
efficient and effective methods.
Model digital logic systems components, blocks and circuits, together
CLO3 6
with their behavior.
Design digital logic systems using gates and blocks (de/multiplexers,
CLO4 7
encoders/decoders, adders, latches, flip lops, registers, etc.)
Evaluate and validate the design and operation of digital logic
CLO5 2
systems.
Demonstrate knowledge of the mathematics and sciences required
CLO6 3
for digital logic systems.
Alfaisal University - College of Engineering
Electrical Engineering Department
EE 210: Digital Logic Systems
Assignment #3
Spring 2021 - Due Date: March 21, 2021 at 11:59pm (midnight)

Problem 1:
Simplify the following Boolean expressing using a three-variable K-map.
𝐹(𝑥, 𝑦, 𝑧) = 𝑥 ′ 𝑦𝑧 + 𝑥𝑧

Problems 2:
Simplify the following Boolean function using a four-variable K-map.
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = Σ(2, 3, 6, 7, 12, 13, 14)

Problem 3:
Simplify the following Boolean function using a four-variable K-map.
𝐹(𝑤, 𝑥, 𝑦, 𝑧) = Σ(1, 3, 5, 7, 9, 11, 13, 15)

Answer:

𝐹(𝑤, 𝑥, 𝑦, 𝑧) = z
Alfaisal University - College of Engineering
Electrical Engineering Department
EE 210: Digital Logic Systems
Assignment #3
Spring 2021 - Due Date: March 21, 2021 at 11:59pm (midnight)

Problem 4:
Simplify the following expression to minimal (1) sum-of-products; and (2) product-of-sums.
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝐵𝐷 ′ + 𝐴𝐵′ 𝐶𝐷 + 𝐴𝐶 ′ 𝐷 + 𝐵𝐶 ′

Problem 5:
Simplify the following Boolean function together with the don’t-care conditions, and then express the
simplified function in sum-of-minterms form.
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = Σ(5, 6, 7, 11, 14, 15)
𝑑(𝐴, 𝐵, 𝐶, 𝐷) = Σ(3, 9, 13)
Alfaisal University - College of Engineering
Electrical Engineering Department
EE 210: Digital Logic Systems
Assignment #3
Spring 2021 - Due Date: March 21, 2021 at 11:59pm (midnight)

Problem 6:
Simplify the following function and implement it with a two-level NAND gate circuit.
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = (𝐴′ + 𝐶 ′ + 𝐷′)(𝐴′ + 𝐶′)(𝐶 ′ + 𝐷′)

Problem 7:
Simplify the following function and implement it with a two-level NOR gate circuit.
𝐹(𝑥, 𝑦, 𝑧) = [(𝑥 + 𝑦)(𝑥 + 𝑧)]′

You might also like