0% found this document useful (0 votes)
3 views3 pages

FEC Module 5 Question Bank

This document contains a question bank for Module-5, covering various topics in binary number conversions, binary arithmetic, Boolean algebra, and logic gates. It includes exercises on converting numbers between different bases, performing binary subtraction using 1's and 2's complements, and implementing Boolean functions using truth tables and logic gates. Additionally, it discusses the definitions and properties of binary logic, algebraic structures, and universal gates.
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
0% found this document useful (0 votes)
3 views3 pages

FEC Module 5 Question Bank

This document contains a question bank for Module-5, covering various topics in binary number conversions, binary arithmetic, Boolean algebra, and logic gates. It includes exercises on converting numbers between different bases, performing binary subtraction using 1's and 2's complements, and implementing Boolean functions using truth tables and logic gates. Additionally, it discusses the definitions and properties of binary logic, algebraic structures, and universal gates.
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

Module-5

Question Bank

1.)Convert the following

(i)(11010.11)2=(?)10

(ii)(4021.2)5=(?)10

(iii)(127.4)8=(?)10

(iv)(B65F)16=(?)10

(v)(110101)2=(?)10

2.)Convert the following

(i)(41)10=(?)2

(ii)(153)10=(?)8

(iii)(0.6875)10=(?)2

(iv)(0.513)10=(?)8

(v)(10110001101011.111100000110)2=(?)8

(vi)(10110001101011.11110010)2=(?)16

(vii)(673.124)8=(?)2

(viii)(306.D)16=(?)2

3.)Given the two binary numbers X=1010100 and Y=1000011,perform the subtraction

(a)X-Y and (b)Y-X by using 2’s complements.

4.) Given the two binary numbers X=1010100 and Y=1000011,perform the subtraction

(a)X-Y and (b)Y-X by using 1’s complements.

5.)Using 2’s complements, find the following sums:

(a)+4

+11

(b)+4

-11
(c) -4

+11

(d)-4

-11

6.) Define Binary Logic. Explain the three basic logical operations with their truth tables,
logic symbols, and input–output signals for the corresponding gates.

7.) Explain the commonly used postulates for formulating various algebraic structures with
suitable examples.

8.)Show that

(i)x+x=x

(ii)x.x=x

(iii)x+1=1

(iv)x+xy=x

8.) State and prove De Morgan’s theorem for two variables using truth tables.

9.) Implement the below Boolean functions using TRUTH TABLE and LOGIC GATES

(i) F1= x+yIz

(ii) F2 =xIyIz +xIyz+xyI

10.)Simplify the following boolean expressions to a minimum number of literals

(i)x(xI +y)

(ii)x+ xIy

(iii)(x+y)(x+y1)

(iv)xy+xiz+yz

11.) Find the complement of the functions

F1=xIyzI + xIyIz and F2=x(yIzI+yz)

12.) Draw the logic diagram for the Boolean function F=x1y+xy1

13.) Express the Boolean function F= A +BIC in a sum of minterms.

14.) Express the Boolean function F=xy +xIz in a product of maxterm form.
15.) Convert the following to the other canonical form.

(i)F(A,B,C)=Ʃ(1,4,5,6,7)

(ii)F(x,y,z)= Ʃ(1,3,7)

(iii)F(A,B,C)=Π(0,2,4,5)

(iv)F(A,B,C,D)= Π(0,1,2,3,4,6,12)

16.)Explain sum of product(SOP) and product of sum(POS) with an examples.

17.) What are logic gates? Write the graphic symbol, algebraic function and truth table of all
8 digital logic gates.

18.) Explain why NAND and NOR gates are called universal gates.

19.)Implement the following Boolean function with NAND gates

F(x,y,z)=(1,2,3,4,5,7)

20.)Implement the Boolean function F(w,x,y,z)=(y+zi)(wxi+wix) with NOR gates.

21.) Implement half adder circuit with its truth table and draw the logic diagram of sum and
carry.

22.) With the help of truth table, explain the operation of full adder with sum and carry
expressions along with circuit diagrams.

23.) Implement full adder using two half adders and an OR gate. Write the equations for sum
and carry.

You might also like