24 Questions
In fixed partitioning, the number of ______ in RAM is fixed.
partitions
In contiguous allocation, no ______ is allowed.
spanning
In variable partitioning, the size of the ______ varies according to the need of the process.
partition
In variable partitioning, the number of ______ in RAM is not fixed and depends on the number of incoming process.
partitions
A bitmap or bit vector is a series of ______ where each bit corresponds to a disk block.
bits
In linked list, the free disk ______ are linked together.
blocks
In multiple partition allocation, a process is selected from the input ______ and loaded into the free partition.
queue
The block number of the very first disk ______ is stored at a separate location on disk.
block
The concept of a logical address space that is bound to a separate ______ address space is central to proper memory management
physical
Logical address is generated by the ______; also referred to as virtual address
CPU
The set of all ______ addresses generated by a program is called the physical address space
physical
______ is a memory management scheme in which any process can be temporarily swapped from main memory to secondary memory
Swapping
The purpose of the ______ in operating system is to access the data present in the hard disk and bring it to RAM
swapping
In ______ memory, the place where the swapped-out process is stored is called swap space
secondary
The ______ address space is the set of all logical addresses generated by a program
logical
The ______ address is the actual location in the memory
physical
External fragmentation occurs when a storage medium has many small blocks of ______ scattered throughout it.
free space
In ______ memory allocation, each process is contained in a single contiguous block of memory.
contiguous
Memory is divided into several fixed size ______ in contiguous memory allocation.
partitions
Fixed partitioning is also known as ______ and is a multiprogramming technique with a fixed number of tasks.
MFT
Variable partitioning is a memory allocation scheme that allows multiple programs to run concurrently in a shared ______ space.
memory
In ______ partitioning, the memory is divided into fixed-size partitions, and each partition is assigned to a process.
Variable
Fixed partitioning is the oldest and simplest technique used to put more than one ______ in the main memory.
processes
External fragmentation can cause ______ and performance problems.
slower
Study Notes
Memory Allocation Techniques
- In fixed partitioning, the number of partitions in RAM is fixed, but the size of each partition may or may not be the same.
- Partitions are made before execution or during system configuration, and contiguous allocation is used, with no spanning allowed.
Variable Partitioning
- Initially, RAM is empty, and partitions are made during runtime according to the process's needs.
- The size of each partition is equal to the incoming process, and the partition size varies according to the process's needs to avoid internal fragmentation.
- The number of partitions in RAM is not fixed and depends on the number of incoming processes and the main memory's size.
Free Space Management Techniques
- Bitmap or Bit Vector: a series of bits where each bit corresponds to a disk block, with 0 indicating allocation and 1 indicating a free block.
- Linked List: free disk blocks are linked together, with a free block containing a pointer to the next free block.
Memory Management
- Multiple partition allocation: a process is selected from the input queue and loaded into a free partition.
- Physical Address Space: the concept of a logical address space bound to a separate physical address space is central to proper memory management.
- Logical address: generated by the CPU, also referred to as a virtual address.
- Physical address: the address seen by the memory unit.
Logical and Physical Addresses
- Logical address space is the set of all logical addresses generated by a program.
- Physical address space is the set of all physical addresses generated by a program.
- Logical and physical addresses are the same in compile-time and load-time address-binding schemes.
- Logical and physical addresses differ in execution-time address-binding schemes.
Swapping
- Swapping is a memory management scheme that temporarily swaps a process from main memory to secondary memory.
- The purpose of swapping is to access data present in the hard disk and bring it to RAM for application programs to use.
External Fragmentation
- External fragmentation occurs when a storage medium has many small blocks of free space scattered throughout it.
- This can happen when a system creates and deletes files frequently, leaving many small blocks of free space on the medium.
- External fragmentation can cause performance problems.
Memory Techniques
- There are two memory management techniques: Contiguous and Non-Contiguous.
- Contiguous technique: executing process must be loaded entirely in main-memory, and memory is divided into several fixed-size partitions.
- Contiguous technique can be divided into Fixed (or static) partitioning and Variable (or dynamic) partitioning.
Fixed Partitioning
- Fixed partitioning is the oldest and simplest technique used to put more than one process in the main memory.
- It is a memory allocation scheme that divides memory into fixed-size partitions, and each partition is assigned to a process.
This quiz covers two partitioning techniques in Operating Systems, including fixed partitioning in RAM and variable partitioning at runtime.
Make Your Own Quizzes and Flashcards
Convert your notes into interactive study material.
Get started for free
