## Monday, 19 November 2018

### CS302-DLD Assignment no. 1 Solution FALL 2018 Due date: 22 November, 2018 | SUPERSTARWEBTECH

Subject: CS302-Digital Logics and Design
Semester: FALL 2018
Assignment No. 1
Total Marks: 20
Due date: 22 November, 2018
 CS302-DLD Assignment no. 1 SOLUTION FALL 2018

CS302-Digital Logics and Design Assignment #Instructions

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 file is corrupt.
• Strict action will be taken if submitted solution is copied from any other student or from 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.

CS302-Digital Logics and Design Assignment #Topics Covered

Topics Covered:

· Number Systems
· Logic Gates
· Boolean Algebra
· Logic Simplification

CS302-Digital Logics and Design Assignment #Important Note

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 assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

If you people find any mistake or confusion in 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:

cs302@vu.edu.pk

CS302-Digital Logics and Design Assignment #Questions

Question no. 1: [Marks 5]

Perform the following operations with complete steps.
(725157)o + (F12ADE)h - (101101010101011111001110101)b - (9925)d

Question no. 2: [Marks 5]

Find the Gray Code of the following Hexadecimal Number.
(EAC129)h
Question no. 3: [Marks 10]
Simplify the following Boolean expression to a minimum number of literals with complete steps. State the property used in each step.
(A' + B' + E)(A'+C'+D)(C+D+E')(B'+D)(A+E)