Computer Science, asked by suryanshsingh3957, 11 days ago

please solve this question​

Attachments:

Answers

Answered by sarwagjnaaugust8
0

Answer:

a) According to De Morgan’s first law, the complement of the union of two sets A and B is equal to the intersection of the complement of the sets A and B. (A∪B)’= A’∩ B’ —– (1) Where complement of a set is defined as. A’= {x:x ∈ U and x ∉ A} Where A’ denotes the complement. This law can be easily visualized using Venn Diagrams. De morgan’s Law: This is the most powerful law of Boolean algebra. This states that: 1) (X Y)' = X '.Y' The truth table for the second theorem is: (X +Y) + X'Y' = ( (X+Y) + X'). ( (X+Y)+Y') [ (X+Y) (X+Z) = X+Y.Z] = (X+X'+Y). (X+Y+Y')

im sorry i dont know b) one

c) Truth Table of Full Adder Circuit: As Full adder circuit deal with three inputs, the Truth table also updated with three input columns and two output columns. We can also express the full adder circuit construction in Boolean expression. For the case of SUM, We first XOR the A and B input then we again XOR the output with Carry in.

Similar questions