MEMORY OF COMPUTER: DETAILED EXPLANATION INTRODUCTION MEMORY IN A COMPUTER IS THE MOST ESSENTIAL COMPONENT THAT STORES DATA, INSTRUCTIONS, AND INFORMATION TEMPORARILY OR PERMANENTLY. IT ACTS AS A BRIDGE BETWEEN THE CENTRAL PROCESSING UNIT (CPU) AND THE STORAGE DEVICES, ENSURING SMOOTH DATA PROCESSING AND RETRIEVAL. WITHOUT MEMORY, A COMPUTER CANNOT PERFORM ANY OPERATION. COMPUTER MEMORY IS BROADLY CATEGORIZED BASED ON ACCESS TIME, CAPACITY, COST, AND VOLATILITY . IT DETERMINES THE PERFORMANCE AND EFFICIENCY OF THE ENTIRE SYSTEM. TYPES OF COMPUTER MEMORY COMPUTER MEMORY IS MAINLY DIVIDED INTO PRIMARY MEMORY AND SECONDARY MEMORY , AND ALSO INCLUDES CACHE MEMORY AND VIRTUAL MEMORY AS SPECIAL TYPES. 1. PRIMARY MEMORY (MAIN MEMORY) PRIMARY MEMORY IS DIRECTLY ACCESSIBLE BY THE CPU. IT IS FAST BUT LIMITED IN SIZE AND VOLATILE IN NATURE, MEANING DATA IS LOST WHEN POWER IS TURNED OFF. CHARACTERISTICS: HIGH SPEED LIMITED STORAGE CAPACITY VOLATILE (T...
LOGIC OF COMPUTER IN PAPER AS WELL AS
PRACTICAL USE
WE ALWAYS USE LOGIC IN EVERY DAY MATTERS, SO DO THE MACHINES. BUT WE WERE TAUGHT BY EXPERIENCES WE COUNT AND THE PEOPLE WE TRUST AND THESE THINGS MATTERS MOST BECAUSE IT WILL HELP IN DARK TIMES. BUT TO MAKE THE MACHINE UNDERSTAND THE LOGIC IS VERY HEFTY WORK. BUT THIS IS CERTAINLY NOT IMPOSSIBLE. IN ORDER TO UNDERSTAND LOGIC WE USE INTEGRATED CIRCUITS. BUT TO DO THIS WE NEED TO DESIGN THE INTEGRATED CIRCUITS ON PAPER. THIS REQUIRES CERTAIN RULES OF ALGEBRA. THIS I AM GOING TALK ABOUT THE RULE OF AN ALGEBRA CALLED THE DUALITY PRINCIPAL.
IT STATES THAT EVERY ALGEBRAIC EXPRESSION DEDUCIBLE FROM THE POSTULATES OF BOOLEAN ALGEBRA REMAINS VALID IF THE OPERATORS AND IDENTITY ELEMENTS ARE INTERCHANGED. IN A TWO VALUE BOOLEAN ALGEBRA, THE IDENTITY ELEMENTS AND THE ELEMENTS OF THE SET B ARE SAME 1 AND 0. THE DUALITY PRINCIPAL HAS MANY APPLICATIONS. IF THE DUAL OF AN ALGEBRAIC EXPRESSION IS DESIRED, WE SIMPLY INTERCHANGE OR AND AND OPERATORS AND REPLACE 1’S BY 0’S AND 0’S AND 1’S.
I AM GOING TO SHOW SOME OF THE RULES BELOW WHICH SOME ARE BOOLEAN ALGEBRA THEOREMS AND SOME ARE POSTULATES, THERE IS SOME PROBLEM BECAUSE THE NOTATION CONTAINS SOME . WHICH IS SOMETIMES MISUNDERSTOOD. NOW THE THEOREMS AND POSTULATES LISTED ARE THE MOST BASIC RELATIONSHIPS IN BOOLEAN ALGEBRA. THE THEOREMS, LIKE THE POSTULATES ARE LISTED IN PAIRS EACH RELATION IS DUAL OF THE ONE PAIRED IT. THE POSTULATES ARE BASIC AXIOMS OF THE ALGEBRAIC AND NEED NO PROOF. THE THEOREMS MUST BE PROVEN FROM THE POSTULATES. THE PROOF OF THE THEOREM WITH ONE VARIABLE IS PRESENTED BELOW. AT THE RIGHT IS LISTED THE NUMBER OF POSTULATES WHICH JUSTIFIES EACH STEP OF THE PROOF.
|
POSTULATE 2 |
(A) X + 0 = X |
(B) X.1 = X |
|
POSTULATE 5 |
(A) X+ X’=1 |
(B) X*X’ = 0 |
|
THEOREM 1 |
(A) X + X=X |
(B)X*X=X |
|
THEOREM 2 |
(A)X + 1= 1 |
(B)X*0=0 |
|
THEOREM 3, INVOLUTION |
(A)(X’)’ =X |
|
|
POSTULATE 3 COMMUTATIVE |
(A) X + Y = Y + X |
XY = YX |
|
THEOREM 4 ASSOCIATIVE |
(A) X + (Y + Z) = (X + Y) + Z |
(B) X(YZ) = (XY)Z |
|
POSTULATE 4 DISTRIBUTIVE |
(A)X(Y+Z) = XY +XZ |
(B) X + YZ=(X + Y)(X + Z) |
|
THEOREM 5, DEMORGAN |
(A)(X+Y)’ = X’Y’ |
(B) (XY) = X’ + Y’ |
|
THEOREM 6, ABSORPTION |
(A) X + XY = X |
(B) X(X+Y) = X |
|
|
|
|
YOU MAY LIKE THIS: INKJET PRINTER
YOU MAY LIKE THIS: HOW TO CONFIGURE VIRTUAL MEMORY?
Comments
Post a Comment