Skip to main content

PROGRAM MASTER OF COMPUTER APPLICATION SEMESTER II SUBJECT CODE & NAME MCA211 – OPERATING SYSTEM BK ID B1405 NUMBER OF ASSIGNMNETS, CREDITS & MARKS 2, 4 Credits,30 marks each


Q.3. Define Deadlock. Explain necessary conditions for deadlock.                                             2+8
Answer:-
Deadlock:-
Several processes compete for a finite set of resources in a multi programmed environment. A process requests for resources that may not be readily available at the time of the request. In such a case the process goes into a wait state. It may so happen that this process may never change state because the requested resources are held by other processes which themselves are waiting for additional resources and hence in a wait state. This situation is called a deadlock.

Necessary Conditions for Deadlock:-
A deadlock occurs in a system if the following four conditions hold simultaneously:
1) Mutual exclusion: At least one of the resources is non-sharable, that is, only one process at a time can use the resource. 
2) Hold and wait: A process exists that is holding on to at least one resource and waiting for an additional resource held by another process. 
3) No pre-emption: Resources cannot be pre-empted, that is, a resource is released only by the process that is holding it.
4) Circular wait: There exist a set of processes P0, P1… Pn of waiting processes such that P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2… Pn-1 is waiting for a resource held Pn and Pn is in turn waiting for a resource held by P0.

(9899682018 What’s App and call)

YOU CAN CONTACT US 10 A.M TO 8 P.M

CHARGES – ASSIGNMENTS PER SEM 600, PER PAPER 150

Comments

Post a Comment

Popular posts from this blog

SQL Server interview questions along with their answers

1.     What is SQL Server? SQL Server is a relational database management system (RDBMS) developed by Microsoft. It is used to store, retrieve, and manage data efficiently. What is the difference between SQL and SQL Server? SQL (Structured Query Language) is a standard language used to communicate with and manipulate databases. SQL Server is a relational database management system that implements the SQL language.  What are the different types of backups available in SQL Server? SQL Server supports several types of backups, including Full Backup, Differential Backup, Transaction Log Backup, and File or Filegroup Backup. What is normalization in SQL Server? Normalization is the process of organizing data in a database to reduce redundancy and dependency. It helps in improving data integrity and performance.  What is a clustered index? A clustered index determines the physical order of data in a table. A table can have only one clustered index, and it...
Post a Comment
Read more

NMIMS Global Access Assignment _2019

Business_Statistics_Assignment_June_2019 Business_Law_Assignment_June_2019 Essentials_of_HRM_Assignment_June_2019 Financial_Accounting_and_Analysis_Assignment_June_2019 Marketing_Management_Assignment_June_2019 Strategic_Management_Assignment_June_2019 For Assignment Solution Contact Niraj kumar Call and whatsapp (9899682018) Mail:-Nirajkumar294@gmail.com
Post a Comment
Read more

Define algorithm and write a note on Complexity and Time- Space Tradeoff with example.

ASSIGNMENT SET -2 Q.1.Define algorithm and write a note on Complexity and Time- Space Tradeoff with example. Answer:- Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created independent of underlying languages, i.e. an algorithm can be implemented in more than one programming language. From the data structure point of view, following are some important categories of algorithms − Search − Algorithm to search an item in a data structure. Sort − Algorithm to sort items in a certain order. Insert − Algorithm to insert item in a data structure. Update − Algorithm to update an existing item in a data structure. Delete − Algorithm to delete an existing item from a data structure. Characteristics of an Algorithm Not all procedures can be called an algorithm. An algorithm should have the following characteristics − Unambiguous − Algorithm should be clear a...
Post a Comment
Read more