/ Assignment No. 02
Semester: Fall 2016
Digital Logic Design – CS302
Lectures: 1 to 16 / Total Marks: 20
Due Date: 5 Dec, 2016
Objectives:
Simplification of Boolean expressions through Karnaugh Map and Quine-McClusky method and Adders
Instructions:
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:
§  The assignment is submitted after due date.
§  The assignment is submitted via email.
§  The assignment is copied from Internet or from any other student.
§  The submitted assignment does not open or file is corrupt.
§  It is in some format other than .doc/docx.
Note: All types of plagiarism are strictly prohibited.
For any query about the assignment, contact at
Important!
You have to provide all the steps of processing in all questions otherwise, marks will be deducted. Pictures of hand written/drawn diagram will also be marked as ZERO. You have to use provided tool.
Question No. 01 10 Marks
This table of MinTerms represents Even Number Generator:
MinTerm / A / B / C / D
0 / 0 / 0 / 0 / 0
2 / 0 / 0 / 1 / 0
4 / 0 / 1 / 0 / 0
6 / 0 / 1 / 1 / 0
8 / 1 / 0 / 0 / 0
10 / 1 / 0 / 1 / 0
12 / 1 / 1 / 0 / 0
14 / 1 / 1 / 1 / 0
You have to write simplified Boolean Expression by using Quine-McCluskey method. You have to provide all steps included in the simplification procedure otherwise no marks will be awarded. If there are repeated groups, you also have to write those. It is recommended to use different colors for representation of each group clearly.
Question No. 02 10 Marks
Block Diagram of a 4 bit carry look ahead generator is provided to you below. You have to draw circuit diagram using given equations:


BEST OF LUCK