Save
computer science
Logic gates
Save
Share
Learn
Content
Leaderboard
Share
Learn
Created by
mahi nahar
Visit profile
Cards (39)
Not gate - 1 input = output 0, 0 input = 1 output
What is
Boolean Logic
primarily concerned with?
Boolean Logic is concerned with
true
or
false
values.
View source
What do
Logic Gates
do in
Boolean Logic
?
Logic Gates apply
Boolean Operations
to Inputs.
View source
How many inputs does a
NOT gate
take?
A NOT gate takes a
single
input.
View source
What is the output of a
NOT gate
when the input is
0
?
The output is
1
.
View source
What is the output of a
NOT gate
when the input is
1
?
The output is
0
.
View source
What does the truth table for a
NOT gate
look like?
Input
:
0
,
Output
:
1
Input: 1, Output: 0
View source
How many inputs does an
AND gate
take?
An AND gate takes
two
inputs.
View source
What is the
output
of an
AND gate
when both inputs are
1
?
The output is 1.
View source
What is the
output
of an
AND gate
if at least one input is
0
?
The output is 0.
View source
What does the truth table for an
AND gate
look like?
Input A
:
0
,
Input B
: 0,
Output
: 0
Input A: 0, Input B:
1
, Output: 0
Input A: 1, Input B: 0, Output: 0
Input A: 1, Input B: 1, Output: 1
View source
How many inputs does an
OR gate
take?
An OR gate takes
two
inputs.
View source
What is the
output
of an
OR gate
when at least one input is
1
?
The output is 1.
View source
What is the
output
of an
OR gate
if both
inputs
are 0?
The output is 0.
View source
What does the truth table for an
OR gate
look like?
Input A
:
0
,
Input B
: 0,
Output
: 0
Input A: 0, Input B:
1
, Output: 1
Input A: 1, Input B: 0, Output: 1
Input A: 1, Input B: 1, Output: 1
View source
What are the expressions and notations for the basic logic gates?
NOT
: Expression: NOT A, Notation: ¬A
AND
: Expression: A AND B, Notation: A∧B
OR
: Expression: A OR B, Notation: A∨B
View source
How can the output of a two-input
logic circuit
be expressed using
Boolean operators
?
The output can be expressed as R =
A ∨ B
.
View source
How many rows are needed in the
truth table
for a circuit with
two inputs
?
Four
rows are needed.
View source
What is the
formula
to determine the number of rows in a truth table based on
inputs
?
The formula is \(
2^n
\), where \(n\) is the number of inputs.
View source
What is the process for creating
truth tables
for complex
logic diagrams
?
Follow each gate
step by step
.
Write down the output using brackets and terms
AND
,
OR
, and
NOT
.
Complete operations in brackets first.
View source
What does the circuit
NOT
(A
AND
B) represent?
It represents the output of a NOT
gate
following an AND gate.
View source
What does the circuit
NOT
(C
OR
D) represent?
It represents the output of a NOT
gate
following an OR gate.
View source
How many
inputs
can a
logic circuit
have?
A logic circuit can have more than
two
inputs.
View source
How can a two-level logic circuit with three inputs be expressed using
Boolean
operators?
It can be expressed as R = (A
OR
B)
AND
(
NOT
C).
View source
How many
rows
are needed in the truth table for a circuit with
three
inputs?
Eight
rows are needed.
View source
What is the
output
of the circuit R = (A
OR
B)
AND
(
NOT
C) when A, B, and C are all
0
?
The output is 0.
View source
What is the order of operations for
Boolean
operations?
Brackets
NOT
AND
OR
View source
What
Boolean
operators
are needed in programming?
AND
,
OR
, and
NOT
are the only Boolean operators needed.
View source
How are
Boolean
operators represented in programming?
AND
: &&
OR
: ||
NOT
: !
View source
Why is it important to use brackets in long
Boolean
expressions
?
Brackets clarify which part of the expression to
evaluate
first.
View source
How can
Boolean operators
enhance programming
efficiency
?
They make
selection statements
more efficient.
They make
iteration statements
more versatile.
View source
What is the
algorithm
to keep score in a 'best out of 10' game?
Use a
loop
to track rounds and check
conditions
for ending the game.
View source
What conditions must be met for the game to end in the
'best out of 10'
game?
The game ends when one player wins
6
rounds or both win
5
rounds.
View source
What is the
algorithm
to determine a character's status based on hunger, hydration, and comfort?
Check
conditions
for each variable to determine if the character is
alive
or
dead
.
View source
What
conditions
lead to a character's death in the
algorithm
provided?
Any variable equals 0, any two variables
less than 20
, or all three
less than 40
.
View source
What is the output of the
character's status
if all three
variables
are less than 40?
The character is
dead
.
View source
What happens if any of the
variables
are equal to 0 in the
character's status
algorithm
?
The character is dead.
View source
What is the output of the
character's status
if
hunger
is 0 and
hydration
is 10?
The character is dead.
View source
What is the output of the
character's status
if
hunger
is 10,
hydration
is 10, and
comfort
is 10?
The character is
dead
.
View source
See similar decks
Logic Gates
Computer Science
14 cards
Logic Gates + Boolean Algebra
Computer Science
40 cards
Logic gates
Computer Science
12 cards
Logic Gates
Computer Science
2 cards
logic gates
computer science
12 cards
logic gates
Computer Science
4 cards
Logic gates & binary 1
Computer science
47 cards
LOGIC GATES AND COMPUTATIONAL THINKING
computer science
6 cards
NOT logic gate
Computer Science > Logic gates
4 cards
OR logic gate
Computer Science > Logic gates
4 cards
Logic gates: AND, OR, NOT, NAND, NOR, XOR
A-level Computer Science
63 cards
Logic Gates
COMPUTER SCIENCE
39 cards
AP Computer Science Principles
1196 cards
AP Computer Science A
1898 cards
OCR A-Level Computer Science
2091 cards
OCR GCSE Computer Science
1937 cards
Edexcel GCSE Computer Science
2949 cards
AQA GCSE Computer Science
2308 cards
Logic gates/languages
Computer science
7 cards
Understanding the use of logic gates
OCR GCSE Computer Science > 2.4 Boolean Logic > 2.4.1 Boolean Logic
41 cards
13.4.1 Understanding logic gates
2024-25 AQA A-Level Physics > 13. Electronics (Optional) > 13.4 Digital electronics
56 cards