English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 8.5 Hours | 6.48 GB
Learn the concepts of Operating Systems from scratch as Operating System forms the core of Computer Science
Mastering the concepts of Operating Systems is very important to get started with Computer Science because Operating System is the program which is responsible for the ease with which we are able to use computers today to solve our problems by writing application programs like Google Chrome. The concepts which we are going to study is going to give a very good understanding of Operating System like how a process is created in an Operating system , how CPU scheduling works in Operating system , what are the various scheduling algorithms we have in our Operating System, what are the allocation strategies used by Operating Systems , what are the memory management strategies used by Operating Systems , what are the page replacement strategies used by Operating Systems , how paging works in operating systems , how segmentation works in operating systems , how virtual memory works in operating systems , how multilevel paging works in operating systems , how CPU executes a process using memory manager.
Without using Operating Systems ,it is extremely difficult to communicate with the hardware devices of our computer. Every computer today has an Operating System installed in it. Through this course you will not only master the basics of Operating Systems but also get ready for venturing into advanced concepts of Operating Systems.
In this course ,every concept of Operating Systems is taught in an easy-to-understand manner such that anybody without any prerequisites will be able to master the concepts of Operating Systems in the easiest way.
Come and join me, I assure you that you will have the best learning experience of not just Operating Systems but also the core of Computer Science in a different dimension.
What you’ll learn
- You will become very familiar with the core concepts of Operating Systems
- You will be able to challenge the interviewer on questions related to Operating Systems
- You will view Computer Science in a different dimension
- You will be able to answer all questions of exams like GATE,PGEE,ISRO (after completing all parts of OS course)
- You will be able to get a top grade in your Operating systems course in your Bachelor’s degree
- Understand how Operating Systems work
- Understand how a process is created
- Understand how CPU scheduling is done in Operating Systems
- Understand the various scheduling algorithms we have in Operating Systems
- Understand how CPU , Memory and Disk work together
- Understand Memory managment in Operating Systems
- Understand how a process is moved from hard disk to RAM
- understand memory allocation strategies used by operating systems
Table of Contents
Introduction
1 Introduction
2 Important Tip
Introduction to Operating Systems
3 Introduction to Computer Systems
4 How hardware devices work together
5 Need for Operating Systems from scratch
6 How Input and Output devices work together
Operating System Concepts
7 Program vs Process , States of a process
8 Degree of Multiprogramming
9 Types of Operating Systems
10 An Important point to note
11 Process Control block, Attributes of a process
CPU Scheduling Algorithms – SJF, SRTF, FCFS
12 Types of scheduler, Context switching
13 SRTF assignment problem solution
14 Response Time example 2
15 SRTF assignment problem 2
16 SRTF assignment problem 2 solution
17 First Come First Served Scheduling Algorithm
18 FCFS with Context Switching overhead
19 Various times of a process
20 Types of Scheduling Algorithms
21 SJF Scheduling Algorithm
22 SJF Example 1
23 SJF Example 2
24 Shortest Remaining Time First Scheduling Algorithm
25 Response time explained with example
26 SRTF assignment problem
Comparision of FCFS, SJF and SRTF – Advantages and Disadvantages
27 Starvation
28 Convoy Effect
29 Practical Implementation
30 Throughput
CPU Scheduling Algorithms – LJF, LRTF, Priority-based, HRRN
31 Longest Job First Scheduling Algorithm
32 RR Important Observations
33 Advantages and Limitations of RR Algorithm
34 Non Preemptive Priority based Scheduling Algorithm
35 Preemptive Priority based Scheduling Algorithm
36 Preemptive Priority based Scheduling Algorithm Continuation
37 SRTF with processes requiring CPU and IO time
38 SRTF with processes requiring CPU and IO time 2
39 Priority based scheduling with processes requiring CPU and IO time
40 Highest Response Ratio Next Scheduling Algorithm
41 HRRN Example
42 LJF Example 1
43 Process State Diagram
44 Suspend Ready State and Suspend IO state
45 Dispatcher
46 Longest Remaining Time First Scheduling Algorithm
47 LRTF Example 1
48 LRTF Example 2
49 LRTF Example 2 continuation
50 Round Robin Scheduling Algorithm
51 RR Example 1
52 RR Example 2
Basics of Number System
53 Basics of Binary Numbers
54 Basics of Binary Numbers
Memory Allocation Techniques
55 Basics of Memory Allocation
56 Binary addressing revisited
57 Example to explain binary addressing concepts
58 Need for paging
59 Contiguous Allocation vs Non Contiguous Allocation
60 Fixed Partitioning
61 Variable Partitioning
62 Memory Allocation Algorithms
63 Problem
64 Problem continued
65 Important point to note
66 Problem
How to proceed further
67 What to do next
Resolve the captcha to access the links!