martes, 29 de mayo de 2012
EJ Nº6: Verificar mediante tablas de verdad las leyes de Morgan.
A
|
B
|
A+B
|
no(A+B)
|
noA
|
noB
|
NoA*noB
|
0
|
0
|
0
|
1
|
1
|
1
|
1
|
0
|
1
|
1
|
0
|
1
|
0
|
0
|
1
|
0
|
1
|
0
|
0
|
1
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
0
|
A
|
B
|
A*B
|
no(A*B)
|
noA
|
noB
|
NoA+noB
|
0
|
0
|
0
|
1
|
1
|
1
|
1
|
0
|
1
|
0
|
1
|
1
|
0
|
1
|
1
|
0
|
0
|
1
|
0
|
1
|
1
|
1
|
1
|
1
|
0
|
0
|
0
|
0
|
EJ Nº14: Construir el circuito del ejercicio n°8 (puente angosto) utilizando solamente compuertas NAND
A
|
B
|
C
|
F
|
|
0
|
0
|
0
|
0
|
MAX = A+B+C
|
0
|
0
|
1
|
0
|
MAX= A+B+NoC
|
0
|
1
|
0
|
0
|
MAX=A+NoB+C
|
0
|
1
|
1
|
1
|
Min=A+NoB+NoC
|
1
|
0
|
0
|
0
|
MAX=A*NoB*NoC
|
1
|
0
|
1
|
0
|
MAX=NoA+B+NoC
|
1
|
1
|
0
|
1
|
Min=A*B*NoC
|
1
|
1
|
1
|
1
|
Min=A*B*C
|
A
|
B
|
C
|
NoA
|
NoB
|
NoC
|
No(NoA*B*C)
|
No(A*B*NoC)
|
No(A*B*C)
|
F
|
0
|
0
|
0
|
1
|
1
|
1
|
1
|
1
|
1
|
0
|
0
|
0
|
1
|
1
|
1
|
0
|
1
|
1
|
1
|
0
|
0
|
1
|
0
|
1
|
0
|
1
|
1
|
1
|
1
|
0
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
1
|
1
|
1
|
1
|
0
|
0
|
0
|
1
|
1
|
1
|
1
|
1
|
0
|
1
|
0
|
1
|
0
|
1
|
0
|
1
|
1
|
1
|
0
|
1
|
1
|
0
|
0
|
0
|
1
|
1
|
0
|
1
|
1
|
1
|
1
|
1
|
0
|
0
|
0
|
1
|
1
|
0
|
1
|
Suscribirse a:
Entradas (Atom)