1. The document discusses binary code and logic gates, which are basic building blocks of digital circuits that perform logical operations. It defines binary code, Boolean data types, and the seven basic logic gates - AND, OR, NOT, NAND, NOR, XOR, and XNOR - and provides their truth tables. 2. It explains that logic gates are typically implemented using transistors, but can also be constructed using other methods like relays, fluids, optics, or mechanical elements. Logic circuits are components of larger devices like registers, memory, and microprocessors that can contain over 100 million gates.

1. Word Puzzle

2. ?
0100110001001111
010001110100100
101000011
LOGIC

3. 0100001001001111
010011110100110
001000101
BOOLE
?

4. 01000010010010010
1001110010000010
101001001011001
BINARY
?

5. Integrated Circuit

6. LOGIC GATES
Bryant S. Calma
Pagsanjan National High School

7. BINARY CODE
 represents text or computer
processor instructions using
the binary number system's two
binary digits, 0 and 1. A binary
code assigns a bit string to each
symbol or instruction.

8. 0 chr(48) 00110000
1 chr(49) 00110001
2 chr(50) 00110010
3 chr(51) 00110011
4 chr(52) 00110100
5 chr(53) 00110101
6 chr(54) 00110110
7 chr(55) 00110111
8 chr(56) 00111000
9 chr(57) 00111001
: chr(58) 00111010
; chr(59) 00111011
< chr(60) 00111100
= chr(61) 00111101
> chr(62) 00111110
? chr(63) 00111111
@ chr(64) 01000000
ASCII (American Standard
Code for Information
Interchange)

9. LOGIC GATE
 is an elementary building block
of a digital circuit.
 is an idealized or physical device
implementing a Boolean
function; that is, it performs a
logical operation on one or more
logic inputs and produces a
single logic output.

10. BOOLEAN DATA TYPE
 is a data type, having two values
(usually denoted true and false),
intended to represent the truth
values of logic and Boolean
algebra.

11. BOOLEAN DATA TYPE
 The Boolean data type is the
primary result of conditional
statements, which allow different
actions and change control
flow depending on whether a
programmer-specified
boolean condition evaluates to true
or false.

12. LOGIC GATE
 There are seven basic logic
gates: AND, OR, XOR, NOT,
NAND, NOR, and XNOR.

13. 1. AND Gate:
 Boolean Algebra:
A · B = C
A & B = C

14. 1. AND Gate: Truth Table
Input 1 Input 2 Output
0 0 0
0 1 0
1 0 0
1 1 1

15. 2. OR Gate:
 Boolean Algebra:
A + B = C

16. 2. OR Gate: Truth Table
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 1

17. 3. NOT Gate:
 Boolean Algebra:
Ᾱ = A
~A = A

18. 3. NOT Gate: Truth Table
Input 1 Output
0 1
1 0

19. 4. NAND Gate:
 Boolean Algebra:
= C

20. 4. NAND Gate: Truth Table
Input 1 Input 2 Output
0 0 1
0 1 1
1 0 1
1 1 0

21. 5. NOR Gate:
 Boolean Algebra:
= C

22. 5. NOR Gate: Truth Table
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 0

23. 6. XOR Gate:
 Boolean Algebra:
= C

24. 6. XOR Gate: Truth Table
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 0

25. 7. XNOR Gate:
 Boolean Algebra:
= C
= C

26. 7. XNOR Gate: Truth Table
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 1

27. LOGIC GATES
 are primarily implemented
using diodes or transistors acting
as electronic switches, but can
also be constructed using
electromagnetic relays (relay
logic), fluidic logic, pneumatic
logic, optics, molecules, or
even mechanical elements.

28. LOGIC GATES
 Logic circuits include such devices
as multiplexers, registers, arithme
tic logic units (ALUs),
and computer memory, all the way
up through
complete microprocessors, which
may contain more than 100 million
gates.

29. WORKSHOP