Page 8 - FUNDAMENTALS OF COMPUTER
P. 8
NPP
3.12 Basic Identities in Boolean Algebra ............................................................... 169
3.13 De Morgan’s Theorems ................................................................................. 171
3.14 Simplification of Boolean Functions .............................................................. 173
3.15 Implementation Using Basic Gates ............................................................... 176
3.16 To Obtain Expression from Logic .................................................................. 179
3.17 NAND-NAND and NOR-NOR Implementation............................................... 183
3.18 Representation of Boolean Expression ......................................................... 194
3.19 Fundamental Product and Fundamental Sum ............................................... 195
3.20 Minterms and Maxterms ................................................................................ 198
3.21 Finding an expression for the output............................................................. 199
3.22 Finding the expression in POS form ............................................................. 204
3.23 Karnaugh Map ............................................................................................... 205
3.24 Logical Circuit Design ................................................................................... 212
3.25 To Obtain the Solution in POS Form............................................................. 230
3.26 Representation of Binary Integers ................................................................. 258
3.27 8-bit representation of signed numbers ......................................................... 260
3.28 Binary Addition .............................................................................................. 263
3.29 Binary Subtraction ......................................................................................... 265
3.30 Binary Multiplication (Unsigned Integers) ...................................................... 267
3.31 Binary Division (Restoring Method or Long-hand Method) ........................... 273
3.32 9’s Complement and 10’s Complement......................................................... 275
3.33 1’s and 2’s Complement................................................................................ 279
3.34 Signed Integer Arithmetic .............................................................................. 283
3.35 Logic Gates ................................................................................................... 289
3.36 Basic Gates (Fundamental Gates) ................................................................ 289
3.37 Exclusive NOR Gate (XNOR)........................................................................ 302
3.38 XNOR Gate Properties & use in computer ................................................... 303
3.39 Implementation Using NAND and NOR gates............................................... 304
3.40 Application of Gates ...................................................................................... 307
3.41 Positive and Negative Logic .......................................................................... 307
NPP / Fundamentals of Computers / 8
