Operating Systems from scratch – Part 2

Operating Systems from scratch – Part 2
Operating Systems from scratch – Part 2
English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 12.5 Hours | 16.1 GB

Learn memory management in operating systems 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 what are the allocation strategies used by Operating Systems , what are the memory management strategies used by Operating Systems , paging in operating systems, page replacement in 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 Operating Systems but also get ready for venturing into advanced concepts of Computer science

In this course ,every concept of Operating Systems is taught in an easy-to-understand manner such that anybody who has basic knowledge of operating systems like scheduling, devices in out computer, how a process is created etc. can understand this course well.

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 master Memory Management in Operating Systems
  • You will be very comfortable with advanced topics like Paging
  • You will be able to have a good grasp over computer science
  • You will be able to understand other advanced topics of computer science like Distributed Systems
  • You will be able to understand other advanced topics of computer science like Computer Organization
  • You will be able to understand other advanced topics of computer science like Database Systems
  • understand memory allocation strategies used by operating systems
Table of Contents

Introduction
1 About the course
2 Important Tips

Basics of Memory Management (Cover it only if you have not watched part 1)
3 Important point
4 Important point to note
5 Problem
6 Binary addressing revisited
7 Example to explain binary addressing concepts
8 Basics of Binary numbers
9 Basics of Memory Management
10 Address Space and Types of allocation
11 Fixed Partitioning
12 Variable Partitioning
13 Memory Allocation Algorithms
14 Problem
15 Problem continued

Paging
16 Need for paging
17 Important points to observe
18 Problem on number of pages
19 How CPU executes a process in contiguous allocation
20 Basics of paging (Just an intro)
21 Paging explained with example 1
22 Paging explained with example 1 continued
23 Paging explained with example 2
24 Internal Fragmentation Revisited
25 Relation between LA,LAS and PA,PAS
26 Problem on number of frames

Problems on Paging
27 Problem 1 on Paging
28 Problem 2 on Paging
29 Problem 3 on Paging
30 Problem 4 on Paging
31 Problem 5 on Paging
32 Problem 6 on Paging

Multilevel Paging
33 Summary of Paging
34 Need for Multilevel Paging
35 Contiguous vs Single level paging vs Multilevel paging
36 Contiguous vs Single level paging vs Multilevel paging continued
37 Multilevel Paging Intro
38 Multilevel Paging Intro continued

Multilevel Paging Problems
39 Problem 1 on Multilevel Paging
40 Problem 8 on Multilevel Paging
41 Problem 1 on Multilevel Paging continued
42 Problem 2 on Multilevel Paging
43 Problem 2 on Multilevel Paging continued
44 Problem 3 on Multilevel Paging
45 Problem 4 on Multilevel Paging
46 Problem 5 on Multilevel Paging
47 Problem 6 on Multilevel Paging
48 Problem 7 on Multilevel Paging

Page Table Entry
49 Important point to note
50 Frame number field and Referenced bit
51 PresentAbsent bit and Dirty bit
52 Protection bits
53 Summary of Page Table Entry
54 Advantage of Dirty bit field in Page Table entry

Page Table Entry Problems
55 Problem 1 on Page Table Entry
56 Problem 2 on Page Table Entry
57 Problem 3 on Page Table Entry
58 Problem 4 on Page Table Entry
59 Problem 5 on Page Table Entry

Virtual Memory
60 Locality of Reference and Virtual Memory explained
61 Advantages of Virtual Memory

Average Memory Access Time (AMAT)
62 Page Hit and Page Fault Explained
63 Average Memory Access Time Explained
64 Another way of looking at AMAT
65 AMAT explained with example
66 Relation between Number of levels of Paging and Number of RAM Accesses

Translation Lookaside Buffer (TLB)
67 Need for TLB
68 TLB Explained with example 1
69 TLB Explained with example 2
70 Computing TLB hit ratio
71 Computing TLB Access Time
72 Computing RAM Access Time

Problems on TLB
73 Problem 1 on TLB
74 Problem 2 on TLB
75 Problem 3 on TLB
76 Problem 4 on TLB

Frame Allocation
77 Need for Frame Allocation for a process
78 Need for Frame Allocation for a process continued
79 Frame Allocation Types
80 Important point to note
81 Difference between static and dynamic
82 Dynamic Frame Allocation
83 Starvation Problem Revisited

Page Replacement Algorithms
84 Local vs Global Page Replacement policies
85 Example 2 on FIFO Page Replacement Algorithm
86 Example 2 on MRU Page Replacement Algorithm
87 Example 2 on Optimal Page Replacement Algorithm
88 Important Observations
89 Example 3 on LRU Page Replacement Algorithm
90 Example 3 on FIFO Page Replacement Algorithm
91 Example 3 on Optimal Page Replacement Algorithm
92 Why Local Page Replacement is prefered
93 Demand Paging Explained
94 Example 1 on LRU Page Replacement Algorithm
95 Example 1 on FIFO Page Replacement Algorithm
96 Example 1 on Optimal Page Replacement Algorithm
97 Example 1 on MRU Page Replacement Algorithm
98 Example 1 on LIFO Page Replacement Algorithm
99 Example 2 on LRU Page Replacement Algorithm

Advanced Problems on Page Replacement Algorithms
100 Problem 1
101 Problem 1 continued
102 Problem 2
103 Problem 3

What Next
104 What Next


Download from Rapidgator

Download from Turbobit