OS-UNIT-4 (Lecture-23)

 MEMORY ALLOCATION & PARTITIONING 

UNIT-04 (Lecture-23) As per S.B.T.E. Syllabus, Bihar

Dear Reader, this exclusive notes are prepared based on the State Board of Technical Education (SBTE) syllabus for polytechnic students. The objective of this exclusive notes is give clear concepts about the Memory Allocation & Partitioning in Operating System. The Contiguous Memory Allocation Techniques are of two types such as Static Partitioning (Fixed Size Partitioning Technique) & Dynamic Partitioning (Variable Size Partitioning Technique). These both Partitioning Techniques are explained clearly with the help of diagrams in point-wise. Advantages & Disadvantages of these both techniques are also discussed in this lecture for your better understanding. Algorithms for Partitioning Allocation are also explained in details with diagrams in point-wise. The important Algorithms for Partitioning Allocation are First Fit Algorithm, Next Fit Algorithm, Best Fit Algorithm, Worst Fit Algorithm and Quick Fit Algorithm are discussed in this exclusive notes. Theses each Algorithm for Partitioning Allocation explained clearly based on diagram in point-wise. 

Some related concepts covered in this notes are:

1. Concept of Memory Allocation & Partitioning 
2. Contiguous Memory Allocation Techniques
3. Concepts of Static & Dynamic Partitioning
4. Advantages & Disadvantages of Static & Dynamic Partitioning
5. Concept of Algorithm for Partitioning Allocation
6. Explanation of each Algorithm for Partitioning Allocation

• Tweet
• Share
• Share
• Share
• Share

Related Post