Scribd
Upload
45 views3 pages

Basic Electronics Module 1 Question Bank

This document is a question bank for Basic Electronics, covering various topics including number system conversions, logic gate designs, Boolean algebra, and De Morgan's laws. It contains theoretical questions, practical exercises, and simplifications involving basic gates and arithmetic operations using complements. The questions are structured to test understanding and application of fundamental concepts in electronics and digital logic design.

Uploaded by

br0kenop242
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
45 views3 pages

Basic Electronics Module 1 Question Bank

This document is a question bank for Basic Electronics, covering various topics including number system conversions, logic gate designs, Boolean algebra, and De Morgan's laws. It contains theoretical questions, practical exercises, and simplifications involving basic gates and arithmetic operations using complements. The questions are structured to test understanding and application of fundamental concepts in electronics and digital logic design.

Uploaded by

br0kenop242
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/ 3

Basic Electronics

Question Bank - Module 1


Theory Questions

1. a) Convert (AF3C)16= (?)10= (?)8= (?)2


a) Design a logic circuit using basic gates with three inputs A, B, C, and output Y that goes low
only when C is low and A & B are different.

2. a) Simplify and realize the following using basic gates


i. XY+XYZ+X (Y+XY') ii. ABC+AB'C+ABC'+A'BC
b) State and prove De Morgan's laws for two variables.

3. a) Compute the following


i. (525.25)8 = ( ) 10= ( )2 ii. (3576.46)3= ( ) 16 iii. (10AB) 16= ( )10 iv. (ABC) 16= (?)8
b)
Perform (35)10 - (19) 10 using 1's and 2's Complement representation.
c)
Explain the types of logic gates by using logic symbols and truth tables.

4. a) Convert (3745)8 to binary, decimal and hexadecimal number systems


b) Derive a Full adder from Half adders.

5. a) State and prove De Morgan's theorems.


b) Convert the decimal number 65.45 into a binary number (up to 7 places of the decimal).
Use 2's complement to perform the binary subtraction of 1111 - 1011.

6. a) Name the 7 basic types of gates. Draw the symbolic representation of the 7 basic
types of gates along with their truth tables.
b) Explain commutative, associate & distributive laws w.r.t. the gates using Boolean algebra by
drawing their symbolic gate diagrams along with their truth tables for the following operations.
A.B = B.A
A + B = B + A A.
(B.C) = (A.B).C
A + (B + C) = (A + B) + C
A. (B+C) = (A.B) + (A.C)

7. Perform the following

conversions i) (988.86)10= (?)16

ii) (1D6.CA) 16= (?)

iii) (457.245)8= (?)10

8. Simplify the following expression and implement using basic gates


i) abc +ab'c +abc'+a'bc
ii) (a+b)' (a'+c')(b'+c)
iii) Subtract (1010)2-(0111)2 using 1's and 2's complement method
9. Simplify and realize the following expression by using basic gates only.

i) XY+XYZ+XYZ'+ X'YZ
ii) AB+A'C+AB'C(AB+C)

10. Design a full adder and implement using two half adders and one OR gate.
11. a) Design and implement a full adder giving in detail the truth table for full adder and
expression for SUM and CARRY
b) Simplify and realize using basic gates
i) Y= (A+B'C (A'+B'+C') (A’+B) ii) (X'Y'Z'+ X'Y'Z+X'Y'+XY')
12. a) Convert (i) (2604.105) 10 = (?)16
(ii) (ABCD) 16 = (?)2= (?)8
(iii) (10111101.0101)2 = (?) 10 = (?)16
b) Perform (48)10 - (12)10 using 1's and 2's complement.
c) State and prove DeMorgan's theorems.
d) Realise the following expression using NOR gates.= A'B'

13. a) Convert the following:


i. [6875]10=[?]8 ii. [10100110]2=[?]10
iii. [A72E]16=[?]8 iv. [95.5]10=[?]16 v. [BCDE]16=[?]2
b) Implement XOR gate using basic gates only.
c) Perform (28)10-(19) 10 using 1's and 2's complement representation.

14. Design a full adder and implement using two half adders and one OR gate.

15. State and prove De Morgan's laws.

16. Realize the following expression using basic gates:


i) Y= (BC)' + (AC)' + (AB)'
ii). Y= (AB)' + A'B
iii) Y= (AB)' + A + (B+C)'

17. What are the types of number systems? Explain the advantages of number systems in the
digital world.

18. a) Convert the (147.23)10 to Octal number system


b)
Convert (ADE)16 to decimal number system
c)
Convert (FADE) to a) Binary number system, b) Decimal and c) Octal number system
(08marks)
d)
Convert (745.128)8 to decimal number system
e)
Convert (10110111.11101110)2 to a) Decimal number, b) Octal C) Hexadecimal
(08marks)

19. a) What are the applications of 1’s and 2’s complement? Discuss their usage in
arithmetic operation. (06marks)

20. a) Complement the number a) 35 , b) 47 ,c) 28 and d) 99 using 1’s and 2’s complement
system (08marks)
b) Perform binary subtraction between a) 52-48, b) 10-27, c) 25-14 and d) 15-55 using
both 1’s and 2’s complement method and verify the answer (10marks)

21. Explain Basic gates and Universal gates? With the help of truth, table explains all basic
gates and universal gate functions and their boolean expressions (10marks)

22. Define Boolean algebra? Discuss the application of boolean algebra with an example
(08marks)

23. Explain briefly about Boolean algebra laws along with their truth table (08marks)

24. a) State De-Morgan's Theorems. Explain its significance using a three variable truth table
(08marks)

25. a) Find the complement of a + {(b + c).(b' + d')) using Demorgan's Laws. Show the
relevant reasoning. (10marks)
b) Reduce the following boolean expression to its simple form:
A.[B + C.(A.B + A.C')]
c) Find the complement of the following functions applying De’Morgan’s theorem .
(I) F(x,y,z) = x’yz’ + x’y’z (II) F(x,y,z) = x(y’z + yz)

You might also like