Why an OS has to schedule processes Processes or jobs competing for CPU are not of the same type or have the same level of importance. For example some processes are CPU bound while other processes are IO bound. In the later case when a process blocks for IO the OS should let other processes
Relatively speaking, retrieving data from hard disk drivers is always slow compared to CPU and memory access due to the mechanical nature of the magnetic disk. Disk arm movement is very expensive operation therefore operating systems use disk scheduling algorithms to reduce seek time. Below you can find a summary of some of the well
This is a summary of my notes on operating systems file allocation methods. In the context of operating systems file allocation refers to managing files on disk such that disk space is effectively utilized and files are accessed quickly. Contiguous Allocation All blocks of the file are consecutive on disk Deleting files leaves gaps Compacting
What is Virtualization? A virtual machine is an isolated runtime environment which consists from a guest operating system and applications. Virtualization enables a single computing system to look like many computers where multiple virtual machines can run on a single physical machine. The size and power of individual virtual machines is variable and configurable. Each
Question I was asked this question in an interview. How do you implement one-to-one, one-to-many, and many-to-many relationships while designing tables Answer one-one relationship is most likely forced by business rules but it does not flow naturally from the data. One can combine both tables into one table without breaking normalization rules. To implement this
