Historical Computer Engineering - Logical Circuits
Mode: Visitor // Expert
Language: Deutsch English

Logical Circuits

AND (Conjunction)

Get Adobe Flash Player

Introduction

The AND gate has two AND-combined input terminals.
If both input terminals are true, the output will also be true.
This means that the output Z will be HIGH (1), if input-terminal A and input-terminal B are HIGH (1). Otherwise the output Z will be LOW (0).

Example

claim: You are a man and I am a man.
(If both you and I are men, the claim will be true. It will be false, if at least one of us is not a man.)
If... the claim will be...
no one is a man, False
I'm a man, False
you're a man, False
we noth are men, True

claim (Z) = You (A) and me (B) are men.
A B Z
No man. No man. False
No man. Man. False
Man. No man. False
Man. Man. True

Z = You AND me are men.
1: We're men / true
0: At most one of us is a man / false

Truth table

Z = A AND B
A B Z
0 0 0
0 1 0
1 0 0
1 1 1

Functional equation

Functional equation of AND

Electronic Symbol

Symbol of AND

Exercises

claim: Lisa and Tina both swim in the swimming pool .

If Tina swims in the swimming pool and Lisa eats ice cream at the café, the claim will be __________.
false
If Tina swims on the left side and Lisa swims on the right side of the swimming pool, the claim will be __________.
true

Specials

It is possible to build this gate just from NAND gates:
AND from NANDs

CMOS implementation

Get Adobe Flash Player