Scribd
Upload
66 views1 page

DCF Assignment

This document contains 20 questions related to digital logic circuits and Boolean algebra. The questions cover topics such as binary, octal, and hexadecimal number systems; Boolean operations and functions; logic gates; Karnaugh maps; error detection codes; canonical forms; and one's and two's complements. Respondents are asked to write notes, convert numbers between number systems, perform Boolean operations, simplify logical expressions, realize logic circuits, and compare number representation methods.

Uploaded by

rans_11
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
66 views1 page

DCF Assignment

This document contains 20 questions related to digital logic circuits and Boolean algebra. The questions cover topics such as binary, octal, and hexadecimal number systems; Boolean operations and functions; logic gates; Karnaugh maps; error detection codes; canonical forms; and one's and two's complements. Respondents are asked to write notes, convert numbers between number systems, perform Boolean operations, simplify logical expressions, realize logic circuits, and compare number representation methods.

Uploaded by

rans_11
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/ 1

DCF ASSIGNMENT-2019

1. Write a short notes on the following:


(a) Complements
(b) Duality
(c) Word
(d) BCD
(e) EBCDIC
2.Convert the following numbers from the given base to the bases indicated:
(a) (37.2)10=(?)2
(b) (11.71865)10=(?)8
(c) (476.27)8=(?)16
(d) (A09.26)16=(?)2
(e) (14.71865)10=(?)2
(f) (1847)8 = (?)16
(g) (76234.3216)8=(?)2
3. Write down the steps required to subtract two n-digits positive numbers M and N in base r along
with example.
4.Explain Boolean operations and Boolean functions. What is a Truth table?
5.Draw the block diagram of a 3-input XOR gate and give its Truth table.
6.Demonstrate by means of a truth table the validity of the following:
(a) The associative laws
(b) De Morgan’s theorem for three variables
(c) The distributive law of (+) over (.)
7. What are Error-Detection codes? Discuss briefly.
8.Simplify the following boolean functions to a minimum number of literals:
(a) y(wz’ + wz) + xy
(b) BC + AC’ + AB + BCD
9.What is canonical form of logic expressions? Define
(a) SOP
(b) POS
10.Draw K-map and simplify the following boolean functions:
(a) A’B’C’D’ + A’B’C’D + A’B’CD + A’B’CD’
(b) Y(A,B,C,D)=Π(1,5,7,8,9,10,11,12,13,14,15)
(c) Y(A,B,C,D)=Σ(0,1,2,3,5,6,7,8,9,10,11,12,13,14,15)

11.Draw the logic circuit for


Y=(A’+B+C)(A+B+C)
12.State the idempotent law of Boolean algebra and prove it algebraically.
13.Write the other canonical forms of the following functions:
(a) F(a,b,c,d)=Σ(0,2,6,11,13,14)
(b) F(a,b,c)=Π(1,2,3,4)
14.Verify using truth table that
XY(X+Y) = X.Y
15. What is a universal gate? Why is it so called? Give an explanation with relevant gate diagram.
16.Realize using AND-OR and NAND gates for the Boolean function Z = BC + AD
17.Determine the prime implicants of the following function using the Quine-McCluskey method
F(w,x,y,z)=Σ(1,4,6,7,8,9,10,11,15)
18.Express the following as a product of Maxterms: F(x,y,z)=(xy + z)(x + yz)
19.Simplify the Boolean function F=Σ(1,3,7,11,15) and the don’t care conditions
d(w,x,y,z)=Σ(0,2,5) using K-map.
20. Compare the advantages and disadvantages of 1’s and 2’s complements.
**********************************//********************************************

You might also like