I am a self motivated person with a positive attitude towards life and work. My dream is to work in a professional environment.

Shivam Pandey

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. In this course Shivam will discuss about Page Replacement Algorithm and will solve some questions on it.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

Hindi

(Hindi) Operating System: Page Replacement Algorithm

GATE (Graduate Aptitude Test In Engineering) Preparation

Memory Management

Operating System

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

In this lesson we learned about PAGE REPLACEMENT ALGORITHM and PAGE FAULTS.

Page Replacement Algorithm (in Hindi)

In this lesson we Solved question on FIFO (FIRST IN FIRST OUT) PAGE REPLACEMENT ALGORITHM.

Question on FIFO (in Hindi)

In this lesson we Solved question on OPTIMAL PAGE REPLACEMENT ALGORITHM.

Optimal Page Replacement Algorithm (in Hindi)

In this lesson we Solved question on LRU(LEAST RECENTLY USED) ALGORITHM.

LRU Algorithm (in Hindi)

In this lesson we Solved question on BELADY'S ANOMALY.

BELADY'S Anamoly Question (in Hindi)

B.E in IT 3 years of experience in manual testing .2 years of experience in teaching.
courses on computer stream, course for IBPS Bank 

Deepa Agrawal Agrawal

In this course, the educator discusses memory, types of Memory, primary memory and secondary memory. The course will be beneficial for GATE (CS and IT) Aspirants.

(Hindi) Computer Memory: GATE (CS and IT)

I am an IT technocrat pursuing my B-tech and my hobbies are teaching, reading novels, dancing.

Bhavana Tadikamalla

This course contains fixed partitioning related to Memory Management.

Memory Management Part 2- Gate(CS & IT)

This course contains linked list for dynamic partitioning,first fit,  quick fit, next fit, best fit,  worst fit, problems.

Memory Management Part-3 Gate (CS & IT)

This course contain need of paging, what is paging, examples

Memory Management Part-3: GATE CS and IT

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Memory Management and Virtual Memory in Operating System For GATE CS/IT Aspirants.

(Hindi) Memory Management and Virtual Memory

PhD pursuing NITK student. Teacher by profession. Sketching and cooking are hobbies

Ranjit Kolkar

In this course, the educator discusses the Deadlock introduction with example and program
4 necessary conditions,
Resource allocation graph,
Deadlock Prevention,
Deadlock avoidance,
Safe state,
Banker's algorithm for GATE (CS and IT).

Lessons

5 lessons • 46m

Invalid Date

NaN

Page Replacement Algorithm (in Hindi)

Invalid Date

NaN

Question on FIFO (in Hindi)

Invalid Date

NaN

Optimal Page Replacement Algorithm (in Hindi)

Invalid Date

NaN

LRU Algorithm (in Hindi)

Invalid Date

NaN

BELADY'S Anamoly Question (in Hindi)