Deadlock in Operating System
Deadlock is a situation which occurs when a process or thread enters a waiting state because a resource requested is being held by another waiting process,
Operating System
Page Replacement Algorithm
There are three basic page replacement algorithms: first in first out, least recently used and
Virtual Memory
Virtual memory is a mechanism that creates the illusion of having a very big main memory. With the concept of virtual memory, the user can store processes with size bigger than the available main memory
Segmentation
Segmentation is a non-contiguous memory management technique in which the program is divided into variable size parts called segments.
Practice question on memory management
A CPU generates 32-bit virtual address. The page size is 4 KB. The processor has a translation look-aside buffer (TLB)
Paging
In paging the physical address space of a process is non-contiguous. Paging is implemented using frames and pages.
Solved Questions based on Memory Management
Q1. Request from the processes is 300k, 25k, 125k, and 50k , respectively (in order). The above request could be satisfied with? (Assume variable partition scheme) Best fit but not first fit First fit but not best fit Both best and first fit Neither best nor first fit Q2.Consider the following system: Number of pages …
Contiguous Memory Allocation
Contiguous memory allocation is one of the efficient and the easiest way of allocating memory to the processes. Each process is contained in a single
Memory Management
Memory management is one of the most important functions of an operating system. The working of a computer system majorly depends on two components: Memory and CPU
Difference between Process and Thread
If you are a programmer, you create a program by writing a code and when you run that program it becomes a process. It is very important to have a clear difference between a program and a process because one program can produce many running processes that are just different versions of a single program.