Scribd
Upload
34 views2 pages

Southern University Bangladesh: Department of Computer Science and Engineering

This document is a mid-term examination paper for the B.Sc. in Computer Science and Engineering program at Southern University Bangladesh, focusing on Digital Logic Design. It includes various questions on Boolean algebra, logic gates, and conversions between number systems. Students are required to attempt specific questions and perform calculations, simplifications, and verifications related to digital logic concepts.

Uploaded by

rafsanrahmanrumman
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
34 views2 pages

Southern University Bangladesh: Department of Computer Science and Engineering

This document is a mid-term examination paper for the B.Sc. in Computer Science and Engineering program at Southern University Bangladesh, focusing on Digital Logic Design. It includes various questions on Boolean algebra, logic gates, and conversions between number systems. Students are required to attempt specific questions and perform calculations, simplifications, and verifications related to digital logic concepts.

Uploaded by

rafsanrahmanrumman
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

SOUTHERN UNIVERSITY BANGLADESH

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING


Mid Term Examination, Spring 2026
Program: [Link]. in CSE
Semester: 2nd (B1)

Course Code: CSE 0714-125 Course Title: Digital Logic Design Credit: 3.00
Time: 1 hr. 30 mins. Marks: 30

Attempt any ONE from questions (1) and (2). Each question carries 10 marks.

1. a) Perform the following subtraction using 1’s complement: 2


10012 − 100012
b) Write the function stating De-Morgan’s law for three variables. 4
i. Verify the law using Truth Table.
ii. Draw the logic diagram.
iii. Find the complement of the function using ’DUALITY’.
c) Simplify the Boolean function, F (A, B, C, D) = AC 0 D0 + A0 C + ABC + AB 0 C + A0 C 0 D0
using K-Map in: 4
i. Sum of Product
ii. Product of Sum

Or

2. a) Perform the following subtraction using 2’s complement: 2


i. 100012 − 1012
b) Write the function stating Distributive law. 4
i. Verify the law using Truth Table.
ii. Draw the logic diagram.
iii. Find the complement of the function using ’DE-MORGAN’S LAW’.
P
c) Simplify the Boolean function, F (w, x, y, z) = (0, 1, 4, 5, 6, 10, 12) using K-Map in: 4
i. Sum of Product
ii. Product of Sum

Page 1 of 2

1
Answer any TWO from the three questions below. Each question carries 10 marks.

3. a) Do the following conversion: 6


i. 1001011.01012 = (?)10
ii. 750.058 = (?)16
iii. 150.5910 = (?)2
b) The state of a 12-bit register is 100010010111. What is its content if it represents, 4
i. Three decimal digits in BCD?
ii. Three decimal digits in the excess-3 code?
iii. Three decimal digits in the 84-2-1 code?
iv. A binary number?

4. a) Determine whether the following Boolean equation is true or false. 3


xy 0 + x0 z + x0 z 0 = x0 z 0 + y 0 z 0 + x0 z
b) Write the Boolean function, F = a0 b − ac0 + abc in the following forms: 5
i. Sum of MINTERMS
ii. Product of MAXTERMS
c) Convert each P of the following to the other canonical form: 2
i. F (x, y, z) = (1,Q 3, 5)
ii. F (A, B, C, D) = (3, 5, 8, 11)

5. a) Why NAND and NOR gates are called universal gates? Explain with diagram how these
gates replace the basic logic gates. 4
b) Simplify the following Boolean function F, together with the don’t-care condition, d (where
implementable):P 4
i. F (w, x, y, z) P
= (0, 1, 4, 5, 7, 10, 12)
d(w, x, y, z) = P(2, 3, 6, 15)
ii. F (x, y, z) = (0, 1, 3, 4, 5)
c) Implement the function, F (A, B, C) = AC 0 + A0 B + BC with NAND gates only. 2

Page 2 of 2

You might also like