Table of Contents
On this page, you will find all the most important and most asked questions from unit 4 of the Operating System subject.
Questions
- What do you mean by memory protection.
- What is address binding.
- Write the difference between logical address space and physical address space.
- What do you understand by overlays.
- What do you mean by swapping?
- Explain the single partitioning scheme in memory.
- Explain the multiple partitioning scheme in memory. Write its advantage and disadvantage.
- What do you mean by dynamic partitioning. Write its advantage and disadvantage.
- What is external and internal fragmentation?
- Discuss the dynamic memory allocation technique.
- Explain the term paging. How page table is implemented?
- Discuss the cache memory organization.
- Write the different technique for page table implementation.
- What do you mean by segmentation?
- What do you mean by virtual memory? How memory management unit translate the virtual address in the physical address.
- What is demand paging? write its advantage.
- Write the steps for handling a page fault.
- What do you mean by EAT(effective Access Time).
- Write the difference between Paging and Segmentation.
- What is page replacement policy?
- Explain the various page replacement algorithm with suitable examples.
- What do you mean by Belady’s anomaly?
- Write a note on Thrashing.
What did you think?
Similar Reads
-
Advantages and Disadvantage of User level and Kernel Level Threads
User-Level Threads Advantages of User-Level Threads Speed and Efficiency: Operations such as thread creation, switching, and destruction are faster because… -
Difference Between User-level and kernel-level thread
User-level and kernel-level threads represent two approaches to thread management in operating systems. Both have some differences Difference Between User-level… -
What is Deadlock in OS? Explain with the help of a diagram.
A deadlock is a condition where each of the processes is waiting for a resource which is allotted to other… -
Preemptive and Non-Preemptive Algorithm in Operating System
Preemptive Scheduling Algorithm Here, a scheduler can preempt a running low-priority process at any time when a high-priority process enters… -
CPU scheduling algorithms Criteria in Operating System
There are different criteria for the CPU scheduling algorithm. CPU scheduling algorithms Criteria are CPU utilization: The main purpose of… -
Sleeping Barber Problem of Synchronization in Operating System
It is a synchronization and inter-process communication problem. This problem is based on a barbershop. A barbershop has a single… -
Reader-Writer Problem in Operating System with Code
The readers and writers problem based on an object like a file which is shared in different processes. Some processes… -
Discuss the Classical problem of synchronization
Using semaphores for synchronization is the traditional way to present the solutions. There are four types of the classical problem… -
Semaphore in Operating System and its types
A semaphore is simply an integer variable that is shared between multiple threads. We can also say A semaphore is… -
Mutual exclusion in Operating System with its four conditions
When a process is executed in a critical section, then no other process can be executed in their critical section.…