Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

DE For ECE

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

DE (ECE)

PART – A

1. What is meant by weighted and non-weighted code?

2. Add the decimals 67 and 78 using excess-3 code.

3. Convert (11001010)2 into gray code.

4. Define distributive law.

5. Define SOP & POS.

PART – B

6) (a) Find the maxterms for the expression F=AC’+ABC’+A’BC

(b) Convert the given expression in canonical SOP form Y = AC + AB + BC

7) Use Boolean theorems and prove the following

(a) A B+BC+B’C=AB+C

(b) ABC + ABC' + AB'C + A'BC = AB + AC + BC

8) Simplify the Boolean expressions using Boolean theorems and Draw equivalent circuit

using logic gates

(a) A'B'C' + A'BC' + A'BC

(b) AB + (AC)' + AB’C (AB + C)

(c) A (A + B)

9) (a) State and prove the De Morgan's theorem

(b) (1010.10)10 to binary & to octal.

10) (a) . Convert the following decimal numbers to their hexadecimal equivalent.

i) (3000)10 ii) (2500)10

(b) Y = (A + B) (A + C’) (B' + C’) obtain standard POS

(c) Using 2’s compliment perform the given subtraction (101101)2 – (110100)2

You might also like