Scribd
Upload
22 views1 page

3-DLD Assignments - 3 B8

This assignment details for Digital Logic Design students includes: 1) Constructing truth tables and simplifying Boolean expressions using algebra 2) Converting expressions to sum-of-product form and developing truth tables 3) Converting product-of-sums expressions to minimum sum-of-product form using Karnaugh maps The assignment is due on September 12th, 2019 and is worth 10 total marks.

Uploaded by

sajid khalil
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
22 views1 page

3-DLD Assignments - 3 B8

This assignment details for Digital Logic Design students includes: 1) Constructing truth tables and simplifying Boolean expressions using algebra 2) Converting expressions to sum-of-product form and developing truth tables 3) Converting product-of-sums expressions to minimum sum-of-product form using Karnaugh maps The assignment is due on September 12th, 2019 and is worth 10 total marks.

Uploaded by

sajid khalil
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

Semester: Fall 2019 Digital Logic Design Batch/Session: 8th Section: All

ASSIGNMENT DETAIL

ASSIGNMENT No: 3
Total Marks CLO/PLO Issued Date Due Date & Time
10 09/12/2019

Assignment/Task:
Note: (Answer all the following questions in detail .Write all the answers by hand. No soft
copy is accepted)

Q1. Answer all the following questions

I. Construct a truth table for each of the following Boolean expressions:

II. Using Boolean algebra, simplify the following expressions:

III. Convert the following expressions to sum-of-product (SOP) forms:

IV. Develop a truth table for each of the SOP expressions:

V. Develop a truth table for each of the standard POS expressions

VI. Convert each of the following POS expressions to minimum SOP expressions using a
Karnaugh map:

You might also like