1
What is Bare Machine?
A bare machine is a machine where programs run directly on hardware, without the
help of an operating system or system software.
---
🔹 Key Characteristics:
1. No Operating System – No Windows, Linux, or any other OS.
2. Direct Hardware Access – Programs must manage memory, CPU, and I/O devices on
their own.
3. Limited Features – No file system, multitasking, or user interface unless
manually implemented.
4. Used for Simplicity or Performance – Especially in embedded systems or early
computers.
2. What is swapping??
Swapping is a memory management technique in which a process is temporarily moved
from main memory to secondary storage (swap space) to free up RAM for other
processes. Later, the process can be swapped back into memory to continue
execution.
---
🔹 Purpose:
To increase multiprogramming.
To run more processes than physical memory can hold at one time.
To manage memory pressure when RAM is full.
3.
Write the difference between paging and segmentation
Screen shot
4. What is memory Management unit)??
Memory Management Unit (MMU) is a hardware component in a computer system
responsible for handling all memory and address translation operations. It acts as
a bridge between the CPU and the physical memory (RAM).
---
Functions of MMU:
Adress, memory
Paging
Caching
Virtual memory support
1. Address Translation
Converts logical (virtual) addresses generated by the CPU into physical addresses
used by RAM.
2. Memory Protection
Prevents one process from accessing the memory space of another process, thus
providing security and stability.
3. Paging and Segmentation
Helps implement paging or segmentation techniques for efficient memory allocation.
4. Caching
Coordinates with the cache to improve performance during memory access.
5. Virtual Memory Support
Enables the use of virtual memory, allowing processes to use more memory than
physically available by storing data in secondary storage (like a hard disk).
Why MMU is Important:YHI sb uper ka
5. What do you understand by logical and physical address
. Logical Address (Virtual Address):(5 points)
It is the address generated by the CPU during program execution.
It is also called a virtual address.
This address is not the actual location in the physical memory (RAM).
Used by programs to access memory abstractly.
Managed by the Memory Management Unit (MMU).
🔹 Example:
A program might refer to memory location 0x0040, but it doesn’t know where that is
in RAM.
---
2. Physical Address:
It is the actual location in the physical memory (RAM).
It is generated after translation of the logical address by the MMU.
This is where the data is actually stored.
🔹 Example:
The logical address 0x0040 may translate to physical address 0x1A40 in RAM.
7. Diff. Etween external and internal fragmentation.
Screen shot
Write short notes on
1
Memory management
Memory Management (Short Note)
Memory management is a crucial function of the operating system that handles the
efficient allocation,deallocation ,tracking ,of memory to different processes
. It ensures that programs run smoothly by managing RAM(managing space) and
providing each process with the required memory space.
---
Key Responsibilities:
Allocation n deallocation
Tracking
Protection
Baki jo mmu ke functions hai unhe likh dena(uper se)
1. Allocation and Deallocation:
Allocates memory to processes when needed and deallocates it after use.
2. Tracking:
Keeps track of which memory parts are in use and by whom.
3. Protection:
Prevents one process from accessing another’s memory space.
2. Resident monitor
Resident Monitor (Short Note)
A Resident Monitor is an early form of an operating system that remains resident in
the main memory while jobs are executed.
It is a small program that manages the execution of batch jobs by controlling the
sequence of operations such as loading, execution, and input/output handling.
3 virtual Memory (Short Note)
Virtual Memory is a memory management technique that allows a computer to use
secondary storage (like a hard disk or SSD) as an extension of the main physical
memory (RAM).
This lets programs run as if there is more memory available than the actual
physical memory installed.
---
Key Features:
Illusion
Paging n segmentation
Page fault
Multiprogramming
Provides an illusion of a large, continuous memory space to processes.
Uses paging or segmentation to divide memory into blocks.
When a program accesses data not in RAM, a page fault occurs, and the needed data
is loaded from disk into RAM.
Enables multiprogramming, allowing multiple processes to run simultaneously without
enough physical memory for all at once.
[Link] segmentation
Paged Segmentation (Short Note)
Paged Segmentation is a memory management technique that combines the advantages of
both paging and segmentation.
---
How it works:
The program’s memory is divided into segments based on logical divisions like
functions or data structures (Segmentation).
Each segment is further divided into fixed-size pages (Paging).
Pages of different segments are mapped to physical memory frames.
[Link] Binding
Address Binding (Short Note)
Address Binding is the process of mapping a program’s logical (or symbolic)
addresses to physical addresses in memory.
---
Types of Address Binding:
1. Compile-time Binding:
The final physical address is determined during compilation. The program must
always run at that memory location.
2. Load-time Binding:
Binding occurs when the program is loaded into memory. The program can be loaded at
different locations(moved) but cannot be moved during execution.
3. Execution-time Bi nding (Dynamic Binding):
Binding occur during program execution using hardware support like the Memory
Management Unit (MMU). Allows programs to be relocated dynamically in memory
6 Dynamic realocation
Dynamic Relocation is a memory management technique where the logical address
generated by a program is converted to a physical address at RUNTIME using hardware
like the Memory Management Unit (MMU).
---
How It Works:
Uses two special hardware registers:
Base Register: Holds the starting physical address.
Limit Register: Defines the size of the memory segment.
When a process accesses memory, the logical address is added to the base register
to form the physical address.
Advantages:
Allows programs to be RELOCATED in memory during execution.
Supports multiprogramming and better memory utilization.
Provides protection and isolation between processes.
[Link] of reference
Locality of Reference (Short Note)
Locality of Reference
describes the tendency of a program to access a small portion of memory repeatedly
over a short period of time.
---
Types of Locality:
1. Temporal Locality:
Recently accessed memory locations are likely to be accessed again soon.
📌 Example: Accessing the same variable in a loop.
2. Spatial Locality:
Memory locations near recently accessed addresses are likely to be accessed soon.
📌 Example: Accessing elements of an array sequentially.
Importance:
Forms the basis for designing, virtual memory, and paging systems.
Improves system performance by keeping frequently accessed data close to the CPU.
Long answer
1
Explain the Multiprogramming with fixed partition and variable partition.
Fixed Partitioning:
In fixed partitioning, memory is divided into fixed-size blocks (partitions) at
system startup.
🔹 Features:
Each partition holds exactly one process.
Number and size of partitions are fixed.
Unused memory inside a partition leads to internal fragmentation.
🔹 Advantages:
Simple to implement.
Easy to allocate and manage.
🔹 Disadvantages:
Limited number of programs can run.
Memory waste due to internal fragmentation.
Inefficient for processes of varying sizes.
---
✅ 2. Variable Partitioning:
In variable partitioning, memory is divided dynamically to fit the exact size of
incoming processes.
🔹 Features:
Partitions are created at runtime based on process size.
Utilizes memory more efficiently.
Leads to external fragmentation (free memory scattered between blocks).
🔹 Advantages:
Efficient memory use—no internal fragmentation.
Can load more or larger programs compared to fixed partitioning.
🔹 Disadvantages:
Complex memory management.
Suffers from external fragmentation.
May require compaction to combine free space.
[Link] the protection is provided to main memory in contiguous allocation
Protection in Main Memory (Contiguous Allocation)
In contiguous memory allocation, each process is loaded into a single continuous
block of physical memory. To protect the memory of each process and prevent
unauthorized access, the operating system uses hardware-based protection
techniques.
---
✅ How Protection Is Provided:
🔹 1. Base Register:
Stores the starting physical address of the process.
Any logical address generated by the program is added to this base value to get the
physical address.
🔹 2. Limit Register:
Stores the length (limit) of the allocated memory block.
Ensures that the process cannot access memory beyond its boundary.
[Link] do you understand by paging? Explain with example
Paging is a memory management technique used by operating systems to manage process
memory in fixed-size blocks.
It helps eliminate external fragmentation by dividing both the logical (virtual)
memory and the physical memory into equal-sized blocks:
Pages → logical memory blocks.
Frames → physical memory blocks.
---
⚙️ How It Works:
1. Logical Address = (Page Number, Offset)
The CPU generates a logical address. The OS uses a page table to map each page
number to a frame number in physical memory.
2. Translation
Logical address → Physical address
The OS checks the page table to find which frame the page resides in and combines
it with the offset to get the exact physical address.
---
📌 Example:
Suppose:
Logical memory = 16 KB, divided into 4 KB pages → 4 pages
Physical memory = 32 KB, divided into 4 KB frames → 8 frames
Let’s say:
Page 0 → Frame 5
Page 1 → Frame 2
Page 2 → Frame 7
Page 3 → Frame 4
Logical Address:
Let’s say the CPU generates address Page 2 + Offset 1000
👉 Page Table says: Page 2 → Frame 7
👉 Physical Address = Frame 7 + Offset 1000 = (7 × 4KB) + 1000 = 28KB + 1000 =
29,000
---
✅ Advantages:
Removes external fragmentation
Efficient use of memory
Easy to swap pages in/out
[Link] is TLB? Explain the hardware support with TLB for paging technique.
TLB stands for Translation Lookaside Buffer.
It is a high-speed, hardware cache used in a paging system to store recent page
table entries (i.e., page-to-frame mappings).
---
🔍 Why TLB is Needed?
In paging, every memory access needs:
1. Page number lookup in Page Table (takes time)
2. Then accessing actual memory
👉 This slows down performance.
➡️ So, the TLB speeds up this translation by caching recent page table entries.
---
⚙️ Hardware Support with TLB:
✅ Step-by-Step Process:
1. CPU generates logical address → (Page Number, Offset)
2. TLB is checked first:
If Page Number is in TLB → TLB hit → Get Frame Number quickly
If not → TLB miss → Access Page Table in memory → Then update TLB
3. Physical Address = Frame Number + Offset
4. Memory is accessed using the physical address.
5. Explain segmentation with example
Done
6.) Explain the contiguous memory allocation methods ( Best Fit, Worst Fit, First
Fit)
Methods to Allocate Free Memory:
---
1. First Fit
How it works:
Allocate the first free block of memory that is large enough for the process.
Example:
Suppose free blocks are: [100 KB, 500 KB, 200 KB, 300 KB]
Process needs 212 KB → Allocated in the first block ≥ 212 KB, which is 500 KB
block.
Pros:
Fast allocation because it stops searching after first suitable block.
Cons:
Can cause small leftover fragments at the start of memory → leads to external
fragmentation.
---
2. Best Fit
How it works:
Allocate the smallest free block that is big enough for the process.
Example:
Free blocks: [100 KB, 500 KB, 200 KB, 300 KB]
Process needs 212 KB → Choose the smallest block ≥ 212 KB, which is 300 KB.
Pros:
Leaves smallest leftover space → reduces waste.
Cons:
Takes more time to search entire list.
Can cause many tiny unusable fragments → external fragmentation.
---
3. Worst Fit
How it works:
Allocate the largest free block available.
Example:
Free blocks: [100 KB, 500 KB, 200 KB, 300 KB]
Process needs 212 KB → Allocate from 500 KB block.
Pros:
Leaves large leftover fragments → possibly better for future allocations.
Cons:
Can lead to inefficient use of large blocks, increasing fragmentation.
8.
) What do you understand by page replacement algorithms? Explain different page
replacement algorithm with suitable example.
When a page fault occurs (i.e., the page needed is not in physical memory), the
operating system needs to bring that page from secondary storage (like disk) into
memory. But if the physical memory (RAM) is full, OS must replace (remove) one of
the existing pages to free space for the new page.
A Page Replacement Algorithm decides which page to remove from memory to minimize
page faults and optimize performance.
---
📝 Why is Page Replacement Needed?
Physical memory has limited frames.
When all frames are full and a new page is requested, one page must be replaced.
The goal: Replace a page that will not be needed soon.
---
Common Page Replacement Algorithms:
---
1. FIFO (First-In, First-Out)
Replace the page that came first (oldest page in memory).
Simple queue structure.
Example:
Frames = 3
Reference string: 7, 0, 1, 2, 0, 3, 0, 4
Step Pages in Frame Page Fault?
7 7 Yes
0 7, 0 Yes
1 7, 0, 1 Yes
2 0, 1, 2 Yes (7 replaced)
0 0, 1, 2 No
3 1, 2, 3 Yes (0 replaced)
0 2, 3, 0 Yes (1 replaced)
4 3, 0, 4 Yes (2 replaced)
---
2. LRU (Least Recently Used)
Replace the page that was least recently used.
Requires tracking page usage history.
Example:
Frames = 3
Reference string: 7, 0, 1, 2, 0, 3, 0, 4
Step Pages in Frame Page Fault?
7 7 Yes
0 7, 0 Yes
1 7, 0, 1 Yes
2 0, 1, 2 Yes (7 replaced)
0 0, 1, 2 No
3 0, 2, 3 Yes (1 replaced)
0 0, 2, 3 No
4 4, 2, 3 Yes (0 replaced)
9.) What is thrashing? Explain the causes of thrashing.
Thrashing is a situation in an operating system where too much time is spent on
swapping pages in and out of memory, and very little useful work is done by the
CPU.
👉 It happens when the system is overloaded with processes, and each process doesn’t
get enough frames. As a result, page faults increase rapidly, and the system
continuously swaps pages, causing severe slowdown.
Causes of Thrashing:
1. High Degree of Multiprogramming
System overloaded with lot of processes
Each process unable to get enough frames(space)
Frwuent page faults starts ocuuring
2. Insufficient Frame Allocation
Processes do not get enough memory.
Pages are continuously replaced and reloaded.
3. Lack of Locality
If a process doesn’t follow the principle of locality (using the same few pages
repeatedly), more pages are needed at a time.
Leads to frequent page replacements.
4. Bad Page Replacement Algorithm
Poor replacement choices can remove frequently needed pages.
Increases the number of page faults.
[Link] to overcome thrasing??Explain working set model technique with example to
reduce thrashing.
Type
✅ How to Overcome Thrashing:
1. Use Working Set Model.
2. Reduce degree of multiprogramming.
3. Use local page replacement.
4. Allocate enough frames per process.
✅ Working Set Model:
The working set of a process is the set of pages it has used in the last Δ time.
OS tracks the working set size (WSS) of each process.
If total WSS > available memory, thrashing occurs.
OS can suspend some processes to reduce load.
---
✅ Example:
If there are 100 frames and:
P1 WSS = 20
P2 WSS = 30
P3 WSS = 25
P4 WSS = 35
Total WSS = 110 > 100 → Thrashing
So, OS suspends P4 (WSS = 35)
New WSS = 75 → Thrashing stops.