# SLR16 Logic gates and Boolean algebra Flashcards

1
Q

﻿NAND

A

“A logical operator used within a program. NAND is negative-AND. It works by returning FALSE only if all its inputs are TRUE.”

2
Q

NOR

A

“A logical operator used within a program. NOR is negative-OR. It works by returning TRUE if and only if all the inputs are FALSE.”

3
Q

Boolean algebra

A

“A set of rules for manipulating truth values according to truth tables.”

4
Q

Truth table

A

“A notation used in Boolean algebra for defining the output of a logic gate or logic circuit for all possible combinations of inputs.”

5
Q

Logic gate

A

“An elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment, every signal path of a logic gate is in one of the two binary conditions low/off/FALSE (0) or high/on/TRUE (1), represented by different voltage levels.”

6
Q

Circuit diagram

A

“A method of expression Boolean logic in a diagrammatic form using a set of standard symbols representing the various logic gates such as AND, NOT, OR, NAND, etc.”

7
Q

A

8
Q

A

“A unit which adds together two input variables. A full-adder can a bit carried from another addition as well as the two inputs.”

9
Q

D-type flip-flop

A

“Also known as a data or delay flip-flop; this is a circuit or logic design which can be viewed as a memory cell. It has two stable states. Using appropriate input signals, you can trigger the flip-flop from one state to the other.”

10
Q

De Morgan’s law

A

“Two laws in Boolean algebra which state that ‘AND’ and ‘OR’, or union and intersections, are duel.

11
Q

“A logical operator used within a program. NAND is negative-AND. It works by returning FALSE only if all its inputs are TRUE.”

A

NAND

12
Q

“A logical operator used within a program. NOR is negative-OR. It works by returning TRUE if and only if all the inputs are FALSE.”

A

NOR

13
Q

“A set of rules for manipulating truth values according to truth tables.”

A

Boolean algebra

14
Q

“A notation used in Boolean algebra for defining the output of a logic gate or logic circuit for all possible combinations of inputs.”

A

Truth table

15
Q

“An elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment, every signal path of a logic gate is in one of the two binary conditions low/off/FALSE (0) or high/on/TRUE (1), represented by different voltage levels.”

A

Logic gate

16
Q

“A method of expression Boolean logic in a diagrammatic form using a set of standard symbols representing the various logic gates such as AND, NOT, OR, NAND, etc.”

A

Circuit diagram

17
Q

A

18
Q

“A unit which adds together two input variables. A full-adder can a bit carried from another addition as well as the two inputs.”

A

19
Q

“Also known as a data or delay flip-flop; this is a circuit or logic design which can be viewed as a memory cell. It has two stable states. Using appropriate input signals, you can trigger the flip-flop from one state to the other.”

A

D-type flip-flop

20
Q

“Two laws in Boolean algebra which state that ‘AND’ and ‘OR’, or union and intersections, are duel.

A

De Morgan’s law