This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Computer Programming I TA C162 20/01/06 Todays Contents DeMorgan's Law More than 2Inputs Logic Implementation of Combinational Logic Half Adder Full Adder 2 Computer Programming I TA C162 20/01/06 DeMorgan's Law First Law A.B.C.D. . = = A+B+C+D+ . Second Law A+B+C+D . = = A.B.C.D. . Here . represents Logic AND And + represents Logic OR 3 Computer Programming I TA C162 20/01/06 DeMorgan's Law: Example Converting AND to OR (with some help from NOT) Consider the following circuit: A B 1 1 1 1 1 1 1 1 1 1 1 1 B A B A B A Same as A+B! 4 Computer Programming I TA C162 20/01/06 More Examples: Find the complement of function F1 F1 = ABC + ABC F1 = (ABC + ABC) F1 = (X + Y) Here : X = ABC Y = ABC F1 = X.Y Using Second Law F1 = (ABC). (ABC) F1 = (A + B + C) . (A +B + C) Using First Law Exercise: Find complement of F2 = A(BC + BC) 5...
View
Full
Document
This note was uploaded on 05/14/2010 for the course CS SS ZG653 taught by Professor Shanta during the Spring '09 term at Birla Institute of Technology & Science.
 Spring '09
 SHANTA
 Computer Programming

Click to edit the document details