Comprehensive Operating Systems Course
at just
$69
Enroll Now
Sign Up
Sign In
Comprehensive Operating Systems Course
Comprehensive Operating Systems Course
Section 1 : Introduction
Lecture 1
INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM
Pdf
Lecture 2
About Certification
Pdf
Section 2 : Introduction to Operating Systems
Lecture 3
Introduction to Computer Systems
11:5
Lecture 4
How hardware devices work together
6:55
Lecture 5
Need for Operating Systems from scratch
8:53
Lecture 6
How Input and Output devices work together
16:36
Section 3 : Operating System Concepts
Lecture 7
Program vs Process, States of a process
9:25
Lecture 8
Degree of Multiprogramming
5:30
Lecture 9
Types of Operating Systems
11:54
Lecture 10
An Important point to note
1:31
Lecture 11
About Proctor Testing
Pdf
Section 4 : CPU Scheduling Algorithms - SJF, SRTF, FCFS
Lecture 12
Types of scheduler, Context switching
11:24
Lecture 13
Various times of a process
11:29
Lecture 14
Types of Scheduling Algorithms
8:37
Lecture 15
SJF Scheduling Algorithm
9:22
Lecture 16
SJF Example 1
9:18
Lecture 17
SJF Example 2
5:58
Lecture 18
Shortest Remaining Time First Scheduling Algorithm
15:39
Lecture 19
Response time explained with example
13:44
Lecture 20
SRTF assignment problem
Text
Lecture 21
SRTF assignment problem solution
5:23
Lecture 22
Response Time example 2
1:21
Lecture 23
SRTF assignment problem 2
Text
Lecture 24
SRTF assignment problem 2 solution
4:55
Lecture 25
First Come First Served Scheduling Algorithm
7:18
Lecture 26
FCFS with Context Switching overhead
10:0
Section 5 : Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages
Lecture 27
Starvation
13:6
Lecture 28
Convoy Effect
10:35
Lecture 29
Practical Implementation
2:44
Lecture 30
Throughput
Preview
Section 6 : CPU Scheduling Algorithms - LJF, LRTF, Priority-based, HRRN
Lecture 31
Longest Job First Scheduling Algorithm
6:25
Lecture 32
LJF Example 1
5:17
Lecture 33
Longest Remaining Time First Scheduling Algorithm
2:12
Lecture 34
LRTF Example 1
5:4
Lecture 35
LRTF Example 2
3:9
Lecture 36
LRTF Example 2 continuation
2:42
Lecture 37
Round Robin Scheduling Algorithm
3:46
Lecture 38
RR Example 1
10:35
Lecture 39
RR Example 2
Preview
Lecture 40
RR Important Observations
Preview
Lecture 41
Advantages and Limitations of RR Algorithm
4:59
Lecture 42
Non Preemptive Priority based Scheduling Algorithm
7:39
Lecture 43
Preemptive Priority based Scheduling Algorithm
4:37
Lecture 44
Preemptive Priority based Scheduling Algorithm Continuation
3:32
Lecture 45
SRTF with processes requiring CPU and IO time 2
12:27
Lecture 46
Priority based scheduling with processes requiring CPU and IO time
Preview
Lecture 47
Highest Response Ratio Next Scheduling Algorithm
8:35
Lecture 48
HRRN Example
6:17
Lecture 49
Process State Diagram
9:41
Lecture 50
Suspend Ready State and Suspend IO state
9:14
Lecture 51
Dispatcher
3:55
Section 7 : Basics of Number System
Lecture 52
Basics of Binary Numbers
Preview
Lecture 53
Basics of Binary Numbers
Text
Section 8 : Memory Allocation Techniques
Lecture 54
Basics of Memory Allocation
12:33
Lecture 55
Contiguous Allocation vs Non Contiguous Allocation
5:40
Lecture 56
Fixed Partitioning
9:59
Lecture 57
Variable Partitioning
10:26
Lecture 58
Memory Allocation Algorithms
12:2
Lecture 59
Problem
6:53
Lecture 60
Problem continued
3:37
Lecture 61
Important point to note
4:57
Lecture 62
Problem
9:15
Lecture 63
Binary addressing revisited
14:9
Lecture 64
Example to explain binary addressing concepts
6:10
Lecture 65
Need for paging
11:4
$69
Take this course now.
Enroll Now
Lectures
65
Video
7:54:15 Hours
Skill level
intermdiate
level
Languages
English
Includes
Lifetime access
Certificate of Completion
Preview
×