Back to marketplace

Logic Gates

No description yet. This curated deck is ready for daily study.

Total cards: 15•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (15)

#1
Front (Question)

What are logic gates?

Back (Answer)

Logic gates are circuits that are used to perform a logical operation in computing and electronics.

#2
Front (Question)

What is a truth table?

Back (Answer)

A truth table is a diagram that shows all possible logical inputs and their associated outputs.

#3
Front (Question)

What is an AND GATE?

Back (Answer)

Two or more inputs where the output is true if all inputs are true

#4
Front (Question)

What is an NOT GATE?

Back (Answer)

The output is the inverse (opposite) of the input.

#5
Front (Question)

What is an OR GATE?

Back (Answer)

Two or more inputs where the output is true if either or both inputs are true

#6
Front (Question)

What is an XOR GATE?

Back (Answer)

Two or more inputs where the output is true ONLY if one input is exclusively true.

#7
Front (Question)

What is an NAND GATE?

Back (Answer)

Two or more inputs where the output is false when all inputs are true.

#8
Front (Question)

What is an NOR GATE?

Back (Answer)

Two or more inputs where the output is true when all inputs are false.

#9
Front (Question)

What is an half adder logic?

Back (Answer)

Half adder circuit carries out addition on two numbers (A and B) only

#10
Front (Question)

What is an full adder logic?

Back (Answer)

• Full adder circuit carries out addition on two numbers (A and B) and a carry bit. • A series of full adders can be used to add two binary numbers, as the carry bit is available at each stage of the calculation.

#11
Front (Question)

What is an flip flop?

Back (Answer)

A flip flop is an electronic circuit that has two stable states and can be used as a memory device to store one bit of data

#12
Front (Question)

What is an D type flip flop?

Back (Answer)

A D-type flip flop changes state with each clock pulse, so data is delayed by one clock pulse

#13
Front (Question)

AND logic identities

Back (Answer)

1 . A = A 0 . A = 0 A . A = A A .¯A=0 A . B = B . A A . ( B . C ) = (A . B) . C A + (B . C) = (A + B) . (A + C) A . (A + B) = A

#14
Front (Question)

OR logic identities

Back (Answer)

0 + A = A 1 + A = 1 A + A = A A+¯A=1 A + B = B + A A + (B + C ) = (A + B) +. C A . (B + C) = (A . B) + (A . C) A + (A . B) = A

#15
Front (Question)

How is De Morgan’s law carried out?

Back (Answer)

A .B=¯(¯A+¯B) and A+ B=¯(¯A.¯B) The laws are straightforward to remember as: 1. Change all AND operators to OR 2. Change all OR operators to AND 3. Change the logical state of each variable, so: A=¯( A) and ¯A= A 4. Change the logical state of the complete expression, so: expression=¯expression (and vice versa)