Scribd
Upload
39 views2 pages

Assignment 2 G102

This document contains an assignment for a digital design course. It has 6 questions related to simplifying Boolean functions using K-maps, sum-of-products and product-of-sums forms, designing logic circuits including a NAND diagram, 8-to-1 multiplexer, and BCD adder. Students must submit the soft copy of their assignment on the learning management system before the deadline of October 19, 2023. Late submissions will be penalized 10% of the total marks per day. The assignment is worth a total of 15 marks.

Uploaded by

mdmmm2008
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views2 pages

Assignment 2 G102

This document contains an assignment for a digital design course. It has 6 questions related to simplifying Boolean functions using K-maps, sum-of-products and product-of-sums forms, designing logic circuits including a NAND diagram, 8-to-1 multiplexer, and BCD adder. Students must submit the soft copy of their assignment on the learning management system before the deadline of October 19, 2023. Late submissions will be penalized 10% of the total marks per day. The assignment is worth a total of 15 marks.

Uploaded by

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

KINGDOM OF SAUDI ARABIA | JAZAN UNIVERSITY

COLLEGE OF COMPUTER SCIENCE & INFORMATION SYSTEMS


ASSIGNMENT- 2 (2023-24)
Academic Year 2023-24 Semester I
Course with code Digital Design, COMP-231 Section 102
Type of
Problem Marks 15
Assignment
Date of
05-10-2023 Deadline 19-10-2023
Announcement

ASSIGNMENT PROBLEM STATEMENT


Q1: Simplify the following Boolean functions, using k-variable maps:
(3 Marks)
(a) F(x, y, z) = ∑ (1, 2, 3, 5, 6, 7)
(b) F(x, y, z) = xʹy + yzʹ + yʹzʹ
(c) F(A, B, C, D) = ∑ (2, 3, 6, 7, 12, 13, 14)

Q2: Simplify the following Boolean function F, together with the don’t-care
conditions d, and then express the simplified function in sum-of-minterms form:
(4 Marks)
(a) F(x, y, z) = ∑ (0, 1, 4, 5, 6), d(x, y, z) = ∑ (2, 3, 7)
(b) F(A, B, C, D) = ∑ (0, 6, 8, 13, 14), d(A, B, C, D) = ∑ (2, 4, 10)

Q3: Draw a NAND logic diagram that implements the complement of the following
function (2 Marks)

F(A, B, C, D) = ∑ (0, 1, 2, 3, 6, 10, 11, 14)

Q4: Design and Implement 8-to-1 Multiplexer also write the truth table and boolean
function. (2 Marks)

Q5: Construct BCD adder with circuit diagram and explain the truth table
(2 Marks)
Q6:
(i) Express the following function as a sum of minterms and as a product of maxterms:

F(A, B, C, D) = BʹD + AʹD + BD (2 Marks)

(ii) Express the Boolean function F = xy + xʹz as a product of maxterms.


Important Instructions:
 Submit the soft copy of your assignment on Black Board.Do not submit the hard copy image.
 Make the Assignment Name like this (your ID.Assignment_1)
 Take proper care during submission of Assignment,submit it in proper group and proper
document.After the submission kindky check the document again.If you have submitted the
wrong document or in a wrong group immediately contact to me(Course Teacher).(via
Whatsapp)
 Submit the Assignment soft copy BEFORE 23:59hrs of the due date.
 If your submit your Assignment late.Each day 10% penalty will incur of the total marks
scored by the students.

Name of the Course teacher Mohammad Shahnawaz Nasir Signature

You might also like