Name of the Faculty : M.

SELVAM
Department : Electronics and Communication Systems
Subject : Digital Electronics
Subject code : 13ECU301
Class : II B.Sc ECS
Year and Semester : 2014 2015; III Semester




UNIT 1: NUMBER SYSTEM AND CODES
IMPORTANT QUESTIONS

PART A
1.
Convert (237)
10
to Hexadecimal (?)
16
and Octal (?)
8
2. Convert (1011011)
binary
to (?)
gray

3. (a) 11101*101 (b)1111*11
4. Convert the following binary numbers into Excess 3 code: 1010 and 0110
5.
Convert the following numbers into Decimal numbers: (A28)
16
and (752)
8
6.
Convert (1011011)binary to (?)gray

7. Convert (111101)
2
to Gray and (111111)

to binary
8. Perform 2s complement 10110101
9. Explain ASCII
10. Convert (185)
10
to BCD & binary code

PART B
1 Perform BCD addition on the following terms (348)
10
-(245)
10

2Convert the decimal number 82.67 to its binary, hexadecimal and octal Equivalents.
(ii). Add 20 and (-15) using 2s complement.
(iii) Add 648 and 487 in BCD code.
3.Perform the following subtractions using 2s complement method.
(1) 01000 01001 (2) 01100 00011 (3) 0011.1001 0001.1110
4.Determine the binary numbers represented by the following decimal numbers.
(1 ) 25.5 (2) 10.625 (3) 0.6875





KARPAGAM UNIVERSITY
Karpagam Academy of Higher Education
(Established Under Section 3 0f UGC Act,1956)
COIMBATORE 641021

Name of the Faculty : M.SELVAM
Department : Electronics and Communication Systems
Subject : Digital Electronics
Subject code : 13ECU301
Class : II B.Sc ECS
Year and Semester : 2014 2015; III Semester




UNIT II: LOGIC GATES, BOOLEAN ALGEBRA AND DIGITAL ICS
IMPORTANT QUESTIONS

PART A
1. State De-Morgans Law
2. Write Associative and Distributive Laws
3. Draw OR gate and derive the truth table.
4. What is Propagation Delay?
5. What are universal gates? Why it is called so.
6. Draw logic diagram for Y= (A-B)+(C-D)
7. Give the logic symbol and truth table of EX-OR gate.
8. Define Duality theorem.
9. Draw OR gate using NAND gate.
10. The output of a logic gate is 1 when all its inputs are at logic 0. the gate _________

PART B
1. State and prove Demergons laws..
2. Explain the universal gates? Construct a logic circuit using NAND gates only for the
expression x = A. (B + C)
3. Distinguish between min terms and max terms.
4. Simplify the Boolean function using K-map. F(A,B,C,D,E) =
(0,2,4,6,9,13,21,23,25,29,31)
5. Obtain the canonical product of sum form of the function (A,B,C,D)=(A+B)C(A+D)



KARPAGAM UNIVERSITY
Karpagam Academy of Higher Education
(Established Under Section 3 0f UGC Act,1956)
COIMBATORE 641021