Digital Electronics
December 8, 2016
Categorised in: 1st Year Electronics
AND Gate
Y = A.B
OR Gate
Y = A + B
NAND Gate
Y = $\ov{A.B}$
NOR Gate
Y = $\ov{A + B}$
EX-OR Gate
Y = A ⊕ B
EX-NOR Gate
Y = $\ov{A⊕B}$
$\table Name,\text"Statement of the law"; \text"Commutative Law",A.B = B.A;,A+B=B+A;\text"Associative Law",(A.B).C=A.(B.C);,(A+B)+C=A+(B+C);\text"Distributive Law",A.(B+C) = AB+ AC; \text"AND Laws",A.0=0;,A.1=A;,A.A=A;,A.\ov{A}=0;\text"OR Laws",A+0=A;,A+1 = 1;,A+A=A;,A+\ov{A}=1;\text"Inversion Law",\ov{\ov{A}}=A;\text"Other Important Laws",A+BC=(A+B)(A+C);,\ov{A} + AB = \ov{A} + B;,\ov{A} + A \ov{B} = \ov{A} + \ov{B};,A+AB = A;,A+ \ov{A}B = A +B$
De-Morgan’s Theorem
$\ov{AB} = \ov{A} + \ov{B}$
$\ov{A+B} = \ov{A} . \ov{B}$
Pratik Kataria is currently learning Springboot and Hibernate.
Technologies known and worked on: C/C++, Java, Python, JavaScript, HTML, CSS, WordPress, Angular, Ionic, MongoDB, SQL and Android.
Softwares known and worked on: Adobe Photoshop, Adobe Illustrator and Adobe After Effects.