Akanksha Chaurasia

This course covers The Page Replacement Algorithms. This is one of the most important topics asked in GATE. It's really easy and high scoring.

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

English

Course on Page Replacement Algorithms for GATE Exams

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

Overview

This lesson covers the concepts of Thrashing & Buddy system.

Thrashing and Buddy System

In this lesson the First In First Out (FIFO) page replacement algorithm has been discussed with it's exception.

First In First Out (FIFO)

This lesson covers the Optimal page replacement algorithm & there are also some practice questions.

Optimal Page Replacement

The lessons explains Least Recently Used (LRU) & Most Recently Used (MRU) Page Replacement Algorithms.

Least Recently Used (LRU) and Most Recently Used (MRU)

This lesson covers the previously asked GATE examination questions from the topic Page replacement algorithms.

Previous Year Questions

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

8+ Years Teaching Exp. in GATE CS IT & PLACEMENTS on Unacademy | Mentored 2 Lakh+ Students | Students secured AIR Below 100 in GATE 

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

6 lessons • 1h 3m

Invalid Date

NaN

Overview

Invalid Date

NaN

Thrashing and Buddy System

Invalid Date

NaN

First In First Out (FIFO)

Invalid Date

NaN

Optimal Page Replacement

Invalid Date

NaN

Least Recently Used (LRU) and Most Recently Used (MRU)

Invalid Date

NaN

Previous Year Questions