Binary arithmetic
Addition of binary
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 =0, carry 1 on the next bit
Subtraction of binary
0 - 0 = 0
0 - 1 = 1, barrow 1 on the next bit
1 - 0 = 1
1 - 1 = 0
Multiplication of binary
0 x 0 = 0
0 x 1 = 0
1 x 0 = 0
1 x 1 = 1
Division of binary
*kailangan lang marunong ka ng multiplication and subtraction ng binary.
Logic gates
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjhKZ39Eg6aPSkQ0Mf9fAjiSW_dbRMofh31DW9glmnQggDH1WT8WhyP3qxFERNoT60mFj7qbeVi6lAl2ZpQvNR5yTJjAQgFiZ22uJBvE6LGg9oPMg47gDrMcor1I8nidYlVTxkluHzrAaw/s320/symtab.gif)
Truth table is a representation that helps the function of the logic gates.
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiy7pFOUN_uhHFlSVTX4Yv3nN_6TsiJJvm2UH9P9-8jlb9YHSaNh4UsEFnz9KM_qEZVtfjNqT9RwvhgcPJHyKpNEhxMXntQca4v1OEXlHYSTBn7yZo0t1VrA2JgPQ_SG-FufRLKRRsIJlg/s1600/nottable.gif)
![](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi-Qp8hWhXJSyqCjrJJfzjpSWZUKHv1t_vbbSgIrADJVyvvwoc2OL-yTsfbN68VBy9fs3UZMXE5Wu9xDuBg96C0Mg6uLUljxF2KRPyeOyw8m8XXLQ_Vo7YpMAz_3ZJ7epSTTNXivZgjATA/s320/summarytable.gif)
Floating point arithmetic is used in computer programming to represent large numbers. The way the program represents large numbers is to raise a stated number to a certain power, or exponent. This way, larger numbers can be fed into a computer program.
Boolean algebra is a deductive mathematical system closed over the values zero and one (false and true). A binary operator “°” deļ¬ned over this set of values accepts a pair of boolean inputs and produces a single boolean value.
P1: X = 0 or X = 1
P2: 0 . 0 = 0
P3: 1 + 1 = 1
P4: 0 + 0 = 0
P5: 1 . 1 = 1
P6: 1 . 0 = 0 . 1 = 0
P7: 1 + 0 = 0 + 1 = 1
T1 : Commutative Law
(a) A + B = B + A
(b) A B = B A
T2 : Associate Law
(a) (A + B) + C = A + (B + C)
(b) (A B) C = A (B C)
T3 : Distributive Law
(a) A (B + C) = A B + A C
(b) A + (B C) = (A + B) (A + C)
T4 : Identity Law
(a) A + A = A
(b) A A = A
T5 :
(a)
(b)![](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_sP8EP6Mcry_pbC8qJoj4rVnrfkU_vw2g4QH8tVXhGJTRiXPzEiiKe-ANmKh_AhwbTKF9uAy31pDEkGTzJqniEF2TcIKlf5KLpUARwDiP7f_EbiaTmr3en8vbK6r8iYD07FY7xOLSPFk9nOs4X5_ZE=s0-d)
T6 : Redundance Law
(a) A + A B = A
(b) A (A + B) = A
T7 :
(a) 0 + A = A
(b) 0 A = 0
T8 :
(a) 1 + A = 1
(b) 1 A = A
T9 :
(a)
(b)![](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_v53Rvu393gv-UHjPF9T2fWGGOLBJJBxA-89WWhak0k8-Ltt4NA1jwQ0o9Ow7ZZ_nbLZUM-qM-skRboIf1wbBL5M6aOaet5txZpvsnQQK87Gi7wLlzNp_Vv8IXmX0Qq09gLk9-3DNiLAvRBMAdMREs=s0-d)
T10 :
(a)
(b)![](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_s4H9S8lwv-h2iW8qs-_wtb7Z_04pEMorEXzmKCMWVIG9aesnbUbHQG9dTkPMBsbJH3twDEmJJF1ARUcbJqyETfZwppDkmK3yyOkCBNx1gYDLMlI0yZhPb6DEiiXMgKYo1PPyHO71qkgzpc97HCp8J8=s0-d)
T11 : De Morgan's Theorem
(a)
(b)![](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_sWK6ARnYbuuyGxTK6OSrxE8MVB0FndiFd-ZHS5TwJJ2_uU-0Jj1RBOgo2_kXK8exW-zLy3U4KgrofuQMOvqfNMrKU8z0SFUr0FIHXhyJ-tyIAi7NkIAj_O0C7TgItrZ7YO8JMNT_xdIp1EDUdIkr7c=s0-d)
Reference:
http://mathworld.wolfram.com/BooleanAlgebra.html
http://www.ehow.com/how_7312481_tutorial-standard-floating-point-numbers.html
(b)
T6 : Redundance Law
(a) A + A B = A
(b) A (A + B) = A
T7 :
(a) 0 + A = A
(b) 0 A = 0
T8 :
(a) 1 + A = 1
(b) 1 A = A
T9 :
(a)
(b)
T10 :
(a)
(b)
T11 : De Morgan's Theorem
(a)
(b)
Reference:
http://mathworld.wolfram.com/BooleanAlgebra.html
http://www.ehow.com/how_7312481_tutorial-standard-floating-point-numbers.html
Walang komento:
Mag-post ng isang Komento