Scribd
Upload
47 views

Fall 2022 - CS302 - 1

The document provides instructions for Assignment #01 for the course Digital Logic Design (CS302). It details rules for marking such as the assignment must be submitted by the deadline and in the correct file format. It also lists the topics covered in Lectures 1 through 14 including number systems, logic gates, Boolean algebra, and Karnaugh maps. Students are asked to simplify a 5 variable Boolean expression using the Quine-McCluskey method with specified don't care conditions.

Uploaded by

Noob Master69
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views

Fall 2022 - CS302 - 1

The document provides instructions for Assignment #01 for the course Digital Logic Design (CS302). It details rules for marking such as the assignment must be submitted by the deadline and in the correct file format. It also lists the topics covered in Lectures 1 through 14 including number systems, logic gates, Boolean algebra, and Karnaugh maps. Students are asked to simplify a 5 variable Boolean expression using the Quine-McCluskey method with specified don't care conditions.

Uploaded by

Noob Master69
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Digital Logic Design (CS302) Total marks = 20

Assignment # 01 Deadline
th
5 of December, 2022
Fall 2022

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 consult 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, BMP, etc. will not be accepted.

Topic Covered:
 Number Systems
 Logic Gates
 Boolean Algebra
 K-Maps

Lecture # 01 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 me at:


[email protected]
Question No 01 Marks (20)
Simplify the stated 5 Variable Boolean Expression using the Quine-McCluskey method.
F ( A , B ,C , D , E )=∑ (0,1,2,5,7,8,11,12,17,18,21,25,26,29,30,31)

With the following Don’t Care Conditions

F ( A , B ,C , D , E )=∑ (3 , 9 , 14 , 15 ,23 , 27)

You might also like