In this paper, a new page replacement algorithm has been represented that has a better performance in average than quondam methods. A major attempt in such an algorithm is to substitute characteristics of some quondam methods engrossed by a new idea. The key concept of proposed scheme is to decrease overall page fault rate for system i.e. to increase the hit ratio of pages. In brief this paper remonstrate an advanced version of Least recently used algorithm , which is referred as Hybrid LRU. The general idea behind Hybrid LRU is to keep track of the total number of references and whenever a page is scrawled ( modified to) , a modified bit M will be set for that particular page.

The goal of any page replacement algorithm is to reduce fault rate by selecting best victim page to remove. This paper presents a framework through which, we tried to compare our previous work i.e. H-LRU [1] with other existing algorithms and prove that it has a better performance in average than former methods. Our major attempt in this paper is to extend our previous work HLRU and to compare characteristics of some former methods with HLRU. The general idea behind the comparison is to evaluate the hit ratio of pages for different algorithms and to prove that it has the best performance among all .For this purpose we consider traditional algorithm like FIFO, LRU and some recent approaches like PRO-LRU, H-LRU.

Finding the shortest path in a graph means selecting the path between source and destination which gives the minimum path length. This problem of finding the shortest path can be solved using Dijkstra algorithm. The time complexity of Dijkstra algorithm is high. Looking at the shortcoming of traditional Dijkstra algorithm, this paper has proposed a new method to improve the time complexity of this algorithm using queue and hashing techniques. The time complexity of the improved algorithm is O(n log n).