Scribd
Upload
597 views2 pages

Spring 2024 - CS302P - 1 - SOL

The document provides instructions for a digital logic design assignment asking students to simplify Boolean expressions and submit the simplified expressions and equivalent NAND-based circuits. It covers topics from weeks 3 and 4 including digital logic circuit analysis, converting Boolean expressions to circuits, Boolean algebra, and simplifying Boolean expressions.

Uploaded by

Haseeb Chaudhary
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
597 views2 pages

Spring 2024 - CS302P - 1 - SOL

The document provides instructions for a digital logic design assignment asking students to simplify Boolean expressions and submit the simplified expressions and equivalent NAND-based circuits. It covers topics from weeks 3 and 4 including digital logic circuit analysis, converting Boolean expressions to circuits, Boolean algebra, and simplifying Boolean expressions.

Uploaded by

Haseeb Chaudhary
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/ 2

Digital Logic Design Practicals (CS302P) Total marks = 20

Assignment # 01 Deadline
st
1 of May 2024
Spring 2024

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 corrupted.
 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 insufficient.
You are supposed to submit your assignment in Doc or Docx format.
Any other formats like scanned images, PDF, ZIP, RAR, PPT, BMP, etc. will not be accepted.

Topic Covered:
The objective of this assignment is to assess the understanding of students about:
 Lab Work - Week # 03 - Digital logic circuits analysis and converting Boolean expressions to
digital circuits
 Lab Work - Week # 04 - Boolean Algebra and Simplification of Boolean Expressions

Topic Covered
Lab Experiment # 01 to Lab Experiment # 04

NOTE

No assignment will be accepted via email after the due date (whether it is due to load shedding, internet
malfunctioning, etc.). Hence, refrain from uploading assignments within the last hour of the deadline. It is
recommended that the solution be uploaded at least two days before its closing date.

If you find any mistakes or confusion in the assignment (Question statement), please consult 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:


CS302P@vu.edu.pk
Question No 01 Marks (20)
Simplify the Boolean Expression using Logic Converter in Electronic WorkBench. Submit the simplified
Boolean Expression as well as the NAND-based Simplified circuit diagram.
' ' ' ' ' ' ' ' ' '
A B C H + E F G H + AC E FG +G H + E F GH
SOLUTION
Simplified Boolean Expression:
A ' B' CH ' + E ' F ' GH + E ' FG ' + ACE ' F+G ' H '

NAND -based Simplified Circuit Diagram:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy