{"id":3256,"date":"2025-06-05T15:04:21","date_gmt":"2025-06-05T15:04:21","guid":{"rendered":"https:\/\/diznr.com\/?p=3256"},"modified":"2025-06-05T15:04:21","modified_gmt":"2025-06-05T15:04:21","slug":"part-01-operating-system-lecture-for-gate-computer-science-memory-management-and-application-its","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/part-01-operating-system-lecture-for-gate-computer-science-memory-management-and-application-its\/","title":{"rendered":"Part 01- Operating System Lecture for Gate Computer Science- Memory management and it&#8217;s application."},"content":{"rendered":"<p>Part 01- Operating System Lecture for Gate Computer Science- Memory management and it&#8217;s application.<\/p>\n<p>[fvplayer id=&#8221;321&#8243;]<\/p>\n<h3 data-start=\"0\" data-end=\"60\"><strong data-start=\"4\" data-end=\"58\">Operating System Lecture for GATE Computer Science<\/strong><\/h3>\n<h4 data-start=\"61\" data-end=\"117\"><strong data-start=\"66\" data-end=\"115\">Part 01: Memory Management &amp; Its Applications<\/strong><\/h4>\n<h3 data-start=\"124\" data-end=\"167\"><strong data-start=\"127\" data-end=\"167\">1. Introduction to Memory Management<\/strong><\/h3>\n<p data-start=\"168\" data-end=\"403\">Memory management is a crucial function of an operating system (OS) that handles the allocation and deallocation of memory for processes. It ensures efficient utilization of memory while preventing conflicts between different programs.<\/p>\n<h3 data-start=\"405\" data-end=\"448\"><strong data-start=\"409\" data-end=\"448\">Key Functions of Memory Management:<\/strong><\/h3>\n<ul data-start=\"449\" data-end=\"829\">\n<li data-start=\"449\" data-end=\"525\"><strong data-start=\"451\" data-end=\"473\">Process Isolation:<\/strong> Prevents one process from interfering with another.<\/li>\n<li data-start=\"526\" data-end=\"596\"><strong data-start=\"528\" data-end=\"558\">Allocation &amp; Deallocation:<\/strong> Dynamically assigns memory as needed.<\/li>\n<li data-start=\"597\" data-end=\"672\"><strong data-start=\"599\" data-end=\"624\">Multitasking Support:<\/strong> Enables multiple processes to run concurrently.<\/li>\n<li data-start=\"673\" data-end=\"745\"><strong data-start=\"675\" data-end=\"697\">Memory Protection:<\/strong> Prevents unauthorized access to memory regions.<\/li>\n<li data-start=\"746\" data-end=\"829\"><strong data-start=\"748\" data-end=\"774\">Efficient Utilization:<\/strong> Maximizes memory usage while minimizing fragmentation.<\/li>\n<\/ul>\n<h3 data-start=\"836\" data-end=\"870\"><strong data-start=\"839\" data-end=\"870\">2. Types of Memory in an OS<\/strong><\/h3>\n<ol data-start=\"871\" data-end=\"1182\">\n<li data-start=\"871\" data-end=\"945\"><strong data-start=\"874\" data-end=\"899\">Primary Memory (RAM):<\/strong> Volatile memory used for executing processes.<\/li>\n<li data-start=\"946\" data-end=\"1032\"><strong data-start=\"949\" data-end=\"987\">Secondary Memory (Hard Disk, SSD):<\/strong> Non-volatile storage for programs and files.<\/li>\n<li data-start=\"1033\" data-end=\"1105\"><strong data-start=\"1036\" data-end=\"1053\">Cache Memory:<\/strong> Faster memory that stores frequently accessed data.<\/li>\n<li data-start=\"1106\" data-end=\"1182\"><strong data-start=\"1109\" data-end=\"1128\">Virtual Memory:<\/strong> Simulated memory that extends RAM using disk storage.<\/li>\n<\/ol>\n<h3 data-start=\"1189\" data-end=\"1227\"><strong data-start=\"1192\" data-end=\"1227\">3. Memory Allocation Techniques<\/strong><\/h3>\n<h3 data-start=\"1228\" data-end=\"1267\"><strong data-start=\"1232\" data-end=\"1267\">A. Contiguous Memory Allocation<\/strong><\/h3>\n<ul data-start=\"1268\" data-end=\"1734\">\n<li data-start=\"1268\" data-end=\"1346\">\n<p data-start=\"1270\" data-end=\"1346\"><strong data-start=\"1270\" data-end=\"1302\">Single Partition Allocation:<\/strong> Entire memory is given to a single process.<\/p>\n<\/li>\n<li data-start=\"1347\" data-end=\"1734\">\n<p data-start=\"1349\" data-end=\"1442\"><strong data-start=\"1349\" data-end=\"1383\">Multiple Partition Allocation:<\/strong> Memory is divided into fixed or variable-sized partitions.<\/p>\n<p data-start=\"1448\" data-end=\"1475\"><strong data-start=\"1450\" data-end=\"1473\">Fixed Partitioning:<\/strong><\/p>\n<ul data-start=\"1479\" data-end=\"1601\">\n<li data-start=\"1479\" data-end=\"1522\">Divides memory into fixed-sized blocks.<\/li>\n<li data-start=\"1526\" data-end=\"1601\">Causes <strong data-start=\"1535\" data-end=\"1561\">internal fragmentation<\/strong> if a process is smaller than a block.<\/li>\n<\/ul>\n<p data-start=\"1605\" data-end=\"1635\"><strong data-start=\"1607\" data-end=\"1633\">Variable Partitioning:<\/strong><\/p>\n<ul data-start=\"1639\" data-end=\"1734\">\n<li data-start=\"1639\" data-end=\"1680\">Allocates exactly the required space.<\/li>\n<li data-start=\"1684\" data-end=\"1734\">Leads to <strong data-start=\"1695\" data-end=\"1721\">external fragmentation<\/strong> over time.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<h3 data-start=\"1741\" data-end=\"1784\"><strong data-start=\"1745\" data-end=\"1784\">B. Non-Contiguous Memory Allocation<\/strong><\/h3>\n<p data-start=\"1785\" data-end=\"1878\">Allows a process to be stored in <strong data-start=\"1818\" data-end=\"1836\">non-contiguous<\/strong> memory locations, reducing fragmentation.<\/p>\n<p data-start=\"1880\" data-end=\"1895\"><strong data-start=\"1882\" data-end=\"1893\">Paging:<\/strong><\/p>\n<ul data-start=\"1896\" data-end=\"2079\">\n<li data-start=\"1896\" data-end=\"1938\">Divides memory into fixed-sized pages.<\/li>\n<li data-start=\"1939\" data-end=\"2015\">Reduces external fragmentation but may cause <strong data-start=\"1986\" data-end=\"2012\">internal fragmentation<\/strong>.<\/li>\n<li data-start=\"2016\" data-end=\"2079\">Uses a <strong data-start=\"2025\" data-end=\"2039\">Page Table<\/strong> to map logical to physical addresses.<\/li>\n<\/ul>\n<p data-start=\"2081\" data-end=\"2102\"><strong data-start=\"2083\" data-end=\"2100\">Segmentation:<\/strong><\/p>\n<ul data-start=\"2103\" data-end=\"2255\">\n<li data-start=\"2103\" data-end=\"2173\">Divides memory based on <strong data-start=\"2129\" data-end=\"2150\">logical divisions<\/strong> (code, data, stack).<\/li>\n<li data-start=\"2174\" data-end=\"2255\">Eliminates internal fragmentation but may suffer from external fragmentation.<\/li>\n<\/ul>\n<p data-start=\"2257\" data-end=\"2302\"><strong data-start=\"2259\" data-end=\"2300\">Paging + Segmentation (Hybrid Model):<\/strong><\/p>\n<ul data-start=\"2303\" data-end=\"2392\">\n<li data-start=\"2303\" data-end=\"2348\">Combines the benefits of both techniques.<\/li>\n<li data-start=\"2349\" data-end=\"2392\">Used in modern OS like Linux &amp; Windows.<\/li>\n<\/ul>\n<h3 data-start=\"2399\" data-end=\"2442\"><strong data-start=\"2402\" data-end=\"2442\">4. Virtual Memory &amp; Its Applications<\/strong><\/h3>\n<h3 data-start=\"2443\" data-end=\"2474\"><strong data-start=\"2447\" data-end=\"2474\">What is Virtual Memory?<\/strong><\/h3>\n<p data-start=\"2475\" data-end=\"2604\">Virtual memory allows a computer to run programs larger than the available physical RAM by using <strong data-start=\"2572\" data-end=\"2586\">swap space<\/strong> on the hard disk.<\/p>\n<p data-start=\"2606\" data-end=\"2640\"><strong data-start=\"2608\" data-end=\"2638\">Working of Virtual Memory:<\/strong><\/p>\n<ol data-start=\"2641\" data-end=\"2791\">\n<li data-start=\"2641\" data-end=\"2675\">Divides processes into pages.<\/li>\n<li data-start=\"2676\" data-end=\"2733\">Stores some pages in RAM and others in disk storage.<\/li>\n<li data-start=\"2734\" data-end=\"2791\">Uses <strong data-start=\"2742\" data-end=\"2773\">Page Replacement Algorithms<\/strong> when RAM is full.<\/li>\n<\/ol>\n<p data-start=\"2793\" data-end=\"2829\"><strong data-start=\"2795\" data-end=\"2827\">Page Replacement Algorithms:<\/strong><\/p>\n<ul data-start=\"2830\" data-end=\"3098\">\n<li data-start=\"2830\" data-end=\"2890\"><strong data-start=\"2832\" data-end=\"2861\">FIFO (First-In-First-Out)<\/strong> \u2013 Oldest page is replaced.<\/li>\n<li data-start=\"2891\" data-end=\"2967\"><strong data-start=\"2893\" data-end=\"2922\">LRU (Least Recently Used)<\/strong> \u2013 Least recently accessed page is removed.<\/li>\n<li data-start=\"2968\" data-end=\"3098\"><strong data-start=\"2970\" data-end=\"2998\">Optimal Page Replacement<\/strong> \u2013 Removes the page that will not be used for the longest time (ideal but difficult to implement).<\/li>\n<\/ul>\n<p data-start=\"3100\" data-end=\"3284\"><strong data-start=\"3102\" data-end=\"3135\">Advantages of Virtual Memory:<\/strong><br data-start=\"3135\" data-end=\"3138\" \/>\u00a0Allows execution of large programs.<br data-start=\"3175\" data-end=\"3178\" \/>\u00a0Provides <strong data-start=\"3189\" data-end=\"3209\">memory isolation<\/strong> for processes.<br data-start=\"3224\" data-end=\"3227\" \/>\u00a0Enables <strong data-start=\"3237\" data-end=\"3253\">multitasking<\/strong> without requiring large RAM.<\/p>\n<h3 data-start=\"3291\" data-end=\"3334\"><strong data-start=\"3294\" data-end=\"3334\">5. Applications of Memory Management<\/strong><\/h3>\n<p data-start=\"3335\" data-end=\"3736\"><strong data-start=\"3338\" data-end=\"3384\">Operating Systems (Windows, Linux, MacOS):<\/strong> Use paging &amp; segmentation for efficient memory handling.<br data-start=\"3441\" data-end=\"3444\" \/><strong data-start=\"3447\" data-end=\"3477\">Multitasking Environments:<\/strong> Run multiple applications simultaneously without crashes.<br data-start=\"3535\" data-end=\"3538\" \/><strong data-start=\"3541\" data-end=\"3578\">Cloud Computing &amp; Virtualization:<\/strong> Allocate virtual memory for multiple users dynamically.<br data-start=\"3634\" data-end=\"3637\" \/><strong data-start=\"3640\" data-end=\"3661\">Embedded Systems:<\/strong> Optimizes memory usage in resource-constrained devices (IoT, mobile OS).<\/p>\n<h3 data-start=\"3743\" data-end=\"3760\"><strong data-start=\"3746\" data-end=\"3760\">Conclusion<\/strong><\/h3>\n<p data-start=\"3761\" data-end=\"3984\">Memory management is essential for ensuring efficient and safe execution of processes in an OS. Techniques like <strong data-start=\"3873\" data-end=\"3917\">paging, segmentation, and virtual memory<\/strong> help optimize resource utilization and improve system performance.<\/p>\n<p data-start=\"3986\" data-end=\"4086\" data-is-last-node=\"\" data-is-only-node=\"\">Would you like a <strong data-start=\"4003\" data-end=\"4082\">detailed discussion on Paging, Segmentation, or Page Replacement Algorithms<\/strong>?<\/p>\n<h3 data-start=\"3986\" data-end=\"4086\"><a href=\"https:\/\/mrcet.com\/downloads\/digital_notes\/CSE\/II%20Year\/OPERATING%20SYSTEMS%20%20NOTES%20R18.pdf\" target=\"_blank\" rel=\"noopener\">Part 01- Operating System Lecture for Gate Computer Science- Memory management and it&#8217;s application.<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.kdkce.edu.in\/pdf\/Unit%20No%204%20O.S%20Notes.pdf\" target=\"_blank\" rel=\"noopener\">UNIT NO: &#8211; 4 MEMORY MANAGEMENT<\/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:\/\/mis.alagappauniversity.ac.in\/siteAdmin\/dde-admin\/uploads\/5\/__UG_B.Sc._Computer%20Science_130%2051_Operating%20Systems_Binder_8461.pdf\" target=\"_blank\" rel=\"noopener\">OPERATING SYSTEMS &#8211; MIS<\/a><\/h3>\n<p data-start=\"0\" data-end=\"44\">Certainly! Here&#8217;s a structured breakdown of:<\/p>\n<hr data-start=\"46\" data-end=\"49\" \/>\n<h2 data-start=\"51\" data-end=\"110\">\ud83c\udf93 <strong data-start=\"57\" data-end=\"108\">Part 01 \u2013 Operating System Lecture for GATE CSE<\/strong><\/h2>\n<h3 data-start=\"111\" data-end=\"167\">\ud83d\udcd8 <strong data-start=\"118\" data-end=\"167\">Topic: Memory Management and Its Applications<\/strong><\/h3>\n<hr data-start=\"169\" data-end=\"172\" \/>\n<h2 data-start=\"174\" data-end=\"213\">\ud83d\udd39 <strong data-start=\"180\" data-end=\"213\">1. What is Memory Management?<\/strong><\/h2>\n<p data-start=\"215\" data-end=\"298\">Memory management is a core function of the <strong data-start=\"259\" data-end=\"284\">Operating System (OS)<\/strong> that handles:<\/p>\n<ul data-start=\"300\" data-end=\"501\">\n<li data-start=\"300\" data-end=\"369\">\n<p data-start=\"302\" data-end=\"369\"><strong data-start=\"302\" data-end=\"316\">Allocation<\/strong> and <strong data-start=\"321\" data-end=\"337\">deallocation<\/strong> of memory to various processes.<\/p>\n<\/li>\n<li data-start=\"370\" data-end=\"434\">\n<p data-start=\"372\" data-end=\"434\">Tracking which parts of memory are <strong data-start=\"407\" data-end=\"417\">in use<\/strong> and <strong data-start=\"422\" data-end=\"433\">by whom<\/strong>.<\/p>\n<\/li>\n<li data-start=\"435\" data-end=\"501\">\n<p data-start=\"437\" data-end=\"501\">Deciding which processes to <strong data-start=\"465\" data-end=\"483\">swap in or out<\/strong> from main memory.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"503\" data-end=\"506\" \/>\n<h2 data-start=\"508\" data-end=\"547\">\ud83d\udd39 <strong data-start=\"514\" data-end=\"547\">2. Goals of Memory Management<\/strong><\/h2>\n<ul data-start=\"549\" data-end=\"705\">\n<li data-start=\"549\" data-end=\"580\">\n<p data-start=\"551\" data-end=\"580\">Efficient <strong data-start=\"561\" data-end=\"580\">CPU utilization<\/strong><\/p>\n<\/li>\n<li data-start=\"581\" data-end=\"616\">\n<p data-start=\"583\" data-end=\"616\"><strong data-start=\"583\" data-end=\"598\">Fair access<\/strong> for all processes<\/p>\n<\/li>\n<li data-start=\"617\" data-end=\"647\">\n<p data-start=\"619\" data-end=\"647\"><strong data-start=\"619\" data-end=\"647\">Minimizing fragmentation<\/strong><\/p>\n<\/li>\n<li data-start=\"648\" data-end=\"705\">\n<p data-start=\"650\" data-end=\"705\">Ensuring <strong data-start=\"659\" data-end=\"687\">protection and isolation<\/strong> between processes<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"707\" data-end=\"710\" \/>\n<h2 data-start=\"712\" data-end=\"746\">\ud83d\udd39 <strong data-start=\"718\" data-end=\"746\">3. Types of Memory in OS<\/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=\"748\" data-end=\"1083\">\n<thead data-start=\"748\" data-end=\"782\">\n<tr data-start=\"748\" data-end=\"782\">\n<th data-start=\"748\" data-end=\"767\" data-col-size=\"sm\">Memory Type<\/th>\n<th data-start=\"767\" data-end=\"782\" data-col-size=\"md\">Description<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"818\" data-end=\"1083\">\n<tr data-start=\"818\" data-end=\"890\">\n<td data-start=\"818\" data-end=\"842\" data-col-size=\"sm\"><strong data-start=\"820\" data-end=\"841\">Main Memory (RAM)<\/strong><\/td>\n<td data-start=\"842\" data-end=\"890\" data-col-size=\"md\">Fast, volatile storage for running processes<\/td>\n<\/tr>\n<tr data-start=\"891\" data-end=\"955\">\n<td data-start=\"891\" data-end=\"915\" data-col-size=\"sm\"><strong data-start=\"893\" data-end=\"913\">Secondary Memory<\/strong><\/td>\n<td data-start=\"915\" data-end=\"955\" data-col-size=\"md\">Slower, non-volatile (e.g., HDD\/SSD)<\/td>\n<\/tr>\n<tr data-start=\"956\" data-end=\"1014\">\n<td data-start=\"956\" data-end=\"980\" data-col-size=\"sm\"><strong data-start=\"958\" data-end=\"974\">Cache Memory<\/strong><\/td>\n<td data-start=\"980\" data-end=\"1014\" data-col-size=\"md\">High-speed memory close to CPU<\/td>\n<\/tr>\n<tr data-start=\"1015\" data-end=\"1083\">\n<td data-start=\"1015\" data-end=\"1039\" data-col-size=\"sm\"><strong data-start=\"1017\" data-end=\"1035\">Virtual Memory<\/strong><\/td>\n<td data-start=\"1039\" data-end=\"1083\" data-col-size=\"md\">Logical memory abstraction for processes<\/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=\"1085\" data-end=\"1088\" \/>\n<h2 data-start=\"1090\" data-end=\"1131\">\ud83d\udd39 <strong data-start=\"1096\" data-end=\"1131\">4. Memory Allocation Techniques<\/strong><\/h2>\n<h3 data-start=\"1133\" data-end=\"1165\">a. <strong data-start=\"1140\" data-end=\"1165\">Contiguous Allocation<\/strong><\/h3>\n<ul data-start=\"1166\" data-end=\"1277\">\n<li data-start=\"1166\" data-end=\"1226\">\n<p data-start=\"1168\" data-end=\"1226\">Each process gets a <strong data-start=\"1188\" data-end=\"1215\">single contiguous block<\/strong> of memory.<\/p>\n<\/li>\n<li data-start=\"1227\" data-end=\"1277\">\n<p data-start=\"1229\" data-end=\"1277\"><strong data-start=\"1229\" data-end=\"1242\">Drawback:<\/strong> Causes <strong data-start=\"1250\" data-end=\"1276\">external fragmentation<\/strong>.<\/p>\n<\/li>\n<\/ul>\n<h3 data-start=\"1279\" data-end=\"1296\">b. <strong data-start=\"1286\" data-end=\"1296\">Paging<\/strong><\/h3>\n<ul data-start=\"1297\" data-end=\"1534\">\n<li data-start=\"1297\" data-end=\"1362\">\n<p data-start=\"1299\" data-end=\"1362\">Physical memory is divided into <strong data-start=\"1331\" data-end=\"1361\">fixed-size blocks (frames)<\/strong>.<\/p>\n<\/li>\n<li data-start=\"1363\" data-end=\"1406\">\n<p data-start=\"1365\" data-end=\"1406\">Logical memory is divided into <strong data-start=\"1396\" data-end=\"1405\">pages<\/strong>.<\/p>\n<\/li>\n<li data-start=\"1407\" data-end=\"1459\">\n<p data-start=\"1409\" data-end=\"1459\">Pages are mapped to frames using a <strong data-start=\"1444\" data-end=\"1458\">page table<\/strong>.<\/p>\n<\/li>\n<li data-start=\"1460\" data-end=\"1534\">\n<p data-start=\"1462\" data-end=\"1534\">Solves <strong data-start=\"1469\" data-end=\"1495\">external fragmentation<\/strong> but causes <strong data-start=\"1507\" data-end=\"1533\">internal fragmentation<\/strong>.<\/p>\n<\/li>\n<\/ul>\n<h3 data-start=\"1536\" data-end=\"1559\">c. <strong data-start=\"1543\" data-end=\"1559\">Segmentation<\/strong><\/h3>\n<ul data-start=\"1560\" data-end=\"1744\">\n<li data-start=\"1560\" data-end=\"1631\">\n<p data-start=\"1562\" data-end=\"1631\">Memory is divided based on <strong data-start=\"1589\" data-end=\"1610\">logical divisions<\/strong> (code, data, stack).<\/p>\n<\/li>\n<li data-start=\"1632\" data-end=\"1671\">\n<p data-start=\"1634\" data-end=\"1671\">Uses <strong data-start=\"1639\" data-end=\"1656\">segment table<\/strong> to keep track.<\/p>\n<\/li>\n<li data-start=\"1672\" data-end=\"1744\">\n<p data-start=\"1674\" data-end=\"1744\">Better for programmer&#8217;s view but may cause <strong data-start=\"1717\" data-end=\"1743\">external fragmentation<\/strong>.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"1746\" data-end=\"1749\" \/>\n<h2 data-start=\"1751\" data-end=\"1778\">\ud83d\udd39 <strong data-start=\"1757\" data-end=\"1778\">5. Virtual Memory<\/strong><\/h2>\n<ul data-start=\"1780\" data-end=\"1930\">\n<li data-start=\"1780\" data-end=\"1848\">\n<p data-start=\"1782\" data-end=\"1848\">Allows execution of processes <strong data-start=\"1812\" data-end=\"1837\">not completely loaded<\/strong> in memory.<\/p>\n<\/li>\n<li data-start=\"1849\" data-end=\"1887\">\n<p data-start=\"1851\" data-end=\"1887\">Uses <strong data-start=\"1856\" data-end=\"1886\">paging + disk (swap space)<\/strong>.<\/p>\n<\/li>\n<li data-start=\"1888\" data-end=\"1930\">\n<p data-start=\"1890\" data-end=\"1930\"><strong data-start=\"1890\" data-end=\"1907\">Demand Paging<\/strong> is a popular strategy.<\/p>\n<\/li>\n<\/ul>\n<p data-start=\"1932\" data-end=\"1978\">\ud83d\udd38 <strong data-start=\"1935\" data-end=\"1966\">Page Replacement Algorithms<\/strong> (for GATE):<\/p>\n<ul data-start=\"1979\" data-end=\"2040\">\n<li data-start=\"1979\" data-end=\"1985\">\n<p data-start=\"1981\" data-end=\"1985\">FIFO<\/p>\n<\/li>\n<li data-start=\"1986\" data-end=\"2013\">\n<p data-start=\"1988\" data-end=\"2013\">LRU (Least Recently Used)<\/p>\n<\/li>\n<li data-start=\"2014\" data-end=\"2040\">\n<p data-start=\"2016\" data-end=\"2040\">Optimal Page Replacement<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"2042\" data-end=\"2045\" \/>\n<h2 data-start=\"2047\" data-end=\"2073\">\ud83d\udd39 <strong data-start=\"2053\" data-end=\"2073\">6. Fragmentation<\/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=\"2075\" data-end=\"2248\">\n<thead data-start=\"2075\" data-end=\"2101\">\n<tr data-start=\"2075\" data-end=\"2101\">\n<th data-start=\"2075\" data-end=\"2082\" data-col-size=\"sm\">Type<\/th>\n<th data-start=\"2082\" data-end=\"2090\" data-col-size=\"sm\">Cause<\/th>\n<th data-start=\"2090\" data-end=\"2101\" data-col-size=\"sm\">Example<\/th>\n<\/tr>\n<\/thead>\n<tbody data-start=\"2129\" data-end=\"2248\">\n<tr data-start=\"2129\" data-end=\"2193\">\n<td data-start=\"2129\" data-end=\"2144\" data-col-size=\"sm\"><strong data-start=\"2131\" data-end=\"2143\">External<\/strong><\/td>\n<td data-start=\"2144\" data-end=\"2168\" data-col-size=\"sm\">Free spaces scattered<\/td>\n<td data-col-size=\"sm\" data-start=\"2168\" data-end=\"2193\">Contiguous allocation<\/td>\n<\/tr>\n<tr data-start=\"2194\" data-end=\"2248\">\n<td data-start=\"2194\" data-end=\"2209\" data-col-size=\"sm\"><strong data-start=\"2196\" data-end=\"2208\">Internal<\/strong><\/td>\n<td data-col-size=\"sm\" data-start=\"2209\" data-end=\"2238\">Wasted space within blocks<\/td>\n<td data-col-size=\"sm\" data-start=\"2238\" data-end=\"2248\">Paging<\/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=\"2250\" data-end=\"2253\" \/>\n<h2 data-start=\"2255\" data-end=\"2291\">\ud83d\udd39 <strong data-start=\"2261\" data-end=\"2291\">7. GATE-Level Applications<\/strong><\/h2>\n<ul data-start=\"2293\" data-end=\"2549\">\n<li data-start=\"2293\" data-end=\"2348\">\n<p data-start=\"2295\" data-end=\"2348\"><strong data-start=\"2295\" data-end=\"2317\">Numerical problems<\/strong> on <strong data-start=\"2321\" data-end=\"2347\">page table translation<\/strong>.<\/p>\n<\/li>\n<li data-start=\"2349\" data-end=\"2398\">\n<p data-start=\"2351\" data-end=\"2398\">Calculating <strong data-start=\"2363\" data-end=\"2378\">page faults<\/strong> using <strong data-start=\"2385\" data-end=\"2397\">LRU\/FIFO<\/strong>.<\/p>\n<\/li>\n<li data-start=\"2399\" data-end=\"2485\">\n<p data-start=\"2401\" data-end=\"2485\">Questions on <strong data-start=\"2414\" data-end=\"2439\">effective access time<\/strong> using <strong data-start=\"2446\" data-end=\"2484\">TLB (Translation Lookaside Buffer)<\/strong>.<\/p>\n<\/li>\n<li data-start=\"2486\" data-end=\"2549\">\n<p data-start=\"2488\" data-end=\"2549\">Understanding <strong data-start=\"2502\" data-end=\"2548\">difference between paging and segmentation<\/strong>.<\/p>\n<\/li>\n<\/ul>\n<hr data-start=\"2551\" data-end=\"2554\" \/>\n<h2 data-start=\"2556\" data-end=\"2593\">\ud83e\udde0 <strong data-start=\"2562\" data-end=\"2593\">Pro Tip for GATE Aspirants:<\/strong><\/h2>\n<blockquote data-start=\"2595\" data-end=\"2784\">\n<p data-start=\"2597\" data-end=\"2784\">Master <strong data-start=\"2604\" data-end=\"2626\">numerical problems<\/strong> based on <strong data-start=\"2636\" data-end=\"2659\">address translation<\/strong>, <strong data-start=\"2661\" data-end=\"2676\">page faults<\/strong>, and <strong data-start=\"2682\" data-end=\"2702\">memory hierarchy<\/strong>.<br data-start=\"2703\" data-end=\"2706\" \/>Focus on <strong data-start=\"2717\" data-end=\"2729\">diagrams<\/strong> like page tables, frame allocation, and memory layout.<\/p>\n<\/blockquote>\n<hr data-start=\"2786\" data-end=\"2789\" \/>\n<p data-start=\"2791\" data-end=\"2890\">Would you like:<br \/>\n\u2705 Practice problems with solutions?<br data-start=\"2842\" data-end=\"2845\" \/>\u2705 A summary sheet or memory map for revision?<\/p>\n<p data-start=\"2892\" data-end=\"2935\" data-is-last-node=\"\" data-is-only-node=\"\">Let me know, and I\u2019ll prepare them for you!<\/p>\n<h3 data-start=\"2892\" data-end=\"2935\"><a href=\"https:\/\/inf107.telecom-paris.fr\/lectures\/lecture-part3-1-os-intro.pdf\" target=\"_blank\" rel=\"noopener\">Part 01- Operating System Lecture for Gate Computer Science- Memory management and it&#8217;s application.<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Part 01- Operating System Lecture for Gate Computer Science- Memory management and it&#8217;s application. [fvplayer id=&#8221;321&#8243;] Operating System Lecture for GATE Computer Science Part 01: Memory Management &amp; Its Applications 1. Introduction to Memory Management Memory management is a crucial function of an operating system (OS) that handles the allocation and deallocation of memory for [&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-3256","post","type-post","status-publish","format-standard","hentry","category-operating-system"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3256","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=3256"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3256\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3256"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3256"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3256"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}