answersLogoWhite

0

The powerset for the set {0, 1} is the set containing:

Φ, {0}, {1}, {0, 1}.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

Who would win a fight between the juggernaut and the hulk?

It depends on the writer of course. But Hulk's powerset simply does not give him the tools to beat The Juggernaut.


Give truth table for excess-3 to bcd code converter?

Excess-3 BCD a B c d w x y z 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0 1 0 0 1 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 i'm not sure. but it should be the ans


Design a truth table up to 4 variable?

w x y z 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 FORMULA FOR possibilities = 2 ^(no of variables). Here its 4 so, 2n=24=16 Hence we have 16 possibilities.


What is the truth table for A B CY?

a b c y 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 FORMULA FOR possibilities = 2 ^(no of variables). Here its 4 so, 2n=24=16 Hence we have 16 possibilities.


How do you express 1 2 3 etc in a digital format 0s and1s?

0 . . . 0 0 0 0 1 . . . 0 0 0 1 2 . . . 0 0 1 0 3 . . . 0 0 1 1 4 . . . 0 1 0 0 5 . . . 0 1 0 1 6 . . . 0 1 1 0 7 . . . 0 1 1 1 8 . . . 1 0 0 0 9 . . . 1 0 0 1 10 . . 1 0 1 0 11 . . 1 0 1 1 12 . . 1 1 0 0 13 . . 1 1 0 1 14 . . 1 1 1 0 15 . . 1 1 1 1 16. 1 0 0 0 0 . . etc.


What are the binary number for 1-10?

11


How do you count in binary from twenty to twenty-five?

1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 0 0 1 1 0 0 1


Calculate the first 10 numbers in base 2?

0 . . . . . 0 0 0 0 1 . . . . . 0 0 0 1 2 . . . . . 0 0 1 0 3 . . . . . 0 0 1 1 4 . . . . . 0 1 0 0 5 . . . . . 0 1 0 1 6 . . . . . 0 1 1 0 7 . . . . . 0 1 1 1 8 . . . . . 1 0 0 0 9 . . . . . 1 0 0 1 10 . . . . 1 0 1 0


What are logic gates with truth table and or not?

AND A B Q 0 0 0 0 1 0 1 0 0 1 1 1 OR A B Q 0 0 0 0 1 1 1 0 1 1 1 1 NOT A Q 0 1 1 0 (I might as well carry on) XOR A B Q 0 0 0 0 1 1 1 0 1 1 1 0 NAND A B Q 0 0 1 0 1 1 1 0 1 1 1 0 NOR A B Q 0 0 1 0 1 0 1 0 0 1 1 1 BUF (NNOT) A Q 0 0 1 1 XNOR A B Q 0 0 1 0 1 0 1 0 0 1 1 1


Truth table of 1 to 16 demultiplexer?

Strobe A B C D Output (Y) 0 0 0 0 0 D0 0 0 0 0 1 D1 0 0 0 1 0 D2 0 0 0 1 1 D3 0 0 1 0 0 D4 0 0 1 0 1 D5 0 0 1 1 0 D6 0 0 1 1 1 D7 0 1 0 0 0 D8 0 1 0 0 1 D9 0 1 0 1 0 D10 0 1 0 1 1 D11 0 1 1 0 0 D12 0 1 1 0 1 D13 0 1 1 1 0 D14 0 1 1 1 1 D15 1 X X X X 1 where A,B,C,D are the control input or control nibble and the Boolean expression for Y is given as:- Y = A'B'C'D'D0 + A'B'C'DD1 + A'B'CD' D2 + A'B'CDD3 + A'BC'D'D4 + A'BC'DD5+ A'BCD'D6 + A'BCDD7 + AB'C'D'D8 + AB'C'DD9 + AB'CD'D10 + AB'CDD11 + ABC'D'D12 + ABC'DD13 + ABCD'D14 + ABCDD15


What is 1-0-0-1?

1 - 0 - 0 - 1 = 0


How dual of xor is equal to its complement?

| x | y | x' | y' | x⊕y | x'⊕y' | ---------------------------------- | 0 | 0 | 1 | 1 | 0 | 0 | | 0 | 1 | 1 | 0 | 1 | 1 | | 1 | 0 | 0 | 1 | 1 | 1 | | 1 | 1 | 0 | 0 | 0 | 0 |