Computer knowledge

Deadlock Questions and Answers pdf Define a deadlock? A process is said to be in a state of deadlock if it is waiting for a particular event (e.g. allocation of resources) that will never occur. Name four necessary conditions for Deadlock? Mutual Exclusion  Hold-and-Wait No Preempting  Circular Wait Describe the Mutual Exclusion condition for deadlock? Mutual exclusion condition indicates the locking of resources in exclusive mode, also known as a non-shareable mode. Each resource may be allocated to only one process at a time. If another process needs to use that resources, then the requesting process must wait until the resources have been released. What is the Hold-and Wait condition for deadlock? In a deadlock, each involved process holds one or more resources and waits for additional resources, which are currently being held by other processes in the system. It means that a deadlock may occur only if every involved process holds one or more resources and further needs additional r

 Virtual Memory Exam Questions and Answers Define Virtual memory. What is its main advantage? Virtual memory is a logical technique that allows the execution of processes that are not completely in the main memory of a computer system. Only the main pages of a process are loaded into memory while the remaining pages are kept on the backing store. The main advantage of the virtual memory technique is that it allows users to execute processes that are larger than the actual size of physical memory. What do you know about demand paging? Demand paging is a logical technique, which is commonly used to implement virtual memory in a system. This logical technique has combined features of simple paging and overlaying in a system. In a demand-paged system, each page of a process is stored contiguously in the paging swap space on secondary storage (disk). With demand paging, a page is loaded into main memory only when it is needed (or demanded) during process execution. What is meant by page fau