Informatica B Boracchi · A and B or not C A B C X = A and B Y = not C X or Y 0 0 0 0 and 0 = 0 not...
56
Transcript of Informatica B Boracchi · A and B or not C A B C X = A and B Y = not C X or Y 0 0 0 0 and 0 = 0 not...
https://media.lanecc.edu/users/birdb/CS133G/CodeBlocks%20Troubleshooting.html
==, !=, >, <, >=, <=
(a > 7) , (b % 2 == 0), (x <= w)
!, &&, ||
(a > 7) && (b % 2 == 0)
!(x >= 7) || (a == 0)
int
=
+
-
*
/
%
==
!=
<
>
<=
>=
int
=
+
-
*
/
%
==
!=
<
>
<=
>=
==, !=, >, <, >=, <=
(a > 7) , (b % 2 == 0), (x <= w)
!, &&, ||
(a > 7) && (b % 2 == 0)
!(x >= 7) || (a == 0)
!
< > <= >=
== !=
&&
||
• x > 0 || y == 3 && !z
• (x > 0) || ((y == 3) && (!z))
&& ||
• (a && b) == (b && a)
• (a || b) == (b || a)
!!a == a
! && ||
!A A
negazione
(NOT)
A !A
0 1
1 0
A && B A B
congiunzione
(AND)
A B A && B
0 0 0
0 1 0
1 0 0
1 1 1
A && B A B
congiunzione
(AND)
A B A && B
0 0 0
0 1 0
1 0 0
1 1 1
A || B
disgiunzione
(OR)
A B A || B
0 0 0
0 1 1
1 0 1
1 1 1
A || B
disgiunzione
(OR)
A B A || B
0 0 0
0 1 1
1 0 1
1 1 1
A xnor B = not((A and (not B)) or (B and (not A)))
A xor B = ( A and ( not B ) ) or ( ( not A ) and B )
𝑛 → 2𝑛 2𝑛
A && !B || C
A && !B || C
A B C !B A && !B A && !B || C
0 0 0 1 0 0
0 0 1 1 0 1
0 1 0 0 0 0
0 1 1 0 0 1
1 0 0 1 1 1
1 0 1 1 1 1
1 1 0 0 0 0
1 1 1 0 0 1
A && !B || C
A B C !B A && !B A && !B || C
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
A && !B || C
A B C !B A && !B A && !B || C
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
A && !B || C
A B C !B A && !B A && !B || C
0 0 0 1 0
0 0 1 1 0
0 1 0 0 0
0 1 1 0 0
1 0 0 1 1
1 0 1 1 1
1 1 0 0 0
1 1 1 0 0
A && !B || C
A B C !B A && !B A && !B || C
0 0 0 1 0 0
0 0 1 1 0 1
0 1 0 0 0 0
0 1 1 0 0 1
1 0 0 1 1 1
1 0 1 1 1 1
1 1 0 0 0 0
1 1 1 0 0 1
A and B or not C
A B C X = A and B Y = not C X or Y
0 0 0 0 and 0 = 0 not 0 = 1 0 or 1 = 1
0 0 1 0 and 0 = 0 not 1 = 0 0 or 0 = 0
0 1 0 0 and 1 = 0 not 0 = 1 0 or 1 = 1
0 1 1 0 and 1 = 0 not 1 = 0 0 or 0 = 0
1 0 0 1 and 0 = 0 not 0 = 1 0 or 1 = 1
1 0 1 1 and 0 = 0 not 1 = 0 0 or 0 = 0
1 1 0 1 and 1 = 1 not 0 = 1 1 or 1 = 1
1 1 1 1 and 1 = 1 not 1 = 0 1 or 0 = 1
∃𝑥 | 𝑥2 1
𝑥 ∈ ℕ, ∃𝑎, 𝑏, 𝑐, 𝑑 ∈ ℕ | 𝑥 𝑎2𝑏2𝑐2𝑑2
A && (!B || C)
A && (!B || C)
A B C !B !B || C A && (!B||C)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
|| &&
1. !(a && b) == !a || !b
2. !(a || b) == !a && !b
!((a >= 5) && (a <= 10)) ->
!(a >= 5)||!(a <= 10) >= <=
!!(a < 5)|| !!(a > 10)
((a < 5) || (a > 10))
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
• A || C && !B
• !((B || !C) && !A)
!((B || !C) && !A)
(!(B || !C) || !!A)
!(B || !C) || A
(!B && C) || A
A || (!B && C)
A || (C && !B)
A || C && !B
if switch
while do while for
• 0
!=0
if
while
==, !=, <, >, <=, >=
X == 0
X > 0 && A != 3
!( (x+5)*10 >= ALFA3 / (Beta_Due+1) )
! a || b && c
prima !, poi &&, poi ||
&& ||
( x != 0 ) && ( (100 / x) == 0 )
int a = 0, b = 4;
a = b;
printf( "%d", a );
int a = 0, b = 4;
if ( a == b )
printf( "uguali" );
else
printf( "diversi" );
