{"id":3252,"date":"2025-06-07T14:54:28","date_gmt":"2025-06-07T14:54:28","guid":{"rendered":"https:\/\/diznr.com\/?p=3252"},"modified":"2025-06-07T14:54:28","modified_gmt":"2025-06-07T14:54:28","slug":"part-01-examples-based-on-memory-representation-techniques-byte-addressable-and-addressable-word","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/part-01-examples-based-on-memory-representation-techniques-byte-addressable-and-addressable-word\/","title":{"rendered":"Part 01- Examples Based on Memory representation Techniques Byte Addressable and Word Addressable."},"content":{"rendered":"<p>Part 01- Examples Based on Memory representation Techniques Byte Addressable and Word Addressable.<\/p>\n<p>[fvplayer id=&#8221;319&#8243;]<\/p>\n<h3 class=\"\" data-start=\"0\" data-end=\"79\"><strong data-start=\"4\" data-end=\"77\">Memory Representation Techniques: Byte Addressable &amp; Word Addressable<\/strong><\/h3>\n<p class=\"\" data-start=\"81\" data-end=\"157\">In <strong data-start=\"84\" data-end=\"109\">computer architecture<\/strong>, memory can be organized in two primary ways:<\/p>\n<ol data-start=\"158\" data-end=\"223\">\n<li class=\"\" data-start=\"158\" data-end=\"190\">\n<p class=\"\" data-start=\"161\" data-end=\"190\"><strong data-start=\"161\" data-end=\"188\">Byte Addressable Memory<\/strong><\/p>\n<\/li>\n<li class=\"\" data-start=\"191\" data-end=\"223\">\n<p class=\"\" data-start=\"194\" data-end=\"223\"><strong data-start=\"194\" data-end=\"221\">Word Addressable Memory<\/strong><\/p>\n<\/li>\n<\/ol>\n<p class=\"\" data-start=\"225\" data-end=\"291\">Each method defines <strong data-start=\"245\" data-end=\"280\">how data is stored and accessed<\/strong> in memory.<\/p>\n<h3 data-start=\"298\" data-end=\"336\"><strong data-start=\"301\" data-end=\"334\">\u00a01. Byte Addressable Memory<\/strong><\/h3>\n<p class=\"\" data-start=\"337\" data-end=\"573\">\u00a0In <strong data-start=\"342\" data-end=\"369\">byte addressable memory<\/strong>, each <strong data-start=\"376\" data-end=\"404\">individual byte (8 bits)<\/strong> has a unique memory address.<br data-start=\"433\" data-end=\"436\" \/>\u00a0This is the most commonly used method in modern computers.<br data-start=\"496\" data-end=\"499\" \/>\u00a0Used in systems with <strong data-start=\"522\" data-end=\"570\">8-bit, 16-bit, 32-bit, and 64-bit processors<\/strong>.<\/p>\n<p class=\"\" data-start=\"575\" data-end=\"686\"><strong data-start=\"577\" data-end=\"589\">Example:<\/strong><br data-start=\"589\" data-end=\"592\" \/>Assume a memory system with <strong data-start=\"620\" data-end=\"645\">4-byte (32-bit) words<\/strong> stored in <strong data-start=\"656\" data-end=\"683\">byte-addressable memory<\/strong>.<\/p>\n<div class=\"overflow-x-auto contain-inline-size\">\n<table data-start=\"688\" data-end=\"846\">\n<thead data-start=\"688\" data-end=\"715\">\n<tr data-start=\"688\" data-end=\"715\">\n<th data-start=\"688\" data-end=\"698\">Address<\/th>\n<th data-start=\"698\" data-end=\"715\">Data (1 Byte)<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"743\" data-end=\"846\">\n<tr data-start=\"743\" data-end=\"768\">\n<td>1000<\/td>\n<td>10<\/td>\n<\/tr>\n<tr data-start=\"769\" data-end=\"794\">\n<td>1001<\/td>\n<td>20<\/td>\n<\/tr>\n<tr data-start=\"795\" data-end=\"820\">\n<td>1002<\/td>\n<td>30<\/td>\n<\/tr>\n<tr data-start=\"821\" data-end=\"846\">\n<td>1003<\/td>\n<td>40<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<ul data-start=\"848\" data-end=\"992\">\n<li class=\"\" data-start=\"848\" data-end=\"911\">\n<p class=\"\" data-start=\"850\" data-end=\"911\">Here, <strong data-start=\"856\" data-end=\"908\">each byte has its own address (1000, 1001, etc.)<\/strong>.<\/p>\n<\/li>\n<li class=\"\" data-start=\"912\" data-end=\"992\">\n<p class=\"\" data-start=\"914\" data-end=\"992\">If the processor is <strong data-start=\"934\" data-end=\"944\">32-bit<\/strong>, it fetches <strong data-start=\"957\" data-end=\"989\">4 bytes (one word) at a time<\/strong>.<\/p>\n<\/li>\n<\/ul>\n<p class=\"\" data-start=\"994\" data-end=\"1066\">\u00a0To fetch a <strong data-start=\"1007\" data-end=\"1015\">word<\/strong> (4 bytes) at <strong data-start=\"1029\" data-end=\"1045\">address 1000<\/strong>, the system reads:<\/p>\n<p><span class=\"katex-display\"><span class=\"katex\"><span class=\"katex-mathml\">Word=[1000,1001,1002,1003]\\text{Word} = [1000, 1001, 1002, 1003]<\/span><span class=\"katex-html\" aria-hidden=\"true\"><span class=\"base\"><span class=\"mord text\"><span class=\"mord\">Word<\/span><\/span><span class=\"mrel\">=<\/span><\/span><span class=\"base\"><span class=\"mopen\">[<\/span><span class=\"mord\">1000<\/span><span class=\"mpunct\">,<\/span><span class=\"mord\">1001<\/span><span class=\"mpunct\">,<\/span><span class=\"mord\">1002<\/span><span class=\"mpunct\">,<\/span><span class=\"mord\">1003<\/span><span class=\"mclose\">]<\/span><\/span><\/span><\/span><\/span><\/p>\n<h3 data-start=\"1120\" data-end=\"1158\"><strong data-start=\"1123\" data-end=\"1156\">\u00a02. Word Addressable Memory<\/strong><\/h3>\n<p class=\"\" data-start=\"1159\" data-end=\"1397\">\u00a0In <strong data-start=\"1164\" data-end=\"1191\">word addressable memory<\/strong>, each <strong data-start=\"1198\" data-end=\"1206\">word<\/strong> (not byte) has a unique address.<br data-start=\"1239\" data-end=\"1242\" \/>\u00a0A <strong data-start=\"1246\" data-end=\"1254\">word<\/strong> consists of multiple bytes (e.g., 2, 4, or 8 bytes).<br data-start=\"1307\" data-end=\"1310\" \/>\u00a0Used in <strong data-start=\"1320\" data-end=\"1352\">older computer architectures<\/strong> like <strong data-start=\"1358\" data-end=\"1394\">Digital Signal Processors (DSPs)<\/strong>.<\/p>\n<p class=\"\" data-start=\"1399\" data-end=\"1503\"><strong data-start=\"1401\" data-end=\"1413\">Example:<\/strong><br data-start=\"1413\" data-end=\"1416\" \/>Assume a <strong data-start=\"1425\" data-end=\"1442\">16-bit system<\/strong> with <strong data-start=\"1448\" data-end=\"1464\">2-byte words<\/strong> stored in <strong data-start=\"1475\" data-end=\"1502\">word-addressable memory<\/strong>.<\/p>\n<div class=\"overflow-x-auto contain-inline-size\">\n<table data-start=\"1505\" data-end=\"1666\">\n<thead data-start=\"1505\" data-end=\"1538\">\n<tr data-start=\"1505\" data-end=\"1538\">\n<th data-start=\"1505\" data-end=\"1520\">Word Address<\/th>\n<th data-start=\"1520\" data-end=\"1538\">Data (2 Bytes)<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1571\" data-end=\"1666\">\n<tr data-start=\"1571\" data-end=\"1602\">\n<td>1000<\/td>\n<td>10 20<\/td>\n<\/tr>\n<tr data-start=\"1603\" data-end=\"1634\">\n<td>1001<\/td>\n<td>30 40<\/td>\n<\/tr>\n<tr data-start=\"1635\" data-end=\"1666\">\n<td>1002<\/td>\n<td>50 60<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<p class=\"\" data-start=\"1668\" data-end=\"1771\">\u00a0Each <strong data-start=\"1675\" data-end=\"1716\">word address refers to multiple bytes<\/strong>.<br data-start=\"1717\" data-end=\"1720\" \/>\u00a0If we request <strong data-start=\"1736\" data-end=\"1749\">Word 1001<\/strong>, we get <strong data-start=\"1758\" data-end=\"1770\">[30, 40]<\/strong>.<\/p>\n<h3 data-start=\"1778\" data-end=\"1839\"><strong data-start=\"1781\" data-end=\"1837\">\u00a0Difference Between Byte &amp; Word Addressable Memory<\/strong><\/h3>\n<div class=\"overflow-x-auto contain-inline-size\">\n<table data-start=\"1841\" data-end=\"2289\">\n<thead data-start=\"1841\" data-end=\"1916\">\n<tr data-start=\"1841\" data-end=\"1916\">\n<th data-start=\"1841\" data-end=\"1863\">Feature<\/th>\n<th data-start=\"1863\" data-end=\"1889\">Byte Addressable Memory<\/th>\n<th data-start=\"1889\" data-end=\"1916\">Word Addressable Memory<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1991\" data-end=\"2289\">\n<tr data-start=\"1991\" data-end=\"2063\">\n<td>Addressing Unit<\/td>\n<td>Byte (8 bits)<\/td>\n<td>Word (multiple bytes)<\/td>\n<\/tr>\n<tr data-start=\"2064\" data-end=\"2131\">\n<td>Memory Usage<\/td>\n<td>Efficient for small data<\/td>\n<td>May waste space<\/td>\n<\/tr>\n<tr data-start=\"2132\" data-end=\"2207\">\n<td>Access Speed<\/td>\n<td>Slower (more addresses)<\/td>\n<td>Faster (fewer addresses)<\/td>\n<\/tr>\n<tr data-start=\"2208\" data-end=\"2289\">\n<td>Example Systems<\/td>\n<td>Modern computers (Intel, ARM)<\/td>\n<td>Some DSPs, older systems<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<h3 data-start=\"2296\" data-end=\"2315\"><strong data-start=\"2299\" data-end=\"2313\">Summary<\/strong><\/h3>\n<p class=\"\" data-start=\"2316\" data-end=\"2519\"><strong data-start=\"2318\" data-end=\"2345\">Byte Addressable Memory<\/strong> \u2192 Each <strong data-start=\"2353\" data-end=\"2361\">byte<\/strong> has an address (used in modern computers).<br data-start=\"2404\" data-end=\"2407\" \/><strong data-start=\"2409\" data-end=\"2436\">Word Addressable Memory<\/strong> \u2192 Each <strong data-start=\"2444\" data-end=\"2452\">word<\/strong> (2, 4, or 8 bytes) has an address (used in older architectures).<\/p>\n<p class=\"\" data-start=\"2521\" data-end=\"2592\">Would you like more <strong data-start=\"2541\" data-end=\"2563\">numerical examples<\/strong> or <strong data-start=\"2567\" data-end=\"2588\">detailed diagrams<\/strong>?<\/p>\n<h3 data-start=\"2521\" data-end=\"2592\"><a href=\"https:\/\/cvbl.iiita.ac.in\/sks\/coa-files\/tutorial\/Tutorial-4.pdf\" target=\"_blank\" rel=\"noopener\">Part 01- Examples Based on Memory representation Techniques Byte Addressable and Word Addressable.<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.marian.ac.in\/public\/images\/uploads\/COA-Mod-1.pdf\" target=\"_blank\" rel=\"noopener\">CST202 &#8211; Computer Organization and Architecture Module: 1<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.lkouniv.ac.in\/site\/writereaddata\/siteContent\/202003271505203215anshu_singh_instructional_formats.pdf\" target=\"_blank\" rel=\"noopener\">Instruction Formats (Zero, One, Two and Three Address &#8230;<\/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\">Unit: III Lecture: 6 (Memory Management) &#8230;<\/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:\/\/cs.wellesley.edu\/~cs240\/f15\/slides\/mem.pdf\" target=\"_blank\" rel=\"noopener\">Byte-\u2010Addressable Memory<\/a><\/h3>\n<p data-start=\"0\" data-end=\"174\">\u092f\u0939\u093e\u0901 <strong data-start=\"5\" data-end=\"115\">Part 01: Examples Based on Memory Representation Techniques \u2013 Byte Addressable and Word Addressable Memory<\/strong> \u0915\u093e \u0935\u093f\u0938\u094d\u0924\u093e\u0930\u092a\u0942\u0930\u094d\u0935\u0915 \u0914\u0930 \u0906\u0938\u093e\u0928 \u0939\u093f\u0902\u0926\u0940 \u092e\u0947\u0902 \u0938\u094d\u092a\u0937\u094d\u091f\u0940\u0915\u0930\u0923 \u0926\u093f\u092f\u093e \u0917\u092f\u093e \u0939\u0948:<\/p>\n<hr data-start=\"176\" data-end=\"179\" \/>\n<h2 data-start=\"181\" data-end=\"270\">\ud83d\udcd8 <strong data-start=\"187\" data-end=\"270\">Part 01: Memory Representation Techniques \u2013 Byte Addressable &amp; Word Addressable<\/strong><\/h2>\n<p data-start=\"272\" data-end=\"357\">\u0915\u0902\u092a\u094d\u092f\u0942\u091f\u0930 \u092e\u0947\u0902 \u0921\u0947\u091f\u093e \u0915\u094b \u092e\u0947\u092e\u094b\u0930\u0940 \u092e\u0947\u0902 \u0938\u0902\u0917\u094d\u0930\u0939\u093f\u0924 (store) \u0915\u0930\u0928\u0947 \u0915\u0947 \u0932\u093f\u090f \u0926\u094b \u092e\u0941\u0916\u094d\u092f \u0924\u0930\u0940\u0915\u0947 \u0939\u094b\u0924\u0947 \u0939\u0948\u0902:<\/p>\n<h3 data-start=\"359\" data-end=\"396\">1\ufe0f\u20e3 <strong data-start=\"367\" data-end=\"394\">Byte Addressable Memory<\/strong><\/h3>\n<h3 data-start=\"397\" data-end=\"432\">2\ufe0f\u20e3 <strong data-start=\"405\" data-end=\"432\">Word Addressable Memory<\/strong><\/h3>\n<hr data-start=\"434\" data-end=\"437\" \/>\n<h3 data-start=\"439\" data-end=\"489\">\u2705 <strong data-start=\"445\" data-end=\"489\">1. Byte Addressable Memory \u0915\u094d\u092f\u093e \u0939\u094b\u0924\u093e \u0939\u0948?<\/strong><\/h3>\n<ul data-start=\"491\" data-end=\"639\">\n<li data-start=\"491\" data-end=\"537\">\n<p data-start=\"493\" data-end=\"537\">\u0907\u0938\u092e\u0947\u0902 <strong data-start=\"499\" data-end=\"528\">\u0939\u0930 \u090f\u0915 byte \u0915\u093e \u0905\u0932\u0917 address<\/strong> \u0939\u094b\u0924\u093e \u0939\u0948\u0964<\/p>\n<\/li>\n<li data-start=\"538\" data-end=\"639\">\n<p data-start=\"540\" data-end=\"639\">\u092e\u093e\u0928 \u0932\u0940\u091c\u093f\u090f \u090f\u0915 word = 4 bytes \u0915\u093e \u0939\u0948, \u0924\u094b \u090f\u0915 word \u0915\u0947 \u0932\u093f\u090f <strong data-start=\"593\" data-end=\"620\">4 \u0932\u0917\u093e\u0924\u093e\u0930 byte addresses<\/strong> \u0907\u0938\u094d\u0924\u0947\u092e\u093e\u0932 \u0939\u094b\u0924\u0947 \u0939\u0948\u0902\u0964<\/p>\n<\/li>\n<\/ul>\n<h4 data-start=\"641\" data-end=\"661\">\ud83e\uddee <strong data-start=\"649\" data-end=\"661\">Example:<\/strong><\/h4>\n<p data-start=\"662\" data-end=\"691\">\u092e\u093e\u0928 \u0932\u0940\u091c\u093f\u090f word size = 4 bytes<\/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=\"693\" data-end=\"836\">\n<thead data-start=\"693\" data-end=\"716\">\n<tr data-start=\"693\" data-end=\"716\">\n<th data-start=\"693\" data-end=\"708\" data-col-size=\"sm\">Byte Address<\/th>\n<th data-start=\"708\" data-end=\"716\" data-col-size=\"sm\">Data<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"741\" data-end=\"836\">\n<tr data-start=\"741\" data-end=\"764\">\n<td data-start=\"741\" data-end=\"756\" data-col-size=\"sm\">1000<\/td>\n<td data-col-size=\"sm\" data-start=\"756\" data-end=\"764\">A1<\/td>\n<\/tr>\n<tr data-start=\"765\" data-end=\"788\">\n<td data-start=\"765\" data-end=\"780\" data-col-size=\"sm\">1001<\/td>\n<td data-col-size=\"sm\" data-start=\"780\" data-end=\"788\">A2<\/td>\n<\/tr>\n<tr data-start=\"789\" data-end=\"812\">\n<td data-start=\"789\" data-end=\"804\" data-col-size=\"sm\">1002<\/td>\n<td data-col-size=\"sm\" data-start=\"804\" data-end=\"812\">A3<\/td>\n<\/tr>\n<tr data-start=\"813\" data-end=\"836\">\n<td data-start=\"813\" data-end=\"828\" data-col-size=\"sm\">1003<\/td>\n<td data-col-size=\"sm\" data-start=\"828\" data-end=\"836\">A4<\/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=\"838\" data-end=\"905\">\u27a1\ufe0f \u092a\u0942\u0930\u093e word = A1 A2 A3 A4<br data-start=\"864\" data-end=\"867\" \/>\u27a1\ufe0f Starting address of the word = 1000<\/p>\n<hr data-start=\"907\" data-end=\"910\" \/>\n<h3 data-start=\"912\" data-end=\"962\">\u2705 <strong data-start=\"918\" data-end=\"962\">2. Word Addressable Memory \u0915\u094d\u092f\u093e \u0939\u094b\u0924\u093e \u0939\u0948?<\/strong><\/h3>\n<ul data-start=\"964\" data-end=\"1077\">\n<li data-start=\"964\" data-end=\"1013\">\n<p data-start=\"966\" data-end=\"1013\">\u0907\u0938\u092e\u0947\u0902 <strong data-start=\"972\" data-end=\"1004\">\u0939\u0930 word \u0915\u093e \u090f\u0915 unique address<\/strong> \u0939\u094b\u0924\u093e \u0939\u0948\u0964<\/p>\n<\/li>\n<li data-start=\"1014\" data-end=\"1077\">\n<p data-start=\"1016\" data-end=\"1077\">\u090f\u0915 word \u092e\u0947\u0902 \u0915\u0908 bytes \u0939\u094b \u0938\u0915\u0924\u0947 \u0939\u0948\u0902 (\u091c\u0948\u0938\u0947 2 bytes, 4 bytes etc.)<\/p>\n<\/li>\n<\/ul>\n<h4 data-start=\"1079\" data-end=\"1099\">\ud83e\uddee <strong data-start=\"1087\" data-end=\"1099\">Example:<\/strong><\/h4>\n<p data-start=\"1100\" data-end=\"1129\">\u092e\u093e\u0928 \u0932\u0940\u091c\u093f\u090f word size = 4 bytes<\/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=\"1131\" data-end=\"1313\">\n<thead data-start=\"1131\" data-end=\"1166\">\n<tr data-start=\"1131\" data-end=\"1166\">\n<th data-start=\"1131\" data-end=\"1146\" data-col-size=\"sm\">Word Address<\/th>\n<th data-start=\"1146\" data-end=\"1166\" data-col-size=\"sm\">Data (4 Bytes)<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1203\" data-end=\"1313\">\n<tr data-start=\"1203\" data-end=\"1239\">\n<td data-start=\"1203\" data-end=\"1218\" data-col-size=\"sm\">100<\/td>\n<td data-col-size=\"sm\" data-start=\"1218\" data-end=\"1239\">A1 A2 A3 A4<\/td>\n<\/tr>\n<tr data-start=\"1240\" data-end=\"1276\">\n<td data-start=\"1240\" data-end=\"1255\" data-col-size=\"sm\">101<\/td>\n<td data-col-size=\"sm\" data-start=\"1255\" data-end=\"1276\">B1 B2 B3 B4<\/td>\n<\/tr>\n<tr data-start=\"1277\" data-end=\"1313\">\n<td data-start=\"1277\" data-end=\"1292\" data-col-size=\"sm\">102<\/td>\n<td data-col-size=\"sm\" data-start=\"1292\" data-end=\"1313\">C1 C2 C3 C4<\/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=\"1315\" data-end=\"1398\">\u27a1\ufe0f Word address 100 \u0915\u093e \u092e\u0924\u0932\u092c \u0939\u0948 bytes 0\u20133<br data-start=\"1355\" data-end=\"1358\" \/>\u27a1\ufe0f Word address 101 \u0915\u093e \u092e\u0924\u0932\u092c \u0939\u0948 bytes 4\u20137<\/p>\n<hr data-start=\"1400\" data-end=\"1403\" \/>\n<h3 data-start=\"1405\" data-end=\"1473\">\ud83d\udd04 <strong data-start=\"1412\" data-end=\"1473\">Byte Addressable vs Word Addressable \u2013 \u0924\u0941\u0932\u0928\u093e (Comparison)<\/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=\"1475\" data-end=\"2093\">\n<thead data-start=\"1475\" data-end=\"1578\">\n<tr data-start=\"1475\" data-end=\"1578\">\n<th data-start=\"1475\" data-end=\"1505\" data-col-size=\"sm\">Feature<\/th>\n<th data-start=\"1505\" data-end=\"1540\" data-col-size=\"sm\">Byte Addressable<\/th>\n<th data-start=\"1540\" data-end=\"1578\" data-col-size=\"sm\">Word Addressable<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"1682\" data-end=\"2093\">\n<tr data-start=\"1682\" data-end=\"1784\">\n<td data-start=\"1682\" data-end=\"1711\" data-col-size=\"sm\">Address Unit<\/td>\n<td data-col-size=\"sm\" data-start=\"1711\" data-end=\"1746\">1 byte<\/td>\n<td data-col-size=\"sm\" data-start=\"1746\" data-end=\"1784\">1 word (e.g., 4 bytes)<\/td>\n<\/tr>\n<tr data-start=\"1785\" data-end=\"1887\">\n<td data-start=\"1785\" data-end=\"1814\" data-col-size=\"sm\">Memory Efficient For<\/td>\n<td data-col-size=\"sm\" data-start=\"1814\" data-end=\"1849\">Character-level operations<\/td>\n<td data-col-size=\"sm\" data-start=\"1849\" data-end=\"1887\">Word-level data like integers<\/td>\n<\/tr>\n<tr data-start=\"1888\" data-end=\"1990\">\n<td data-start=\"1888\" data-end=\"1917\" data-col-size=\"sm\">More Address Lines Needed?<\/td>\n<td data-col-size=\"sm\" data-start=\"1917\" data-end=\"1952\">Yes (more fine-grain control)<\/td>\n<td data-col-size=\"sm\" data-start=\"1952\" data-end=\"1990\">No (fewer address lines)<\/td>\n<\/tr>\n<tr data-start=\"1991\" data-end=\"2093\">\n<td data-start=\"1991\" data-end=\"2020\" data-col-size=\"sm\">Common In<\/td>\n<td data-col-size=\"sm\" data-start=\"2020\" data-end=\"2055\">Modern CPUs (x86, ARM)<\/td>\n<td data-col-size=\"sm\" data-start=\"2055\" data-end=\"2093\">Some older\/embedded 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=\"2095\" data-end=\"2098\" \/>\n<h3 data-start=\"2100\" data-end=\"2157\">\ud83e\udde0 <strong data-start=\"2107\" data-end=\"2157\">Important Concept: Number of Addressable Units<\/strong><\/h3>\n<p data-start=\"2159\" data-end=\"2223\"><strong data-start=\"2159\" data-end=\"2223\">If memory size = 1 KB (1024 Bytes), and word size = 4 bytes:<\/strong><\/p>\n<ul data-start=\"2225\" data-end=\"2396\">\n<li data-start=\"2225\" data-end=\"2305\">\n<p data-start=\"2227\" data-end=\"2258\">In <strong data-start=\"2230\" data-end=\"2250\">byte addressable<\/strong> memory:<\/p>\n<ul data-start=\"2261\" data-end=\"2305\">\n<li data-start=\"2261\" data-end=\"2305\">\n<p data-start=\"2263\" data-end=\"2305\">Total addresses = 1024 (one for each byte)<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<li data-start=\"2306\" data-end=\"2396\">\n<p data-start=\"2308\" data-end=\"2339\">In <strong data-start=\"2311\" data-end=\"2331\">word addressable<\/strong> memory:<\/p>\n<ul data-start=\"2342\" data-end=\"2396\">\n<li data-start=\"2342\" data-end=\"2396\">\n<p data-start=\"2344\" data-end=\"2396\">Total addresses = 1024 \/ 4 = 256 (one for each word)<\/p>\n<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<hr data-start=\"2398\" data-end=\"2401\" \/>\n<h3 data-start=\"2403\" data-end=\"2440\">\ud83d\udcdd <strong data-start=\"2410\" data-end=\"2440\">Practice Example Question:<\/strong><\/h3>\n<p data-start=\"2442\" data-end=\"2563\"><strong data-start=\"2442\" data-end=\"2563\">Q. A system has 16-bit word and uses word-addressable memory. How many addresses are needed to access 4 KB of memory?<\/strong><\/p>\n<p data-start=\"2565\" data-end=\"2656\">\u27a1\ufe0f 4 KB = 4096 Bytes<br data-start=\"2585\" data-end=\"2588\" \/>\u27a1\ufe0f 1 word = 2 bytes<br data-start=\"2607\" data-end=\"2610\" \/>\u27a1\ufe0f Number of words = 4096 \/ 2 = <strong data-start=\"2642\" data-end=\"2656\">2048 words<\/strong><\/p>\n<p data-start=\"2658\" data-end=\"2695\">\ud83c\udd70\ufe0f <strong data-start=\"2662\" data-end=\"2695\">Answer: 2048 addresses needed<\/strong><\/p>\n<hr data-start=\"2697\" data-end=\"2700\" \/>\n<p data-start=\"2702\" data-end=\"2826\" data-is-last-node=\"\" data-is-only-node=\"\">\u0905\u0917\u0930 \u0906\u092a \u091a\u093e\u0939\u0947\u0902, \u0924\u094b \u092e\u0948\u0902 \u0907\u0938 \u091f\u0949\u092a\u093f\u0915 \u092a\u0930 \u0906\u0927\u093e\u0930\u093f\u0924 <strong data-start=\"2742\" data-end=\"2750\">MCQs<\/strong>, <strong data-start=\"2752\" data-end=\"2765\">PDF Notes<\/strong>, \u092f\u093e <strong data-start=\"2770\" data-end=\"2789\">Visual Diagrams<\/strong> \u092d\u0940 \u092c\u0928\u093e \u0938\u0915\u0924\u093e \u0939\u0942\u0901\u0964 \u0915\u094d\u092f\u093e \u0906\u092a \u0935\u0939 \u091a\u093e\u0939\u0947\u0902\u0917\u0947?<\/p>\n<h3 data-start=\"2702\" data-end=\"2826\"><a href=\"http:\/\/www.cse.cuhk.edu.hk\/~mcyang\/csci2510\/2019F\/Lec03%20Memory%20Basics.pdf\" target=\"_blank\" rel=\"noopener\">Part 01- Examples Based on Memory representation Techniques Byte Addressable and Word Addressable.<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/uomustansiriyah.edu.iq\/media\/lectures\/9\/9_2021_12_01!10_35_17_PM.pdf\" target=\"_blank\" rel=\"noopener\">Chapter Two: Memory Locations and Addressing<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Part 01- Examples Based on Memory representation Techniques Byte Addressable and Word Addressable. [fvplayer id=&#8221;319&#8243;] Memory Representation Techniques: Byte Addressable &amp; Word Addressable In computer architecture, memory can be organized in two primary ways: Byte Addressable Memory Word Addressable Memory Each method defines how data is stored and accessed in memory. \u00a01. Byte Addressable Memory [&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-3252","post","type-post","status-publish","format-standard","hentry","category-operating-system"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3252","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=3252"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3252\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3252"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3252"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3252"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}