2.4 Computational Logic COMPLETE Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

How do you get a positive output from an AND gate?

A

Both inputs = 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How go you get a positive output from an OR gate?

A

At least one of the inputs = 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do you get a positive output from a NOT gate?

A

Input = 0.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How do you calculate how many rows you need in your truth table?

A

2 to the power of no. of inputs.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

In computational logic, all possible outcomes are either…

A

TRUE or FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Why is it important for computers that all possible outcomes in computational logic are either TRUE or FALSE?

A

Computers can also only have two states - on or off - represented by 1 and 0 in binary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are the two states “on” and “off” represented by in binary?

A

1 and 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is boolean logic?

A

A form of algebra in which all values are reduced to one or two states, TRUE or FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Why is boolean logic especially important for computer science?

A

It fits with the binary system in which each bit has a value of either 1 or 0, that is, each bit has a value of either TRUE or FALSE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A processor contains over 1 billion t__________

A

transistors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What to transistors transmit when they are on?

A

An electrical current

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Do transistors transmit an electrical current when they are off?

A

No

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What are the two states of transistors?

A

On or off

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What can the two states of transistors be used to represent?

A

The conditions true (on) or false (off)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

How are logic gates represented?

A

By symbols in logic diagrams

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Logic gates use transistors that…

A

carry out all of the calculations and execute program instructions in the processor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What logic gate is this?

A

AND gate

18
Q

If A = 1 and B = 0, what would Z be?

A

0

19
Q

If A = 0 and B = 1, what would Z be?

A

0

20
Q

If A = 1 and B = 1, what would Z be?

A

1

21
Q

For an output at Q there must be an input at both…

A

A AND B

22
Q

What logic gate is this?

A

OR gate

23
Q

If A = 1 and B = 0, what would Z be?

A

1

24
Q

If A = 1 and B = 1, what would Z be?

A

1

25
Q

If A = 0 and B = 0, what would Z be?

A

0

26
Q

For an output at Q there must be an input at…

A

either one of A OR B, or at both of them

27
Q

What logic gate is this?

A

NOT gate

28
Q

If A = 1, what would Z be?

A

0

29
Q

If A = 0, what would Z be?

A

1

30
Q

There is only an output at Q when…

A

there is NOT an input at A

31
Q

The states of inputs and outputs of logic gates can be shown using…

A

Truth tables

32
Q

In truth tables, what are used to indicate the presence or absence of an electric current?

A

a 1 or a 0

33
Q

What logic gate is this truth table for?

A

AND gate

34
Q

What logic gate is this truth table for?

A

OR gate

35
Q

What logic gate is this truth table for?

A

NOT gate

36
Q

Logic diagrams and truth tables can be used to solve…

A

logic problems

37
Q

The Boolean statement P = A AND B implies that P is true only if…

A

Both A and B are true

38
Q

How can the Boolean statement P = A AND B be investigated?

A

Using a truth table

39
Q

What type of statements can be used to represent selection using relational operators used in programs?

A

Boolean statements

40
Q

The statement “if X == 9 AND Y == 6 then” is the same as P = A ___ B

A

AND

41
Q

The statement “if NOT(X == 9 AND Y == 6) then” is the same as P = …

A

NOT(A AND B)

42
Q

How could the statement “if X != 9 AND Y != 6 then” be represented as a Boolean expression?

A

P = (NOT A) AND (NOT B)