Scribd
Upload
2 views1 page

DECO Assignment 1

The document is an assignment for BCA II Semester focusing on Digital Electronics & Computer Organization. It includes questions on logic gates, universal gates, number conversions, de-Morgan’s theorems, Boolean identities, simplification of Boolean expressions, and minimization using K-maps. The assignment requires students to prove theorems, reduce expressions, and implement functions with logic gates.

Uploaded by

raviranjanhelpfree
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
2 views1 page

DECO Assignment 1

The document is an assignment for BCA II Semester focusing on Digital Electronics & Computer Organization. It includes questions on logic gates, universal gates, number conversions, de-Morgan’s theorems, Boolean identities, simplification of Boolean expressions, and minimization using K-maps. The assignment requires students to prove theorems, reduce expressions, and implement functions with logic gates.

Uploaded by

raviranjanhelpfree
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

BCA II Semester (Session 2024-25)

ASSIGNMENT- 1 UNIT-1
SUBJECT: Digital Electronics & Computer Organization (COURSE III/BCA-204)

What do you mean by logic gates? Give a brief account of OR, AND, NAND, XOR and
1 XNOR logic gates.
What do you mean by universal gates? Show that NAND and NOR gates are universal gates.
2
Convert decimal to binary i) 23 ii) 120
3 Convert binary to decimal i) 1100111 ii) 101101 iii) 101101.111
State and prove de-Morgan’s theorems.
4
Prove the Boolean identity
5 i) (A+B)(A+C)= A+BC
ii) A+ĀB =A+B
Reduce the following Boolean expressions
i) F= AB+ABC+ ĀB+AˉC
6. ii) F= (X + Z)(X + XZ’) + XY + Y
iii) F= A’(A + BC) + (AC + B’C)
iv) F(X, Y, Z) = X′Y + YZ′ + YZ + XY′Z′
Show that AB’C+B+BD’+ABD’+A’C= B+C
7.
Simplify the Boolean expression 𝑌 = 𝐴̅𝐵̅𝐶̅ + 𝐴̅ 𝐵𝐶̅ + 𝐴𝐵̅𝐶̅ + 𝐴𝐵𝐶̅ and describe the logic
8. circuit.
A four variable function is given as f (A,B,C,D) = Ʃ m(0,2,3,4,5,7,9,13,15) use a K-map to
9. minimize the function.
Simplify the function using k-map and implement using minimum number of
10. logic gates. f = Ʃ m (2,9,10,12,13) + D (15,14)
Minimize the Boolean function using K-Map f (A,B,C,D) = Ʃ m(0,3,6,7,9,13,14,15).
11.
Using K-map realize the following expression by minimum no. of gates.
12. 𝑌 = 𝐴̅𝐵̅ 𝐶̅ 𝐷 + 𝐴̅𝐵̅ 𝐶𝐷 + 𝐴̅𝐵𝐶̅ 𝐷
̅ + 𝐴̅𝐵𝐶𝐷 + 𝐴̅𝐵𝐶̅ 𝐷 + 𝐴𝐵̅𝐶̅ 𝐷 + 𝐴𝐵̅𝐶𝐷 + 𝐴𝐵𝐶̅ 𝐷 + 𝐴𝐵𝐶𝐷

You might also like