SLIP TEST –I

EC-6302 DIGITAL ELECTRONICS Part – A

(7 x 2 = 14)1. State De Morgan's theorem2. Simplify the given Boolean expression F =

x’ + xy + xz’ + xy’z’3. Prove that the logical sum of all minterms of

a boolean function of 2 variables is 1.4. Convert Y = A+BC’+AB+A’BC into

canonical form.5. Map the SOP expression on the K-map

(AB)’C+ A’BC’+A(BC)’+ABC.6. What is a prime implicant and essential

prime implicant?7. What is a Logic gate? What are the basic

digital logic gates?

Part – B 16 Marks1. i) State and verify Demorgan’s Law. (6)2. ii) Reduce the following function using K-

map technique (10)F(A,B,C,D) = π(0,3,4,7,8,10,12,14) +d(2,6).

SLIP TEST –I

EC-6302 DIGITAL ELECTRONICS Part – A

(7 x 2 = 14)1. State De Morgan's theorem2. Simplify the given Boolean expression F =

x’ + xy + xz’ + xy’z’3. Prove that the logical sum of all minterms of

a boolean function of 2 variables is 1.4. Convert Y = A+BC’+AB+A’BC into

canonical form.5. Map the SOP expression on the K-map

(AB)’C+ A’BC’+A(BC)’+ABC.6. What is a prime implicant and essential

prime implicant?7. What is a Logic gate? What are the basic

digital logic gates?

Part – B 16 Marks1. i) State and verify Demorgan’s Law. (6)2. ii) Reduce the following function using K-

map technique (10)F(A,B,C,D) = π(0,3,4,7,8,10,12,14) +d(2,6).

SLIP TEST –I

EC-6302 DIGITAL ELECTRONICS Part – A

(7 x 2 = 14)1. State De Morgan's theorem2. Simplify the given Boolean expression

F = x’ + xy + xz’ + xy’z’3. Prove that the logical sum of all

minterms of a boolean function of 2 variables is 1.

4. Convert Y = A+BC’+AB+A’BC into canonical form.

5. Map the SOP expression on the K-map (AB)’C+ A’BC’+A(BC)’+ABC.

6. What is a prime implicant and essential prime implicant?

7. What is a Logic gate? What are the basic digital logic gates?

Part – B 16 Marks1. i)State and verify Demorgan’s Law. (6)2. ii)Reduce the following function using

K-map technique (10)F(A,B,C,D)=π(0,3,4,7,8,10,12,14)+d(2,6).

SLIP TEST –I

EC-6302 DIGITAL ELECTRONICS Part – A

(7 x 2 = 14)1. State De Morgan's theorem2. Simplify the given Boolean expression

F = x’ + xy + xz’ + xy’z’3. Prove that the logical sum of all

minterms of a boolean function of 2 variables is 1.

4. Convert Y = A+BC’+AB+A’BC into canonical form.

5. Map the SOP expression on the K-map (AB)’C+ A’BC’+A(BC)’+ABC.

6. What is a prime implicant and essential prime implicant?

7. What is a Logic gate? What are the basic digital logic gates?

Part – B 16 Marks1. i)State and verify Demorgan’s Law. (6)2. ii) Reduce the following function using

K-map technique (10)F(A,B,C,D) = π(0,3,4,7,8,10,12,14) +d(2,6).

SLIP TEST –I

EC-6302 DIGITAL ELECTRONICS Part – A

(7 x 2 = 14)1. State De Morgan's theorem2. Simplify the given Boolean expression

F = x’ + xy + xz’ + xy’z’3. Prove that the logical sum of all

minterms of a boolean function of 2 variables is 1.

4. Convert Y = A+BC’+AB+A’BC into canonical form.

5. Map the SOP expression on the K-map (AB)’C+ A’BC’+A(BC)’+ABC.

6. What is a prime implicant and essential prime implicant?

7. What is a Logic gate? What are the basic digital logic gates?

Part – B 16 Marks1. i)State and verify Demorgan’s Law. (6)2. ii) Reduce the following function using

K-map technique (10)F(A,B,C,D)=π(0,3,4,7,8,10,12,14)+d(2,6).

SLIP TEST –I

EC-6302 DIGITAL ELECTRONICS Part – A

(7 x 2 = 14)1. State De Morgan's theorem2. Simplify the given Boolean expression

F = x’ + xy + xz’ + xy’z’3. Prove that the logical sum of all

minterms of a boolean function of 2 variables is 1.

4. Convert Y = A+BC’+AB+A’BC into canonical form.

5. Map the SOP expression on the K-map (AB)’C+ A’BC’+A(BC)’+ABC.

6. What is a prime implicant and essential prime implicant?

7. What is a Logic gate? What are the basic digital logic gates?

Part – B 16 Marks1. i)State and verify Demorgan’s Law. (6)2. ii) Reduce the following function using

K-map technique (10)F(A,B,C,D) = π(0,3,4,7,8,10,12,14) +d(2,6).