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 contains introduction of process, PCB, Context Switching, Process States, Process Queues etc.

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 & ESE

Hindi

(Hindi) Process Management: 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

This lesson gives an overview of Operating System. It covers :-
- Introduction of OS
- Types of OS
- Functions & Goals of OS
- Examples of OS

Lesson 1 - Introduction to OS (in Hindi)

This lesson covers a very basic yet important concept of Operating System i.e. Process and PCB

Lesson 2 - Process & PCB (in Hindi)

This lesson covers:-
- Context Switching
- Process States
- Operations on a process

Lesson 3 - Context Switching (in Hindi)

This lesson covers Process State Transition Diagram in detail.

Lesson 4 - Process Transition Diagram & Types of Schedulers (in Hindi)

This lesson covers 2 basic topics of process management i.e. :
- Types of Schedulers
-  Process Queues

Lesson 5 - Types of Schedulers & Process Queues (in Hindi)

This lesson discusses a disadvantage of FCFS scheduling i.e. Convoy Effect with the help of an example.

Lesson 8 : FCFS Scheduling(Part 2)

This lesson covers SJF Scheduling algorithm with the help of an example. Here we learn, how to calculate :-
- Completion time
- TAT
- Waiting time
- Avg TAT
- Avg WT

Leason 9 : SJF Scheduling

This lesson includes some previous years'GATE questions based on Process State Transition Diagram.

Lesson 6 - Previous Years' GATE Questions on Process Management

This lesson covers a basic non preemptive scheduling algorithm i.e. FCFS scheduling. Here, we learn to calculate :-
- Completion time
- TAT
- Waiting time
- Avg TAT
- Avg WT

Lesson 8 : FCFS Scheduling

This lesson includes some details related to CPU scheduling such as : 
- Introduction to CPU scheduling
- Various times related to CPU scheduling
- Types of CPU scheduling

Lesson 7 : CPU Scheduling

This lesson discusses how the performance of SJF Scheduling degrades with random arrival of processes. It also covers advantages & disadvantages of SJF Scheduling.

Lesson 9 : SJF Scheduling(Part 2)

Some previous previous years'GATE problems based on SRTF Scheduling

Lesson 11 : Previous Years' Questions on SRTF Scheduling

This lesson covers the preemptive version of SJF Scheduling algorithm i.e. SRTF Scheduling with the help of an example.

Lesson 10 : SRTF Scheduling

This lesson covers non preemptive version of Priority Scheduling with the help of an example and also discusses on Aging.

Lesson 12 : Priority Scheduling

In this lesson Preemptive Priority Scheduling algorithm has bees discussed in detail with the help of a GATE problem.

Lesson 13 : Preemptive Priority Scheduling

This lesson covers Round Robin Scheduling algorithm. The lesson includes :-
- Flow diagram
- Advantages of RR Scheduling
- Example

Lesson 14 : Round Robin Scheduling

In this lesson Longest job first(LJF) Scheduling algorithm has been discussed with an example.

Lesson 15 : LJF Scheduling

This lesson discusses on Longest Remaining Time First(LRTF) Scheduling algorithm with an example.

Lesson 16 : LRTF Scheduling

This lesson covers HRRN scheduling algorithm with the help of an example

Lesson 17 : HRRN Scheduling

In this lesson some previous years'GATE questions related to CPU scheduling have been discussed.

Lesson 18 : Previous Years'GATE Questions

In this lesson we solve some CPU Scheduling problems that have been asked in previous years'GATE exams.

Lesson 23 : Previous Years' GATE Questions

In this lesson we solve a relatively complex problem having CPU burst time as well as I/O burst time using SRTF Scheduling.

Lesson 19 : Practice Question on CPU Scheduling with I/O time

Lesson 22 : Previous Years' GATE Questions

Lesson 21 : Previous Years' GATE Questions

In this lesson we solve a relatively complex problem having CPU burst time as well as I/O burst time using Preemptive Priority Scheduling.

Lesson 20 : Practice Question on CPU Scheduling with I/O time

This lesson will help you to understand the concept of Least Completed Next Scheduling algorithm with the help of an example.

Lesson 24: Least Completed Next Scheduling

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)

Sandeep Singh

In this course, we will learn a fundamental unit of CPU utilization that forms the basis of Multithreaded Computer Systems and also discusses the APIs for Pthreads, win32, and Java thread libraries.

(Hindi) Threads and Processes - GATE (CS IT)

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)

Today is that tomorrow you talked about yesterday 🌿.


Ansha P

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

Operating Systems for GATE

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

26 lessons • 5h 20m