Scribd
Upload
8K views

cs302 Assignment 2 Solution

The document provides instructions for Assignment #02 in the course Digital Logic Design (CS302). It outlines the rules for marking, topics covered, and notes regarding submission format and deadlines. Students are asked to generate the generalized sum of products (SOP) expression and simplify a Boolean expression using Karnaugh map for Question 1 worth 20 marks. The solution provided generates the SOP expression by expanding each term and combines like terms, then simplifies the expression into a grouped form using four variables.

Uploaded by

Zoha Sheikh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8K views

cs302 Assignment 2 Solution

The document provides instructions for Assignment #02 in the course Digital Logic Design (CS302). It outlines the rules for marking, topics covered, and notes regarding submission format and deadlines. Students are asked to generate the generalized sum of products (SOP) expression and simplify a Boolean expression using Karnaugh map for Question 1 worth 20 marks. The solution provided generates the SOP expression by expanding each term and combines like terms, then simplifies the expression into a grouped form using four variables.

Uploaded by

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

Digital Logic Design (CS302) Total marks = 20

Assignment # 02
Fall 2020 Deadline
W S STUDIO 16 December 2020
MUHAMMAD WAJID

Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING


It should be clear that your assignment would not get any credit if:
 The assignment is submitted after the due date.
 The submitted assignment does not open or the file is corrupt.
 Strict action will be taken if the submitted solution is copied from any other
student or the internet.

You should concern the recommended books to clarify your concepts as handouts are not
sufficient.

You are supposed to submit your assignment in Doc or Docx format.


Any other formats like Scan Images, Pdf, Zip, Rar, Ppt and Bmp, etc will not be accepted.

Topic Covered:
 Boolean Algebra Simplification & Laws
 Karnaugh Map Simplification Methods

Lecture # 08 till Lecture # 14

NOTE
No assignment will be accepted after the due date via email in any case (whether it is the
case of load shedding or internet malfunctioning etc.). Hence refrain from uploading
assignments in the last hour of the deadline. It is recommended to upload the solution file
at least two days before its closing date.

If you people find any mistake or confusion in the assignment (Question statement),
please consult with your instructor before the deadline. After the deadline, no queries
will be entertained in this regard.

For any query, feel free to email at:


[email protected]

Questions No 01 Marks (20)


Consider the following Boolean expression having 5 (Five) variables:
ABD+ AB D́ É+ BC D́+CDE+ Á BCE+ A B́ É+ AB D́
 Generate the generalized SOP (Min-Term) expression.
 Simplify the SOP expression using Karnaugh Map Simplification Method.
SOLUTION;

Part 1
Generate the Generalized SOP (min term) Expression.
Total 7 Terms:
ABD+ AB D́ É+ BC D́+CDE+ Á BCE+ A B́ É+ AB D́

1st Term ABD => ABCD + ABC'D => ABCDE + ABCDE' + ABC'DE + ABC'DE'

2nd term ABD'E' => ABCD'E' + ABC'D’E'

3rd term BCD' => ABCD' + A'BCD' => ABCD'E + ABCD'E' + A'BCD'E + A'BCD'E'

4th term CDE => ACDE + A'CDE => ABCDE + AB'CDE + A'BCDE + A'B'CDE

5th term A'BCD => A'BCDE + A'BCD'E

6th term AB'E' => AB'CE' + AB'C'E' => AB'CDE' + AB'CD'E' + AB'C'DE' + AB'C’D'E'

7th term ABD' => ABCD' + ABC'D’ => ABCD'E + ABCD'E ‘+ ABC'D'E + ABC'D’E'

Now Add All Terms;


ABCDE + ABCDE' + ABC'DE + ABC'DE'+ ABCD'E' + ABC'D’E'+ ABCD'E + ABCD'E' +
A'BCD'E + A'BCD'E'+ ABCDE + AB'CDE + A'BCDE + A'B'CDE+ A'BCDE + A'BCD'E+
AB'CDE' + AB'CD'E' + AB'C'DE' + AB'C’D'E'+ ABCD'E + ABCD'E ‘+ ABC'D'E + ABC'D’E'
Part 2

Grouping Now;
F= AE' + ABE + BCD'+CDE
F= AE' + ABE + BCD'+CDE

You might also like