Today is that tomorrow you talked about yesterday 🌿.


Ansha P

This course is about Operating Systems from Machine Level Language to High Level Language.

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

Operating Systems for GATE

Process and Threads

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

Introduction to Operating systems.
Various types, Functions .
Process and Thread.

Introduction, Process and Thread

This lesson explains process layout, Process Control Block and the very important topic Context Switching.

Process Layout, Context switching, PCB

This lesson gives you an introduction to process Scheduling and it explains different types of schedulers -  Long term, Medium term and Short term schedulers

Process Scheduling, Different types of Schedulers

This lesson explains different terms related to processes and the FCFS scheduling algorithm.

Terms related to processes, FCFS Algorithm

This lesson explains the two versions of shortest job first scheduling algorithm.

Shortest Job First, Shortest Remaining Time First

This lesson explains the two versions of Priority scheduling algorithm

Priority Scheduling (Preemptive and Non Preemptive)

This lesson explains the Round Robin Scheduling Algorithm.

Round Robin Scheduling.

This lesson explains multilevel queue scheduling and multilevel feedback queue scheduling.

Multilevel Queue Scheduling, Multilevel Feedback Queue Scheduling.

This lesson explains a special case of FCFS which may lead to a situation called Convoy effect.

Convoy Effect in FCFS.

This lesson explains how to predict the burst time of processes.

SJF with prediction of Burst time.

This lesson includes the comparison of various process scheduling algorithms.

Comparison of Scheduling Algorithms.

This lesson gives an introduction to process management, Process synchronization and race condition.

Introduction to Process Sychronization, Race condition

This lesson describes the problem of critical section.

Critical section.

This lesson describes two hardware solution for Critical section problem - 'Disabling interrupt' and 'Test and set instruction'.

Hardware solutions for Critical section, Disable interrupt, Test and set instruction.

This lesson explains one hardware solution for Critical section problem which is the Compare and swap instruction.

Compare and swap instruction.

This lesson explains how Test and test instruction can be modified to satisfy bounded waiting.

Test and set instruction with bounded waiting.

This lesson explains the Peterson's solution for Critical section problem.

Peterson's solution for Critical section problem.

This lesson explains mutex and semaphores to solve critical section problem.

Mutex and semaphore for solving Critical section problem.

The producer consumer problem which is a classic synchronization problem is explained and solved using semaphores.

Producer- Consumer problem / Bounded buffer problem.

The Readers-Writers problem which is a classic synchronization problem is explained and solved using semaphores

Readers- Writers problem.

The Dining philosophers problem which is a classic synchronization problem is explained and solved using semaphores.

Dining philosophers problem.

This lesson explains how processes are communicated with each other.

Interprocess Communication.

This lesson explains the infinite waiting situation - DEADLOCK.

Deadlocks

This lesson deals with deadlock prevention methods.

Handling deadlocks - Deadlock prevention

This lesson explains deadlock avoidance and the Resource allocation graph algorithm.

Deadlock avoidance- Resource allocation graph algorithm.

This lesson explains the Banker's Algorithm for deadlock avoidance and it explains the sub algorithm 'Safety algorithm'.

Banker's Algorithm.

This lesson explains the Banker's Algorithm for deadlock avoidance and it explains the sub algorithm 'Resource Request algorithm'.

Banker's Algorithm - Resource Request algorithm

This lesson explains the prevention and recovery methods of deadlocks

Deadlock prevention and recovery.

This lesson gives an introduction to memory management and it also explains instruction cycle, memory hierarchy, base register and limit register.

Memory management - Introduction.

This lesson explains some important topics in memory management.

Logical & Physical address, Address binding, Dynamic loading & linking.

This lesson explains contiguous memory allocation scheme and it's problems.

Contiguous memory allocation.

This lesson explains different memory allocation algorithms - First fit, Best fit, Worst fit.

Memory allocation algorithms - First fit, Best fit and Worst fit.

This lesson explains non- contiguous scheme for memory allocation-Segmentation.

Non contiguous memory allocation - Segmentation

This lesson explains Non- contiguous scheme for memory allocation- Paging.

Non contiguous memory allocation- Paging

This lesson explains different methods to paging and page tables.

Hierarchical paging, Hashed page tables, Inverted page tables.

This lesson explains the memory cache TLB (Translation Look aside Buffer).

Translation look-aside buffer (TLB) in paging.

This lesson explains the memory management technique "Virtual Memory" which creates the illusion to users of a very large memory.

Virtual memory

This lesson explains some most important topics of virtual memory including demand paging, page faults and page replacement.

Demand paging, Page faults & Page replacement.

This lesson explains the Optimal (OPT) page replacement algorithm with solved example.

Optimal Page replacement algorithm.

The Least Recently Used (LRU) one of the important page replacement algorithms is explained in this lesson.

Least Recently Used (LRU) Page replacement algorithm

This lesson explains the First In First Out (FIFO) page replacement algorithm with solved example.

First In First Out (FIFO) Page replacement algorithm.

This lesson explains counting based page replacement algorithms which are 'most frequently used' and 'less frequently used' methods.

Counting Based Page replacement algorithms.

An interesting question on Semaphore

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 is covering various GATE Problems on CPU Scheduling of Operating System.

(Hindi) GATE Problems On CPU Scheduling - Basic To High Level

This course will cover Process and Threads With Concepts and GATE Previous Year Questions.

(Hindi) Process and Threads in Os With Gate PYQs - Gate (CS and IT)

Software Engineer @Philips,
M.Tech from NIT, Bhopal
GATE(thrice)& NET-JRF qualified with 99.9%tile. 
Passion: Programming nd learning new te

Priyanka Pandey

This course covers introduction to OS and all about the operating system processes :-
- Process & PCB
- Process states & Transition diagram
- Process Queues
- Process scheduling

Process management

Anushree Jha

The course is an exhaustive study of the various concepts of operating systems . We shall go through the varieties of OS , it's services , memory and file management , process synchronization,process scheduling etc

Operating Systems: GATE (CS And IT)


Done graduation from Thakur college of science and commerce,
Master in computer science ,
Educator in Unacademy.

Pratiksha Tripathi

Thread for Beginner's

This course will cover the Synchronization of processes. There are 2 type of processes - Cooperative and Independent.  We will also discuss Critical Section Problem in which no 2 processes can exist in critical section simultaneously.  There are 2 solution for this problem - Peterson's Solution and lock variable.

Lessons

43 lessons • 8h 51m

Invalid Date

NaN

Introduction, Process and Thread

Invalid Date

NaN

Process Layout, Context switching, PCB

Invalid Date

NaN

Process Scheduling, Different types of Schedulers

Invalid Date

NaN

Terms related to processes, FCFS Algorithm

Invalid Date

NaN

Shortest Job First, Shortest Remaining Time First

Invalid Date

NaN

Priority Scheduling (Preemptive and Non Preemptive)

Invalid Date

NaN

Round Robin Scheduling.

Invalid Date

NaN

Multilevel Queue Scheduling, Multilevel Feedback Queue Scheduling.

Invalid Date

NaN

Convoy Effect in FCFS.

Invalid Date

NaN

SJF with prediction of Burst time.

+ See all lessons