Delphi - I just did these math questions

I'm a beginner

I just did these math questions, but I did not find the correct answers to see how many I got right.

1)
By assuming only two possible values ​​for its unit content, Boolean algebra allowed a series of associations for its comprehension.

Given the truth table below,

X Y?
0 0 0
1 0 0
0 1 0
1 1 1
The result that produces these values, which is symbolized by a query will be:

Alternatives:

The)
X + Y

B)
X. Y

W)
X - Y

(d)
X + NOT Y

and)
X. Y + Y

2)
By assuming only two possible values ​​for its unit content, Boolean algebra allowed a series of associations for its comprehension.

Given the truth table below,

X Y?
0 0 0
1 0 1
0 1 1
1 1 1
The result that produces these values, which is symbolized by a query will be:

Alternatives:

The)
X + Y

B)
X. Y

W)
X-Y

(d)
X + NOT Y

and)
X. Y + X

3)
By assuming only two possible values ​​for its unit content, Boolean algebra allowed a series of associations for its comprehension.

Given the truth table below,

X Y X NOTY
0 0 X
1 0 Y
0 1 Z
1 1 T
The resulting representation by X NOT Y:, tick the correct completing sequence and respectively the table with the truth values ​​of x, y, z, t.

Alternatives:

The)
0.0.0.0

B)
1,1,1,1

W)
0.1,0,1

(d)
1.0,1.0

and)
1,1,0,0

4)
By assuming only two possible values ​​for its unit content, Boolean algebra allowed a series of associations for its comprehension.

Given the truth table below,

X Y X. Y + X
0 0 x
1 0 y
0 1 z
1 1 t
The resulting representation by: X. Y + X, tick the correct completing sequence and respectively the table with the truth values ​​of x, y, z, t.

Alternatives:

The)
0.0.0.0

B)
1,1,1,1

W)
0.1,0,1

(d)
1.0,1.0

and)
1,1,1,0

5)
By assuming only two possible values ​​for its unit content, Boolean algebra allowed a series of associations for its comprehension.

Banca UFMT - Politec- MT, 2017 (adapted)

Consider the truth table below, where in the first two columns are the truth values ​​of two propositions A and B.
Consider that V is used for true proposition and F for false proposition.
Mark the correct completing sequence and, respectively, the table with the truth values ​​of x, y, z, t.

Alternatives:

The)
V, F, V, V

B)
V, F, F, F

W)
F, V, V, F

(d)
F, V, F, V

and)
V, V, V, V



6)
Logic is the science of reasoning or thinking.

Given the truth table below,

X Y?
0 0 1
1 0 1
0 1 1
1 1 0
The result that produces these values, which is symbolized by a query will be:

Alternatives:

The)
X OR Y

B)
X AND Y

W)
X XOR Y

(d)
X NAND Y

and)
X NOR Y

7)
Logic is the science of reasoning or thinking.

Given the truth table below,

X Y?
0 0 0
1 0 1
0 1 1
1 1 0
The result that produces these values, which is symbolized by a query will be:

Alternatives:

The)
X OR Y

B)
X AND Y

W)
X XOR Y

(d)
X NAND Y

and)
X NOR Y

8)
Logic is the science of reasoning or thinking.

Given the truth table below,

X Y X OR Y NAND Y
0 0 X
1 0 Y
0 1 Z
1 1 T
The resulting representation by X OR Y NAND Y:, tick the correct completing sequence and respectively the table with the truth values ​​of x, y, z, t.

Alternatives:

The)
0.0.0.0

B)
1,1,1,1

W)
0.1,0,1

(d)
1.0,1.0

and)
1,1,0,0

9)
Logic is the science of reasoning or thinking.

Given the truth table below,

X Y X AND Y NOR X
0 0 X
1 0 Y
0 1 Z
1 1 T
The resulting representation by: X AND Y NOR X, tick the correct completing sequence and respectively the table with the truth values ​​of x, y, z, t.

Alternatives:

The)
0.0.0.0

B)
1,1,1,1

W)
0.1,0,1

(d)
1.0,1.0

and)
1,1,0,0

10)
Logic is the science of reasoning or thinking.

Given the truth table below,

X Y?
0 0 1
1 0 0
0 1 0
1 1 0
The result that produces these values, which is symbolized by a query will be:

Alternatives:

The)
X OR Y

B)
X AND Y

W)
X XOR Y

(d)
X NAND Y

and)
X NOR Y