In this video, we dive deep into the concept of Fixed Partitioning in operating systems. Fixed partitioning is one of the earliest and simplest memory management schemes used to allocate system memory to processes. We’ll explore how it works, its advantages, and the limitations that come with this approach.

What You’ll Learn:

The basics of memory management in operating systems
How fixed partitioning divides memory into fixed-size blocks
The pros and cons of using fixed partitioning
Real-world examples of where fixed partitioning is used
Whether you're a computer science student, a developer, or just curious about how operating systems manage memory, this video is perfect for you. Don’t forget to like, share, and subscribe for more educational content!

#FixedPartitioning #memorymanagement #computerscience #operatingsystems #memoryallocation

---------------------------------------------
#Chapter5
#MemoryManagement
#MemoryManagementTechnique
#FixedPartition
Numbers of partitions are fixed.
In RAM multiple partitions are present in which we put fragments of a process (in contiguous or non-contiguous manner.)
When we start our system/ machine the operating system get mounted in RAM in order to load. It takes some space in the RAM and rest space is left for the process to get executed.
In fixed partition when the system load at that time number of partitions are divided, but what will be the size of all partitions it is not decided (it can be same or different.)
Contiguous allocation so spanning is not allowed, which means a process will not be divided into more than one partition. The complete process will come in one partition.
Fixed partitioning was used in 1960s, the advantage of this process is that it is easy to implement but it has many disadvantages so it is not used now.
The size of the process should be less than the size of the partition otherwise the process cannot be placed in the RAM (partition).
Case 1:
The process P1 size is 4 MB, than we will place that process in the 4 MB partition (as shown in fig(i)) and the process will be executed successfully and got terminated.
Case 2:
The process P1 has a size of 2 MB, than we will place that process in the 4 MB partition (as shown in fig(i)), than the 2 MB of that 4 MB will remain empty and in future we cannot use it.
Because it is contiguous we cannot divide process into multiple fragments. And this thing is known as Internal fragmentation.
Internal fragmentation: Suppose we have a process P2 of size 7 MB, we place P2 in the RAM of partition 8 MB (as shown in fig(i)), now 1 MB left empty but we cannot use it (partition) to place another process in it and this is known as #InternalFragmentation
Case 3:
Limit in process size for example if we want to place a process with size 32 MB in fig(i), we cannot do that because there is no partition which can accommodate 32 MB size process.
Case 4:
#DegreeOfMultiprogramming is limited, it means as you can see in fig(i) we have 4 partitions so the maximum number of process we can put in RAM is 4 but in case more than 4 processes came then we cannot place them in RAM because number of partitions are limited.
#ExternalFragmentation: Suppose the process allocation to RAM is using contiguous method, and all the slots are filled but there is some vacant space in some slots (internal fragmentation) and then another process came whose size is less than the total vacant size in all partition, but we cannot allocate that process to RAM, because in contiguous allocation we do not break process into multiple fragments.
Note: If there is internal fragmentation present than external fragmentation will also be there.
#OperatingSystem #OS #asadnomanee #banglalecture #CSE
#Lecturelia #MBSTU #MBSTU_CSE
#lecturelia #banglatutorial #bangla