switching theory and logic design

Get Started. It's Free
or sign up with your email address
Rocket clouds
switching theory and logic design by Mind Map: switching theory and logic design

1. boolean algebra

1.1. properties and theorems of boolean algebra

1.1.1. identity property

1.1.2. commutative property

1.1.3. distributive property

1.1.4. associative property

1.1.5. complement property

1.1.6. idempotency property

1.1.7. inversion property

1.1.8. absorption property

1.1.9. OR laws

1.1.10. XOR property

1.1.10.1. xor is associative

1.1.10.2. xor is commutative

1.1.11. AND laws

1.1.12. de-morgan's theorem

1.2. representation of boolean functions

1.2.1. minterms and maxterns

1.2.2. standard forms

1.2.3. conversion between standard forms

1.3. principle of duality

2. Number Systems

2.1. binary numbering system

2.1.1. decimal to binary conversion

2.1.2. binary to octal conversion

2.2. octal numbering system

2.2.1. octal to decimal conversion

2.2.2. decimal to octal conversion

2.2.3. octal to binary conversion

2.2.4. hexodecimalto decimal conversion

2.3. hexadecimal numbering system

2.3.1. decimal to hexadecimal conversion

2.3.2. hexadecimalto binary conversion

2.3.3. binary to hexadecimalc onversion

2.3.4. hexadecimal to octal conversion

2.3.5. octal to hexadecimal conversion

2.3.6. 1's and 2's complement

2.3.6.1. subtraction using them

2.3.6.2. signed binary representation

2.4. any number ystem

2.4.1. any number system to decimal conversion

2.4.2. decimal to any number system conversion

2.4.3. any number system to another any number system conversion

2.5. complement of numbers

2.5.1. 9's and 10's complement

2.5.1.1. subtraction using them

2.5.1.2. signed binary representation

2.5.2. r's and (r-1)'s complement

2.5.2.1. subtraction using them

2.5.2.2. signed binary representation

2.6. codes

2.6.1. weighted binary codes

2.6.1.1. binary code

2.6.1.2. binary to decimal conversion

2.6.1.3. binary coded decimal (BCD)

2.6.1.3.1. 8421

2.6.1.3.2. 2421

2.6.1.3.3. 3321

2.6.1.3.4. 4221

2.6.1.3.5. 5211

2.6.1.3.6. 5311

2.6.1.3.7. 5421

2.6.1.3.8. 6311

2.6.1.3.9. 7421

2.6.2. non-weighted binary codes

2.6.2.1. excess-3 code

2.6.2.2. gray code

2.6.2.2.1. gray to binary conversion

2.6.2.2.2. binary to gray conversion

2.6.2.3. five-bit bcd code

2.6.3. reflective codes

2.6.3.1. 2421

2.6.3.2. excess-3 code

2.6.3.2.1. excess-3 addition

2.6.3.3. 5211

2.6.4. alpha numeric codes

2.6.4.1. ASCII

2.6.4.2. EBCDIC

2.6.4.3. hollerith

2.6.5. sequential codes

2.6.5.1. 8421

2.6.5.2. excess-3 code

2.6.6. error detecting and correcting codes

2.6.6.1. hamming code

2.6.6.2. parity bit

2.6.7. unit distance codes

3. logic gates

3.1. basic gate

3.1.1. AND gate

3.1.2. OR gate

3.1.3. NOT(inverter) gate

3.1.4. buffer gate

3.2. universal gates

3.2.1. NAND gate

3.2.2. NOR gate

3.3. special function gates

3.3.1. EX-OR gate

3.3.2. EX-NOR gate