{"id":10133,"date":"2022-09-22T10:39:31","date_gmt":"2022-09-22T05:09:31","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/"},"modified":"2022-09-22T10:39:31","modified_gmt":"2022-09-22T05:09:31","slug":"solved-not-used-recently-nur-page-replacement-algorithm-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/","title":{"rendered":"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed]"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

Usually Page Replacement Algorithms have a buffer<\/code> and pages<\/code> to put into the buffer<\/code>.<\/p>\n

Buffer size is fixed to a value say 4. Now we keep on adding pages into the buffer, If they are already in the buffer we ignore them and go for the next page to be inserted.<\/p>\n

If they are not in the buffer. We have to insert into it if there is space. If there is no space then we search for a replacement element. In this case the least Frequently used.<\/p>\n

How do we calculate the least frequently used?
\nUsing a count array.<\/p>\n

public class Demo {\n\npublic static void main(String[] args) {\n    int size = 4;\n    int []buffer = new int[size];\n    int []bufferCount = new int[size];\n    int[] pages = {1,2,3,4,5,1,2,1,2,3,4,6,1,2,1,5,1};\n    int pos = 0;\n    for(int i = 0; i < pages.length; i++)\n    {\n        System.out.print(\"For page: \"+pages[i]+\"\\t\");\n        if((pos = contains(buffer, pages[i])) > 0)\n        {\n            \/\/already in buffer increment the count\n            bufferCount[pos] ++;\n        }\n        else\n        {\n            \/\/choose the element with least usage and remove it\n            int toRemove = getLeastUsed(bufferCount);\n            bufferCount[toRemove] = 1;\n            buffer[toRemove] = pages[i];\n        }\n        printBuffer(buffer);\n        System.out.print(\"\\t\");\n        printBuffer(bufferCount);\n        System.out.println();\n    }\n}\n\nprivate static void printBuffer(int[] buffer) {\n    \/\/ TODO Auto-generated method stub\n    for(int i = 0; i < buffer.length; i++)\n        System.out.print(buffer[i] + \"\");\n}\n\nprivate static int getLeastUsed(int[] bufferCount) {\n    \/\/ TODO Auto-generated method stub\n    int index = 0;\n    int min = bufferCount[0];\n    for(int i = 0; i < bufferCount.length; i++)\n        if(bufferCount[i] < min)\n        {\n            min = bufferCount[i];\n            index = i;\n        }\n    return index;\n}\n\nprivate static int contains(int[] buffer, int key) {\n    \/\/ TODO Auto-generated method stub\n    for(int i = 0; i < buffer.length; i++)\n        if(buffer[ i ] == key)\n            return i;\n    return -1;\n}\n<\/code><\/pre>\n
}<\/p>\n<\/p><\/div>\n
<\/div>\n<\/div>\n
            0<\/span> <\/p><\/div>\n<\/div>\n
[ad_2]<\/p>\n
solved Not Used Recently (NUR) Page Replacement Algorithm [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"
[ad_1] Usually Page Replacement Algorithms have a buffer and pages to put into the buffer. Buffer size is fixed to a value say 4. Now we keep on adding pages into the buffer, If they are already in the buffer we ignore them and go for the next page to be inserted. If they are … Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324,323,1367],"class_list":["post-10133","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c","tag-java","tag-operating-system"],"yoast_head":"\n[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] Usually Page Replacement Algorithms have a buffer and pages to put into the buffer. Buffer size is fixed to a value say 4. Now we keep on adding pages into the buffer, If they are already in the buffer we ignore them and go for the next page to be inserted. If they are ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-09-22T05:09:31+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/person\\\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed]\",\"datePublished\":\"2022-09-22T05:09:31+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/\"},\"wordCount\":115,\"publisher\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\"},\"keywords\":[\"c++\",\"java\",\"operating-system\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/\",\"name\":\"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#website\"},\"datePublished\":\"2022-09-22T05:09:31+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-not-used-recently-nur-page-replacement-algorithm-closed\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#website\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/jassweb.com\\\/wp-content\\\/uploads\\\/2021\\\/02\\\/jass-website-logo-1.png\",\"contentUrl\":\"https:\\\/\\\/jassweb.com\\\/wp-content\\\/uploads\\\/2021\\\/02\\\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/logo\\\/image\\\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/person\\\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\\\/\\\/jassweb.com\"],\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/author\\\/jaspritsinghghumangmail-com\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed] - JassWeb","og_description":"[ad_1] Usually Page Replacement Algorithms have a buffer and pages to put into the buffer. Buffer size is fixed to a value say 4. Now we keep on adding pages into the buffer, If they are already in the buffer we ignore them and go for the next page to be inserted. If they are ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/","og_site_name":"JassWeb","article_published_time":"2022-09-22T05:09:31+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed]","datePublished":"2022-09-22T05:09:31+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/"},"wordCount":115,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++","java","operating-system"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/","name":"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-09-22T05:09:31+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-not-used-recently-nur-page-replacement-algorithm-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Not Used Recently (NUR) Page Replacement Algorithm [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/10133","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=10133"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/10133\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=10133"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=10133"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=10133"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}