MAHARASHTRA STATE BOARD OF

TECHNICAL EDUCATION

SHRI H. H. J. B. POLYTECHNIC,
CHANDWAD-423101 (Nasik)

MICRO PROJECT
Academic year: 2020-21

TITLE OF PROJECT

PAGE REPLACEMENT ALGORITHM

Program: Computer Technology Program code: CM

Sub:Osy Course code: 22516
 MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION
Certificate
Sr. Name of members Roll No Enrollment No
No
1 Shinde Kalpesh 17 1811040073

This is to certify that SHINDE KALPESH CHUNILAL of 5th Semester of Diploma in

Computer Technology of Institute, SHHJB POLYTECHNIC, CHANDWAD (Code: 1104) has
completed the Micro Project satisfactorily in Subject Operating System(22516) for the
academic year 2020- 2021 as prescribed in the curriculum.

Place: CHANDWAD

Date: ………………………

Subject Teacher Head of the Department Principal

Mr.P Sali

Teacher Evaluation Sheet

Name of Students: SHINDE KALPESH CHUNILAL Enrollment No. 1811040073

Name of Program - Computer Technology Semester - 5 th

Course Title: - OSY Code: - 22516
Title of the Micro – Project:- PAGE REPLACEMENT ALGO
Course Outcomes Achieved

A: Install operating system and configure it.

B: Use operating system tools to perform various functions.

C: Execute process commands for performing process management operation.

D: Calculate efficiency of different memory management techniques.

E: Apply file management techniques.

Evaluation as per Suggested Rubric for Assessment of Micro – Project

Sr. Characteristic to be assessed Poor Average Good Excellent

No. (Marks 1-3) (Marks 4-5) (Marks 6 - 8) (Marks 9 – 10)
1 Relevance to the Course
2 Literature Survey / Information Collection
3 Project Proposal
4 Completion of the Target as per project
proposal
5 Analysis of data and representation
6 Quality of Prototype / Model
7 Report Preparation
8 Presentation
9 Defense
Micro – Project Evaluation Sheet

Process Assessment Product Assessment Total

Name of Student Part A – Project Part B – Project Individual Mark
project Methodology Report / Presentation / s 10
Proposal (2 marks) Working Model Viva (4 marks)
(2 marks) (2 marks)
SHINDE KALPESH

Comments / Suggestions about team work / leadership / inter – personal communication (if any)

--------------------------------------------------------------------------------------------------------------------------------------

Any Other Comment:

-------------------------------------------------------------------------------------------------------------------------------------
Name and designation of the faculty Member ----prof . P.sali

Signature -------------------------

PAGE REPLACEMENT ALGORITHM

1.0Aims/Benefits of the Micro-Project:

Page replacement algorithms are an important part of virtual memory management and it helps
the OS to decide which memory page can be moved out, making space for the currently
needed page. However, the ultimate objective of all page replacement algorithms is to reduce the
 number of page faults. Page replacement algorithms are an important part of virtual memory
management and it helps the OS to decide which memory page can be moved out, making space
for the currently needed page. However, the ultimate objective of all page replacement algorithms
is to reduce the number of page faults.
2.0 Course Outcomes Addressed :
a. Install operating system and configure it.
b. Use operating system tools to perform various functions.
c. Execute process commands for performing process management operation.
d. Apply Scheduling Algorithm to calculate turnaround time and average waiting time.
e. Calculate efficiency of different memory management techniques.
f. Apply file management techniques.

3.0 Proposed Methodology:

1. In this project we have selected the topic first the page replacement algorithm.
2. Searched for the information from the Internet as well as reference books
3. Taken the help of the guide in any difficulties came while doing the project
4. Made the annexure.

S.NO. Details Of Activity Planned Planned Name Of

Start Finish Responsible
Date Date Team
Members
1 Discussion and kalpesh
finalization of topic 4.0 Action plan
2 Preparation and kalpesh
submission of
abstract
3 Collection of data kalpesh
4 Preparing Algorithm kalpesh
and Flowchart
5 Development of
program Kalpesh
7 Presentation/Seminar
8 Submission Micro-
Project
5.0 Resources Required

S.NO. Name of resource/material

1 Windows10
2 www.google.com

Name of Members with Roll NOs.:

1.KALPESH CHUNILAL SHINDE

Title of Micro-project: PAGE REPLACEMENT ALGORITHM

1.0 Rationale:

In an operating system that uses paging for memory management, a page replacement algorithm is
needed to decide which page needs to be replaced when new page comes in.
Page Fault – A page fault happens when a running program accesses a memory page that is mapped
into the virtual address space, but not loaded in physical memory.
Since actual physical memory is much smaller than virtual memory, page faults happen. In case of page
fault, Operating System might have to replace one of the existing pages with the newly needed page.
Different page replacement algorithms suggest different ways to decide which page to replace. The
target for all algorithms is to reduce the number of page faults. Page replacement algorithms are the
techniques using which an Operating System decides which memory pages to swap out, write to disk
when a page of memory needs to be allocated. ... This process determines the quality of the page
replacement algorithm: the lesser the time waiting for page-ins, the better is the algorithm.
Advantages of FIFO in Page Replacement Algorithm are:
1. It is very easy to understand.
2. It is very easy to implement.
Disadvantages of FIFO in Page Replacement Algorithm are:
1. The oldest block in memory may be often used.
Advantages of LRU in Page Replacement Algorithm are:
1. LRU Page Replacement Algorithm is quite efficient.
Disadvantages of FIFO in Page Replacement Algorithm are:
1. Implementation difficult. This algorithm will be requires keeping track of what was used when,
which is expensive if one wants to make sure the algorithm always discard the list recently used
item.

Advantages of Optimal Page Replacement Algorithm are as follows:

1) It is less complex and easy to implement

2) A page is replaced with minimum fuss.

3) Simple data structures are used for this purpose

Disadvantages of Optimal Replacement Algorithm are as follows:

1) Not all operating systems can implement this algorithm.

2) Error detection is harder.

3) Least recently used page will be replaced which may sometimes take a lot of time.

2.0 Course Outcomes Achieved:

a. Install operating system and configure it.
b. Use operating system tools to perform various functions.
c. Execute process commands for performing process management operation.
d. Apply Scheduling Algorithm to calculate turnaround time and average waiting time.
e. Calculate efficiency of different memory management techniques.
f. Apply file management techniques.

3.0 Actual Methodology Followed:

1.FIFO:
This is the simplest page replacement algorithm. In this algorithm, the operating system keeps track of
all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be
replaced page in the front of the queue is selected for removal.

Example-1Consider page reference string 1, 3, 0, 3, 5, 6 with 3-page frames. Find number of page
faults.

2. LRU (LEAST RECENTLY USED)

In this algorithm page will be replaced which is least recently used.

Example-3Consider the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2 with 4 page frames. Find

number of page faults.
3 OPTIMAL PAGE REPLACEMENT
In this algorithm, pages are replaced which would not be used for the longest duration of time in the
future.
Example-2: Consider the page references 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, with 4-page frame. Find
number of page fault.

4.0 Resources Required

Sr no Name of resource/material
1 Ubuntu
 2 www.google.com

3 Techno publication

5.0 Output of the Micro-Projects

Sr no FIFO LRU OPTIMAL

1 Number of page Number of page Number of page
fault is more than fault is more than fault is less than
LRU and OPTIMAL OPTIMAL and less FIFO AND LRU
than FIFO
2 Suffer from Does not suffer Does not suffer
belady’s anomaly from belady’s from belady’s
anomaly anomaly
3 Used in operating Used in operating Not Used in
system system operating system
4 Future prediction is Future prediction Future prediction
not required is not required is required
5 Simple to Consider to be Difficult to
implement good implement

6.0 Skill Developed/Learning Outcome of this Micro-Project

Through this project Page Replacement Algorithm we got to know about three types of algorithm
FIFO, LRU and OPTIMAL and all the information about it. By this project we can conclude that FIFO
is very easy way to implement as compared to remaining two.
LRU is, in general, more efficient, because there are generally memory items that are added once
and never used again, and there are items that are added and used frequently. LRU is much more
likely to keep the frequently-used items in memory. Depending on access patterns, FIFO can
sometimes beat LRU.
7.0 Application of this Micro-Project:

A computer can address more memory than the amount physically installed on the system. This
extra memory is actually called virtual memory and it is a section of a hard disk that's set up to
emulate the computer's RAM.
The main visible advantage of this scheme is that programs can be larger than physical memory.
Virtual memory serves two purposes. First, it allows us to extend the use of physical memory by
using disk. Second, it allows us to have memory protection, because each virtual address is
translated to a physical address.