{"id":3253,"date":"2025-06-05T14:58:57","date_gmt":"2025-06-05T14:58:57","guid":{"rendered":"https:\/\/diznr.com\/?p=3253"},"modified":"2025-06-05T14:58:57","modified_gmt":"2025-06-05T14:58:57","slug":"part-01-operating-systems-memory-representation-techniques-byte-addressable-and-addressable-word","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/part-01-operating-systems-memory-representation-techniques-byte-addressable-and-addressable-word\/","title":{"rendered":"Part 01- Operating Systems &#8211; Memory representation Techniques Byte Addressable and Word Addressable"},"content":{"rendered":"<p>Part 01- Operating Systems &#8211; Memory representation Techniques Byte Addressable and Word Addressable<\/p>\n<p>[fvplayer id=&#8221;320&#8243;]<\/p>\n<h3 data-start=\"0\" data-end=\"62\"><strong data-start=\"4\" data-end=\"60\">Operating Systems &#8211; Memory Representation Techniques<\/strong><\/h3>\n<h4 data-start=\"63\" data-end=\"125\"><strong data-start=\"68\" data-end=\"123\">Part 01: Byte Addressable &amp; Word Addressable Memory<\/strong><\/h4>\n<p data-start=\"127\" data-end=\"332\">Memory representation techniques determine how data is stored and accessed in a computer system. The two main types of addressing techniques are <strong data-start=\"272\" data-end=\"299\">Byte Addressable Memory<\/strong> and <strong data-start=\"304\" data-end=\"331\">Word Addressable Memory<\/strong>.<\/p>\n<h3 data-start=\"339\" data-end=\"374\"><strong data-start=\"342\" data-end=\"372\">1. Byte Addressable Memory<\/strong><\/h3>\n<p data-start=\"375\" data-end=\"553\">In a <strong data-start=\"380\" data-end=\"400\">byte-addressable<\/strong> memory system, each individual <strong data-start=\"432\" data-end=\"449\">byte (8 bits)<\/strong> has a unique address. This means that the smallest unit of memory that can be accessed is <strong data-start=\"540\" data-end=\"552\">one byte<\/strong>.<\/p>\n<h3 data-start=\"555\" data-end=\"579\"><strong data-start=\"559\" data-end=\"579\">Characteristics:<\/strong><\/h3>\n<p data-start=\"580\" data-end=\"772\">\u00a0Each memory address refers to a <strong data-start=\"614\" data-end=\"638\">single byte (8 bits)<\/strong>.<br data-start=\"639\" data-end=\"642\" \/>\u00a0Common in <strong data-start=\"654\" data-end=\"687\">modern computer architectures<\/strong> (x86, ARM).<br data-start=\"699\" data-end=\"702\" \/>\u00a0Supports variable-sized data types (1-byte, 2-byte, 4-byte, etc.).<\/p>\n<h3 data-start=\"774\" data-end=\"792\"><strong data-start=\"778\" data-end=\"790\">Example:<\/strong><\/h3>\n<p data-start=\"793\" data-end=\"856\">Assume we have a <strong data-start=\"810\" data-end=\"834\">32-bit memory system<\/strong> (4 bytes per word).<\/p>\n<ul data-start=\"857\" data-end=\"960\">\n<li data-start=\"857\" data-end=\"902\">Address <code data-start=\"867\" data-end=\"873\">1000<\/code> stores <strong data-start=\"881\" data-end=\"891\">1 byte<\/strong> of data.<\/li>\n<li data-start=\"903\" data-end=\"960\">Address <code data-start=\"913\" data-end=\"919\">1001<\/code> stores the next <strong data-start=\"936\" data-end=\"946\">1 byte<\/strong>, and so on.<\/li>\n<\/ul>\n<table data-start=\"962\" data-end=\"1149\">\n<thead data-start=\"962\" data-end=\"994\">\n<tr data-start=\"962\" data-end=\"994\">\n<th data-start=\"962\" data-end=\"979\">Memory Address<\/th>\n<th data-start=\"979\" data-end=\"994\">Data Stored<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1026\" data-end=\"1149\">\n<tr data-start=\"1026\" data-end=\"1056\">\n<td>1000<\/td>\n<td>10101010<\/td>\n<\/tr>\n<tr data-start=\"1057\" data-end=\"1087\">\n<td>1001<\/td>\n<td>11001100<\/td>\n<\/tr>\n<tr data-start=\"1088\" data-end=\"1118\">\n<td>1002<\/td>\n<td>11110000<\/td>\n<\/tr>\n<tr data-start=\"1119\" data-end=\"1149\">\n<td>1003<\/td>\n<td>00001111<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p data-start=\"1151\" data-end=\"1250\">\u00a0If we want to fetch a <strong data-start=\"1176\" data-end=\"1194\">4-byte integer<\/strong>, the CPU will read <strong data-start=\"1214\" data-end=\"1249\">four consecutive byte addresses<\/strong>.<\/p>\n<h3 data-start=\"1257\" data-end=\"1292\"><strong data-start=\"1260\" data-end=\"1290\">2. Word Addressable Memory<\/strong><\/h3>\n<p data-start=\"1293\" data-end=\"1456\">In a <strong data-start=\"1298\" data-end=\"1318\">word-addressable<\/strong> memory system, the smallest unit that can be addressed is a <strong data-start=\"1379\" data-end=\"1387\">word<\/strong>, which may be <strong data-start=\"1402\" data-end=\"1425\">2, 4, or more bytes<\/strong> depending on the architecture.<\/p>\n<h3 data-start=\"1458\" data-end=\"1482\"><strong data-start=\"1462\" data-end=\"1482\">Characteristics:<\/strong><\/h3>\n<p data-start=\"1483\" data-end=\"1677\">\u00a0Each memory address refers to a <strong data-start=\"1517\" data-end=\"1525\">word<\/strong> instead of a byte.<br data-start=\"1544\" data-end=\"1547\" \/>\u00a0Mostly found in <strong data-start=\"1565\" data-end=\"1619\">older architectures (mainframes, embedded systems)<\/strong>.<br data-start=\"1620\" data-end=\"1623\" \/>\u00a0More efficient for <strong data-start=\"1644\" data-end=\"1674\">fixed-size data processing<\/strong>.<\/p>\n<h3 data-start=\"1679\" data-end=\"1697\"><strong data-start=\"1683\" data-end=\"1695\">Example:<\/strong><\/h3>\n<p data-start=\"1698\" data-end=\"1753\">Assume a <strong data-start=\"1707\" data-end=\"1731\">word size of 4 bytes<\/strong> (32-bit word size).<\/p>\n<ul data-start=\"1754\" data-end=\"1894\">\n<li data-start=\"1754\" data-end=\"1810\">Address <code data-start=\"1764\" data-end=\"1770\">1000<\/code> refers to a <strong data-start=\"1783\" data-end=\"1807\">whole word (4 bytes)<\/strong>.<\/li>\n<li data-start=\"1811\" data-end=\"1894\">Address <code data-start=\"1821\" data-end=\"1827\">1001<\/code> does not exist (because each address represents an entire word).<\/li>\n<\/ul>\n<table data-start=\"1896\" data-end=\"2117\">\n<thead data-start=\"1896\" data-end=\"1936\">\n<tr data-start=\"1896\" data-end=\"1936\">\n<th data-start=\"1896\" data-end=\"1911\">Word Address<\/th>\n<th data-start=\"1911\" data-end=\"1936\">Data Stored (4 Bytes)<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1972\" data-end=\"2117\">\n<tr data-start=\"1972\" data-end=\"2024\">\n<td>1000<\/td>\n<td>10101010 11001100 11110000 00001111<\/td>\n<\/tr>\n<tr data-start=\"2025\" data-end=\"2055\">\n<td>1001<\/td>\n<td>Not Available<\/td>\n<\/tr>\n<tr data-start=\"2056\" data-end=\"2086\">\n<td>1002<\/td>\n<td>Not Available<\/td>\n<\/tr>\n<tr data-start=\"2087\" data-end=\"2117\">\n<td>1003<\/td>\n<td>Not Available<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p data-start=\"2119\" data-end=\"2238\">\u00a0Here, fetching a <strong data-start=\"2139\" data-end=\"2157\">4-byte integer<\/strong> requires a single memory access, making it <strong data-start=\"2201\" data-end=\"2237\">faster for fixed-size operations<\/strong>.<\/p>\n<h3 data-start=\"2245\" data-end=\"2309\"><strong data-start=\"2248\" data-end=\"2309\">3. Key Differences Between Byte &amp; Word Addressable Memory<\/strong><\/h3>\n<table data-start=\"2310\" data-end=\"2744\">\n<thead data-start=\"2310\" data-end=\"2359\">\n<tr data-start=\"2310\" data-end=\"2359\">\n<th data-start=\"2310\" data-end=\"2320\">Feature<\/th>\n<th data-start=\"2320\" data-end=\"2339\">Byte Addressable<\/th>\n<th data-start=\"2339\" data-end=\"2359\">Word Addressable<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"2406\" data-end=\"2744\">\n<tr data-start=\"2406\" data-end=\"2484\">\n<td>Smallest Addressable Unit<\/td>\n<td>1 Byte (8 bits)<\/td>\n<td>1 Word (2, 4, or more bytes)<\/td>\n<\/tr>\n<tr data-start=\"2485\" data-end=\"2560\">\n<td>Common In<\/td>\n<td>Modern systems (PCs, smartphones)<\/td>\n<td>Older\/mainframe systems<\/td>\n<\/tr>\n<tr data-start=\"2561\" data-end=\"2667\">\n<td>Flexibility<\/td>\n<td>Supports different data sizes (1, 2, 4, 8 bytes)<\/td>\n<td>Limited flexibility (fixed word size)<\/td>\n<\/tr>\n<tr data-start=\"2668\" data-end=\"2744\">\n<td>Efficiency<\/td>\n<td>Better for variable data<\/td>\n<td>Faster for fixed-size processing<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h3 data-start=\"2751\" data-end=\"2783\"><strong data-start=\"2754\" data-end=\"2783\">4. Real-Life Applications<\/strong><\/h3>\n<ul data-start=\"2784\" data-end=\"3121\">\n<li data-start=\"2784\" data-end=\"2945\"><strong data-start=\"2786\" data-end=\"2813\">Byte Addressable Memory<\/strong>: Used in <strong data-start=\"2823\" data-end=\"2874\">general-purpose computers, laptops, smartphones<\/strong>, where different data types (char, int, float) need efficient storage.<\/li>\n<li data-start=\"2946\" data-end=\"3121\"><strong data-start=\"2948\" data-end=\"2975\">Word Addressable Memory<\/strong>: Used in <strong data-start=\"2985\" data-end=\"3072\">high-performance computing, DSPs (Digital Signal Processors), some embedded systems<\/strong>, where fixed-size operations are more efficient.<\/li>\n<\/ul>\n<h2 data-start=\"3128\" data-end=\"3145\"><strong data-start=\"3131\" data-end=\"3145\">Conclusion<\/strong><\/h2>\n<ul data-start=\"3146\" data-end=\"3410\">\n<li data-start=\"3146\" data-end=\"3220\"><strong data-start=\"3148\" data-end=\"3201\">Most modern computers use Byte Addressable Memory<\/strong> for flexibility.<\/li>\n<li data-start=\"3221\" data-end=\"3323\"><strong data-start=\"3223\" data-end=\"3292\">Word Addressable Memory is efficient for specialized applications<\/strong> like high-speed computation.<\/li>\n<li data-start=\"3324\" data-end=\"3410\">Understanding these techniques helps in <strong data-start=\"3366\" data-end=\"3407\">system design and memory optimization<\/strong>.<\/li>\n<\/ul>\n<p data-start=\"3412\" data-end=\"3521\" data-is-last-node=\"\" data-is-only-node=\"\">Would you like <strong data-start=\"3427\" data-end=\"3473\">examples of memory addressing calculations<\/strong> or more details on how <strong data-start=\"3497\" data-end=\"3517\">CPU fetches data<\/strong>?<\/p>\n<h3 data-start=\"3412\" data-end=\"3521\"><a href=\"https:\/\/www.cse.cuhk.edu.hk\/~mcyang\/csci2510\/2019F\/Lec03%20Memory%20Basics.pdf\" target=\"_blank\" rel=\"noopener\">Part 01- Operating Systems &#8211; Memory representation Techniques Byte Addressable and Word Addressable<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/sriindu.ac.in\/wp-content\/uploads\/2023\/10\/R20CSE2202-OPERATING-SYSTEMS.pdf\" target=\"_blank\" rel=\"noopener\">OPERATING SYSTEM Lecture Notes On<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/sist.sathyabama.ac.in\/sist_coursematerial\/uploads\/SBS1206.pdf\" target=\"_blank\" rel=\"noopener\">UNIT \u2013 I \u2013 Operating System \u2013 SBS1206<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.vssut.ac.in\/lecture_notes\/lecture1423726024.pdf\" target=\"_blank\" rel=\"noopener\">Operating System<\/a><\/h3>\n<p data-start=\"0\" data-end=\"53\">Certainly! Here&#8217;s a clear and concise explanation of:<\/p>\n<hr data-start=\"55\" data-end=\"58\" \/>\n<h2 data-start=\"60\" data-end=\"133\">\ud83c\udf93 <strong data-start=\"66\" data-end=\"131\">Operating Systems \u2013 Part 01: Memory Representation Techniques<\/strong><\/h2>\n<h3 data-start=\"134\" data-end=\"188\">\ud83d\udcd8 <strong data-start=\"141\" data-end=\"188\">Byte Addressable vs Word Addressable Memory<\/strong><\/h3>\n<hr data-start=\"190\" data-end=\"193\" \/>\n<h2 data-start=\"195\" data-end=\"234\">\ud83e\udde0 <strong data-start=\"201\" data-end=\"234\">1. What is Memory Addressing?<\/strong><\/h2>\n<p data-start=\"236\" data-end=\"436\">Memory addressing refers to how memory locations are identified and accessed. The <strong data-start=\"318\" data-end=\"343\">Operating System (OS)<\/strong> and <strong data-start=\"348\" data-end=\"368\">CPU architecture<\/strong> define how data is stored and retrieved from <strong data-start=\"414\" data-end=\"435\">main memory (RAM)<\/strong>.<\/p>\n<hr data-start=\"438\" data-end=\"441\" \/>\n<h2 data-start=\"443\" data-end=\"479\">\ud83d\udd39 <strong data-start=\"449\" data-end=\"479\">2. Byte Addressable Memory<\/strong><\/h2>\n<h3 data-start=\"481\" data-end=\"503\">\ud83d\udccc <strong data-start=\"488\" data-end=\"503\">Definition:<\/strong><\/h3>\n<p data-start=\"504\" data-end=\"596\">In <strong data-start=\"507\" data-end=\"534\">byte-addressable memory<\/strong>, <strong data-start=\"536\" data-end=\"587\">each memory address points to one byte (8 bits)<\/strong> of data.<\/p>\n<h3 data-start=\"598\" data-end=\"616\">\u2705 <strong data-start=\"604\" data-end=\"616\">Example:<\/strong><\/h3>\n<div class=\"_tableContainer_16hzy_1\">\n<div class=\"_tableWrapper_16hzy_14 group flex w-fit flex-col-reverse\">\n<table class=\"w-fit min-w-(--thread-content-width)\" data-start=\"618\" data-end=\"727\">\n<thead data-start=\"618\" data-end=\"639\">\n<tr data-start=\"618\" data-end=\"639\">\n<th data-start=\"618\" data-end=\"628\" data-col-size=\"sm\">Address<\/th>\n<th data-start=\"628\" data-end=\"639\" data-col-size=\"sm\">Content<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"662\" data-end=\"727\">\n<tr data-start=\"662\" data-end=\"683\">\n<td data-start=\"662\" data-end=\"672\" data-col-size=\"sm\">1000<\/td>\n<td data-col-size=\"sm\" data-start=\"672\" data-end=\"683\">A<\/td>\n<\/tr>\n<tr data-start=\"684\" data-end=\"705\">\n<td data-start=\"684\" data-end=\"694\" data-col-size=\"sm\">1001<\/td>\n<td data-start=\"694\" data-end=\"705\" data-col-size=\"sm\">B<\/td>\n<\/tr>\n<tr data-start=\"706\" data-end=\"727\">\n<td data-start=\"706\" data-end=\"716\" data-col-size=\"sm\">1002<\/td>\n<td data-start=\"716\" data-end=\"727\" data-col-size=\"sm\">C<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<div class=\"sticky end-(--thread-content-margin) h-0 self-end select-none\">\n<div class=\"absolute end-0 flex items-end\"><\/div>\n<\/div>\n<\/div>\n<\/div>\n<p data-start=\"729\" data-end=\"808\">If a variable is 4 bytes, and starts at address 1000, it occupies 1000 to 1003.<\/p>\n<h3 data-start=\"810\" data-end=\"831\">\ud83d\udcca <strong data-start=\"817\" data-end=\"831\">Common In:<\/strong><\/h3>\n<ul data-start=\"832\" data-end=\"923\">\n<li data-start=\"832\" data-end=\"885\">\n<p data-start=\"834\" data-end=\"885\">Most modern computers (e.g., Intel, ARM processors)<\/p>\n<\/li>\n<li data-start=\"886\" data-end=\"923\">\n<p data-start=\"888\" data-end=\"923\">Easy to manipulate individual bytes<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"925\" data-end=\"928\" \/>\n<h2 data-start=\"930\" data-end=\"966\">\ud83d\udd39 <strong data-start=\"936\" data-end=\"966\">3. Word Addressable Memory<\/strong><\/h2>\n<h3 data-start=\"968\" data-end=\"990\">\ud83d\udccc <strong data-start=\"975\" data-end=\"990\">Definition:<\/strong><\/h3>\n<p data-start=\"991\" data-end=\"1154\">In <strong data-start=\"994\" data-end=\"1021\">word-addressable memory<\/strong>, <strong data-start=\"1023\" data-end=\"1056\">each address refers to a word<\/strong>, not a byte. A <strong data-start=\"1072\" data-end=\"1080\">word<\/strong> is a group of bytes (typically 2, 4, or 8 bytes depending on the system).<\/p>\n<h3 data-start=\"1156\" data-end=\"1174\">\u2705 <strong data-start=\"1162\" data-end=\"1174\">Example:<\/strong><\/h3>\n<p data-start=\"1175\" data-end=\"1257\">If the <strong data-start=\"1182\" data-end=\"1205\">word size = 4 bytes<\/strong>, and the address 1000 refers to a full 4-byte word:<\/p>\n<div class=\"_tableContainer_16hzy_1\">\n<div class=\"_tableWrapper_16hzy_14 group flex w-fit flex-col-reverse\">\n<table class=\"w-fit min-w-(--thread-content-width)\" data-start=\"1259\" data-end=\"1376\">\n<thead data-start=\"1259\" data-end=\"1286\">\n<tr data-start=\"1259\" data-end=\"1286\">\n<th data-start=\"1259\" data-end=\"1269\" data-col-size=\"sm\">Address<\/th>\n<th data-start=\"1269\" data-end=\"1286\" data-col-size=\"sm\">Content<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1315\" data-end=\"1376\">\n<tr data-start=\"1315\" data-end=\"1346\">\n<td data-start=\"1315\" data-end=\"1325\" data-col-size=\"sm\">1000<\/td>\n<td data-start=\"1325\" data-end=\"1346\" data-col-size=\"sm\">A B C D (4 bytes)<\/td>\n<\/tr>\n<tr data-start=\"1347\" data-end=\"1376\">\n<td data-start=\"1347\" data-end=\"1357\" data-col-size=\"sm\">1001<\/td>\n<td data-start=\"1357\" data-end=\"1376\" data-col-size=\"sm\">E F G H<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<div class=\"sticky end-(--thread-content-margin) h-0 self-end select-none\">\n<div class=\"absolute end-0 flex items-end\"><\/div>\n<\/div>\n<\/div>\n<\/div>\n<p data-start=\"1378\" data-end=\"1426\">You <strong data-start=\"1382\" data-end=\"1392\">cannot<\/strong> directly access individual bytes.<\/p>\n<hr data-start=\"1428\" data-end=\"1431\" \/>\n<h2 data-start=\"1433\" data-end=\"1461\">\ud83d\udd0d <strong data-start=\"1439\" data-end=\"1461\">4. Key Differences<\/strong><\/h2>\n<div class=\"_tableContainer_16hzy_1\">\n<div class=\"_tableWrapper_16hzy_14 group flex w-fit flex-col-reverse\">\n<table class=\"w-fit min-w-(--thread-content-width)\" data-start=\"1463\" data-end=\"1967\">\n<thead data-start=\"1463\" data-end=\"1544\">\n<tr data-start=\"1463\" data-end=\"1544\">\n<th data-start=\"1463\" data-end=\"1486\" data-col-size=\"sm\">Feature<\/th>\n<th data-start=\"1486\" data-end=\"1514\" data-col-size=\"sm\">Byte Addressable<\/th>\n<th data-start=\"1514\" data-end=\"1544\" data-col-size=\"sm\">Word Addressable<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1627\" data-end=\"1967\">\n<tr data-start=\"1627\" data-end=\"1708\">\n<td data-start=\"1627\" data-end=\"1650\" data-col-size=\"sm\">Address unit<\/td>\n<td data-start=\"1650\" data-end=\"1678\" data-col-size=\"sm\">1 byte<\/td>\n<td data-col-size=\"sm\" data-start=\"1678\" data-end=\"1708\">1 word (e.g., 4 bytes)<\/td>\n<\/tr>\n<tr data-start=\"1709\" data-end=\"1790\">\n<td data-start=\"1709\" data-end=\"1732\" data-col-size=\"sm\">Flexibility<\/td>\n<td data-col-size=\"sm\" data-start=\"1732\" data-end=\"1760\">High (can access bytes)<\/td>\n<td data-col-size=\"sm\" data-start=\"1760\" data-end=\"1790\">Less flexible<\/td>\n<\/tr>\n<tr data-start=\"1791\" data-end=\"1880\">\n<td data-start=\"1791\" data-end=\"1814\" data-col-size=\"sm\">Memory usage<\/td>\n<td data-col-size=\"sm\" data-start=\"1814\" data-end=\"1842\">Slightly more overhead<\/td>\n<td data-col-size=\"sm\" data-start=\"1842\" data-end=\"1880\">More efficient in block operations<\/td>\n<\/tr>\n<tr data-start=\"1881\" data-end=\"1967\">\n<td data-start=\"1881\" data-end=\"1904\" data-col-size=\"sm\">Used in<\/td>\n<td data-col-size=\"sm\" data-start=\"1904\" data-end=\"1932\">Modern computers<\/td>\n<td data-col-size=\"sm\" data-start=\"1932\" data-end=\"1967\">Some embedded or legacy systems<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<div class=\"sticky end-(--thread-content-margin) h-0 self-end select-none\">\n<div class=\"absolute end-0 flex items-end\"><\/div>\n<\/div>\n<\/div>\n<\/div>\n<hr data-start=\"1969\" data-end=\"1972\" \/>\n<h2 data-start=\"1974\" data-end=\"2008\">\ud83d\udca1 <strong data-start=\"1980\" data-end=\"2008\">5. Why It Matters in OS:<\/strong><\/h2>\n<ul data-start=\"2010\" data-end=\"2172\">\n<li data-start=\"2010\" data-end=\"2055\">\n<p data-start=\"2012\" data-end=\"2055\">Affects how <strong data-start=\"2024\" data-end=\"2040\">instructions<\/strong> access memory.<\/p>\n<\/li>\n<li data-start=\"2056\" data-end=\"2108\">\n<p data-start=\"2058\" data-end=\"2108\">Influences <strong data-start=\"2069\" data-end=\"2107\">instruction set architecture (ISA)<\/strong>.<\/p>\n<\/li>\n<li data-start=\"2109\" data-end=\"2172\">\n<p data-start=\"2111\" data-end=\"2172\">Impacts <strong data-start=\"2119\" data-end=\"2132\">alignment<\/strong>, <strong data-start=\"2134\" data-end=\"2146\">pointers<\/strong>, and <strong data-start=\"2152\" data-end=\"2171\">data structures<\/strong>.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"2174\" data-end=\"2177\" \/>\n<h2 data-start=\"2179\" data-end=\"2214\">\ud83e\uddea <strong data-start=\"2185\" data-end=\"2214\">Example for GATE \/ Exams:<\/strong><\/h2>\n<p data-start=\"2216\" data-end=\"2351\"><strong data-start=\"2216\" data-end=\"2222\">Q:<\/strong> A system uses 32-bit word-addressable memory and each word has 4 bytes. What is the size of the memory if it has 2^20 addresses?<\/p>\n<p data-start=\"2353\" data-end=\"2400\"><strong data-start=\"2353\" data-end=\"2359\">A:<\/strong><br data-start=\"2359\" data-end=\"2362\" \/>Memory size = 2\u00b2\u2070 * 4 bytes = <strong data-start=\"2392\" data-end=\"2400\">4 MB<\/strong><\/p>\n<hr data-start=\"2402\" data-end=\"2405\" \/>\n<h2 data-start=\"2407\" data-end=\"2421\">\ud83d\udcdd Summary:<\/h2>\n<div class=\"_tableContainer_16hzy_1\">\n<div class=\"_tableWrapper_16hzy_14 group flex w-fit flex-col-reverse\">\n<table class=\"w-fit min-w-(--thread-content-width)\" data-start=\"2423\" data-end=\"2742\">\n<thead data-start=\"2423\" data-end=\"2484\">\n<tr data-start=\"2423\" data-end=\"2484\">\n<th data-start=\"2423\" data-end=\"2445\" data-col-size=\"sm\">Concept<\/th>\n<th data-start=\"2445\" data-end=\"2464\" data-col-size=\"sm\">Byte Addressable<\/th>\n<th data-start=\"2464\" data-end=\"2484\" data-col-size=\"sm\">Word Addressable<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"2547\" data-end=\"2742\">\n<tr data-start=\"2547\" data-end=\"2608\">\n<td data-start=\"2547\" data-end=\"2569\" data-col-size=\"sm\">Address granularity<\/td>\n<td data-start=\"2569\" data-end=\"2588\" data-col-size=\"sm\">Byte<\/td>\n<td data-start=\"2588\" data-end=\"2608\" data-col-size=\"sm\">Word<\/td>\n<\/tr>\n<tr data-start=\"2609\" data-end=\"2675\">\n<td data-start=\"2609\" data-end=\"2631\" data-col-size=\"sm\">Ease of access<\/td>\n<td data-col-size=\"sm\" data-start=\"2631\" data-end=\"2650\">High<\/td>\n<td data-col-size=\"sm\" data-start=\"2650\" data-end=\"2675\">Lower (at byte level)<\/td>\n<\/tr>\n<tr data-start=\"2676\" data-end=\"2742\">\n<td data-start=\"2676\" data-end=\"2698\" data-col-size=\"sm\">Example processors<\/td>\n<td data-start=\"2698\" data-end=\"2717\" data-col-size=\"sm\">Intel, ARM<\/td>\n<td data-start=\"2717\" data-end=\"2742\" data-col-size=\"sm\">Some DSP, old systems<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<div class=\"sticky end-(--thread-content-margin) h-0 self-end select-none\">\n<div class=\"absolute end-0 flex items-end\"><\/div>\n<\/div>\n<\/div>\n<\/div>\n<hr data-start=\"2744\" data-end=\"2747\" \/>\n<p data-start=\"2749\" data-end=\"2843\">Would you like:<br \/>\n\u2705 A visual diagram for this?<br data-start=\"2793\" data-end=\"2796\" \/>\u2705 Practice questions or memory layout problems?<\/p>\n<p data-start=\"2845\" data-end=\"2857\" data-is-last-node=\"\" data-is-only-node=\"\">Let me know!<\/p>\n<h3 data-start=\"2845\" data-end=\"2857\"><a href=\"https:\/\/www.kdkce.edu.in\/pdf\/Unit%20No%204%20O.S%20Notes.pdf\" target=\"_blank\" rel=\"noopener\">Part 01- Operating Systems &#8211; Memory representation Techniques Byte Addressable and Word Addressable<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/cvbl.iiita.ac.in\/sks\/coa-files\/tutorial\/Tutorial-4.pdf\" target=\"_blank\" rel=\"noopener\">Computer Organization and Architecture Tutorial Session<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/vardhaman.org\/wp-content\/uploads\/2021\/03\/CO.pdf\" target=\"_blank\" rel=\"noopener\">COMPUTER ORGANIZATION AND ARCHITECTURE<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.sathyabama.ac.in\/sites\/default\/files\/course-material\/2020-10\/Unit3_2.pdf\" target=\"_blank\" rel=\"noopener\">UNIT III Memory Organization<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.recw.ac.in\/v2.0\/wp-content\/uploads\/2019\/04\/co-unit3.pdf\" target=\"_blank\" rel=\"noopener\">UNIT-III THE MEMORY SYSTEM<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"http:\/\/www.cectl.ac.in\/images\/pdf_docs\/studymaterial\/cse\/S4\/coa4.pdf\" target=\"_blank\" rel=\"noopener\">computer organization and architecture<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Part 01- Operating Systems &#8211; Memory representation Techniques Byte Addressable and Word Addressable [fvplayer id=&#8221;320&#8243;] Operating Systems &#8211; Memory Representation Techniques Part 01: Byte Addressable &amp; Word Addressable Memory Memory representation techniques determine how data is stored and accessed in a computer system. The two main types of addressing techniques are Byte Addressable Memory and [&hellip;]<\/p>\n","protected":false},"author":66,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[78],"tags":[],"class_list":["post-3253","post","type-post","status-publish","format-standard","hentry","category-operating-system"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3253","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/comments?post=3253"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3253\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3253"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3253"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3253"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}