SRM University 2007 B.Tech Information Technology IT100 -DIGITAL ELECTRONICS - Question Paper

8) Multiply out to find a sum of products
a) (A+B)(A+C’)(A+D)(BC’D+E)
b) (A+B’+C)(B’+C+D)(A’+C)
c) (A+B’C+D’)(B’C+D’+E)(A+E’)(AD+E’)
d) (A’+BE’)(BE’+C+D)(E+C’)

9) Factor every of the subsequent expression to find the product of sum’s
a) DE+F’G’ b) (WX’+WY’Z’+WYZ)
c) A’CD+E’F+BCD d) ABE+D’E+AC’E
10) Simply every of the subsequent expression
a) AB’+A’B’CD+A’CD’
b) (A’+C’+D)(A+B’+C’)(B+C’)
c) (AB’+AB’CD+ABC’D’)
d)CE(A’+B+C’+E’)(B+C’+D+E’)(A+B+C’+E’)

11) ans the subsequent
a) Is the subsequent distributive legal regulations valid? A+BC= (A+B)(A+C) prove ur ans
b) State and prove the associative legal regulations for the equivalence operation
12) obtain the complement of every of the subsequent expressions
a) wz(y’z+yz’)+w’x’(y’+z)(y+z’)
b) w+(ab+c’)(d’e+1)+g(h’+0)
c) [ab’+b(e’f’+g’h)][a’+bcd(e’+f’g)]

13 discuss elaborately about the positive logic and negative logic using AND gate;
14) Verify all the distributive legal regulations using truth table
15) Express the subsequent Boolean expression using canonical SOP from
a) F=(A+B)(A+C) b) F=A+B’C
c) F= AB+BC d) F= ABC+DC
16 Express the subsequent Boolean expression using canonical POS from
a) F=xy’z+y’z b)F=XY+X’Z
c F=x’+y d)F=X’Y+Y’Z
17) List the different postulates of a Boolean Algebra and how is it various from ordinary algebra






















UNIT-II

PART-A

1. State consensus theorem.
2. simplify the Boolean expression using consensus theorem
A’C’D+A’BD+BCD+ABC+ACD’
3. Explain minterm and maxterm of variables.
4. find the minterm expansion of f(a,b,c,d)=a’(b’+d)+acd’
5. Simplify f=A’B’C+A’BC using a K-map method.
6. List the different steps involved in Algebraic simplification
7. Define the minterm
8. State the 2 forms of Boolean algebra
9. List the different ways how the standard forms can be converted into canonical forms?
10. What is prime implicant?
11. What is meant by essential prime imliplicant?

Earning:   Approval pending.