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

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

Process management

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 introduction to Operating system. It covers :-
* Introduction to OS
* Functions & Goals of OS
* Types of Operating system
* Examples of OS

Lesson 1 - Introduction to OS

This lesson covers :
- The concept of context switching.
- Process states
- Operations on process

Lesson 3 - Context Switching and Process States

This lesson discusses the difference between program and process. It also cover process control block in detail.

Lesson 2 - Process and PCB

This lesson covers Process State Transition Diagram in detail.

Lesson 4 : Process Transition Diagram and Types of scheduler

This lesson covers : 
- Different types of schedulers 
- Process Queues

Lesson 5 - Process Queue and Types of Scheduler

For better understanding of the learnt concepts, solving problems is very useful. This lesson covers some problems from previous years GATE exams.

Lesson 6 - Previous years' GATE Questions

This process gives an introduction to CPU scheduling and covers : 
- the circumstances when CPU scheduling can be performed
- Goals of scheduling
- Various times related to a process

Lesson 7 - CPU Scheduling

This process covers FCFS scheduling with an example. It shows how to calculate below parameters for processes :-
- Completion time
- Turn around time
- Waiting time

Lesson 8 - FCFS Scheduling

This lesson covers how to calculate -
- Avg TAT
- Avg WT
Also, this lesson covers a very imp. concept of FCFS that is "convoy effect".

Lesson 8 - FCFS Scheduling(Convoy Effect)

This lesson covers SJF or shortest job first scheduling algorithm with the help of an example. Here we'll ses how to calculate :
- Completion time
- TAT
- Waiting time

Lesson 9 - SJF Scheduling

This lesson discusses on the effect of arrival time of processes on the avg waiting time in SJF scheduling.
It also discusses on advantages and disadvantages of SJF scheduling.

Lesson 9 - SJF Scheduling(Part 2)

This lesson covers SRTF scheduling with an example.

Lesson 10 - SRTF Scheduling

Previous years' GATE questions with step by step explaination. This lesson covers questions from SRTF scheduling and shows how to calculate : 
- CT
- TAT
- WT
- Avg WT

Lesson 11 - Previous Years GATE Questions on CPU Scheduling

This lesson covers :
- Introduction to Priority Scheduling
- Non-preemptive priority scheduling
- Example

Lesson 12 - Priority Scheduling

In this lesson we'll cover preemptive version of priority scheduling algorithm with the help of an example.

Lesson 13 - Priority Scheduling(Preemptive)

This lesson covers another preemptive scheduling algorithm Round Robin Scheduling with : 
- Flow diagram
- Example

Lesson 14 - Round Robin Scheduling

This algorithm covers how longest job first(LJF) Scheduling algorithm works with the help of an example.

Lesson 15 - LJF Scheduling

This lesson covers HRRN(Highest Response Ratio Scheduling) algorithm with the help of an example.

Lesson 17 - HRRN Scheduling

This lesson covers some previous years' GATE questions.

Lesson 18 - Previous Years'GATE Question on LRTF Scheduling

This lesson covers the LRTF(Longest Remaining Time First) scheduling with the help of an example.

Lesson 16 - LRTF Scheduling

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 Questions on CPU Scheduling with I/O time

In this lesson we solve some previous years'GATE questions.

Lesson 21 : 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 questions from CPU Scheduling with I/O time

Lesson 22 : Previous Years' GATE Problems

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 Algorithm

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 6m

Invalid Date

NaN

Lesson 1 - Introduction to OS

Invalid Date

NaN

Lesson 3 - Context Switching and Process States

Invalid Date

NaN

Lesson 2 - Process and PCB

Invalid Date

NaN

Lesson 4 : Process Transition Diagram and Types of scheduler

Invalid Date

NaN

Lesson 5 - Process Queue and Types of Scheduler

Invalid Date

NaN

Lesson 6 - Previous years' GATE Questions

Invalid Date

NaN

Lesson 7 - CPU Scheduling

Invalid Date

NaN

Lesson 8 - FCFS Scheduling

Invalid Date

NaN

Lesson 8 - FCFS Scheduling(Convoy Effect)

Invalid Date

NaN

Lesson 9 - SJF Scheduling

+ See all lessons