Section 1 : Introduction
|
Lecture 1 | INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM | |
|
Lecture 2 | About Certification |
Section 2 : Introduction to Operating Systems
|
Lecture 1 | Introduction to Computer Systems | 00:11:05 Duration |
|
Lecture 2 | How hardware devices work together | 00:06:55 Duration |
|
Lecture 3 | Need for Operating Systems from scratch | 00:08:53 Duration |
|
Lecture 4 | How Input and Output devices work together | 00:16:36 Duration |
Section 3 : Operating System Concepts
|
Lecture 1 | Program vs Process, States of a process | 00:09:25 Duration |
|
Lecture 2 | Degree of Multiprogramming | 00:05:30 Duration |
|
Lecture 3 | Types of Operating Systems | 00:11:54 Duration |
|
Lecture 4 | An Important point to note | 00:01:31 Duration |
|
Lecture 5 | About Proctor Testing |
Section 4 : CPU Scheduling Algorithms - SJF, SRTF, FCFS
|
Lecture 1 | Types of scheduler, Context switching | 00:11:24 Duration |
|
Lecture 2 | Various times of a process | 00:11:29 Duration |
|
Lecture 3 | Types of Scheduling Algorithms | 00:08:37 Duration |
|
Lecture 4 | SJF Scheduling Algorithm | 00:09:22 Duration |
|
Lecture 5 | SJF Example 1 | 00:09:18 Duration |
|
Lecture 6 | SJF Example 2 | 00:05:58 Duration |
|
Lecture 7 | Shortest Remaining Time First Scheduling Algorithm | 00:15:39 Duration |
|
Lecture 8 | Response time explained with example | 00:13:44 Duration |
|
Lecture 9 | SRTF assignment problem | |
|
Lecture 10 | SRTF assignment problem solution | 00:05:23 Duration |
|
Lecture 11 | Response Time example 2 | 00:01:21 Duration |
|
Lecture 12 | SRTF assignment problem 2 | |
|
Lecture 13 | SRTF assignment problem 2 solution | 00:04:55 Duration |
|
Lecture 14 | First Come First Served Scheduling Algorithm | 00:07:18 Duration |
|
Lecture 15 | FCFS with Context Switching overhead | 00:10:00 Duration |
Section 5 : Comparision of FCFS, SJF and SRTF - Advantages and Disadvantages
|
Lecture 1 | Starvation | 00:13:06 Duration |
|
Lecture 2 | Convoy Effect | 00:10:35 Duration |
|
Lecture 3 | Practical Implementation | 00:02:44 Duration |
|
Lecture 4 | Throughput |
Section 6 : CPU Scheduling Algorithms - LJF, LRTF, Priority-based, HRRN
Section 7 : Basics of Number System
|
Lecture 1 | Basics of Binary Numbers | |
|
Lecture 2 | Basics of Binary Numbers |
Section 8 : Memory Allocation Techniques
|
Lecture 1 | Basics of Memory Allocation | 00:12:33 Duration |
|
Lecture 2 | Contiguous Allocation vs Non Contiguous Allocation | 00:05:40 Duration |
|
Lecture 3 | Fixed Partitioning | 00:09:59 Duration |
|
Lecture 4 | Variable Partitioning | 00:10:26 Duration |
|
Lecture 5 | Memory Allocation Algorithms | 00:12:02 Duration |
|
Lecture 6 | Problem | 00:06:53 Duration |
|
Lecture 7 | Problem continued | 00:03:37 Duration |
|
Lecture 8 | Important point to note | 00:04:57 Duration |
|
Lecture 9 | Problem | 00:09:15 Duration |
|
Lecture 10 | Binary addressing revisited | 00:14:09 Duration |
|
Lecture 11 | Example to explain binary addressing concepts | 00:06:10 Duration |
|
Lecture 12 | Need for paging | 00:11:04 Duration |