1:

With a single resource, deadlock occurs

2:

A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then

 A. deadlocked state is unsafe B. unsafe state may lead to a deadlock situation C. deadlocked state is a subset of unsafe state D. all of these Answer Report Discuss Option: D Explanation : Safe State A system is in a safe state only if there exists a safe sequence of processes P1, P2, P3, Pn where: For each Pi, the resources that Pi can still request can be satisfied by the currently available resources plus the resources help by all Pj, j
3:

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

 A. 4 B. 3 C. 2 D. 1 Answer Report Discuss Option: C Explanation : Two processes can never lead to deadlock as the peak time demand of 6 (3 + 3) tape drives can be satisfied. But 3 processes can lead to a deadlock if each hold 2 drives and then demand one more. Click on Discuss to view users comments. Write your comments here:
4:

'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up

 A. deadlock can never occur B. deadlock may occur C. deadlock has to occur D. none of these Answer Report Discuss Option: A Explanation : Using Banker's algorithm, one can show that one process has to acquire all its needed resources. This process, after completing its task, will release all its resources, thereby avoiding any possible deadlock. Click on Discuss to view users comments. Write your comments here:
5:

Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is

Syllabus covered in this section is-

• Main functions of operating systems
• Memory Management- Virtual memory, paging, fragmentation
• Concurrent Processing: Mutual exclusion, Critical regions, locks and unlock.
• Scheduling: CPU scheduling. I/O scheduling, Resource scheduling
• Banker's algorithm for deadlock handling.

This Section covers Operating System Questions Answers .These questions can be used for the preparation of various competitive and academic exams like

• UGC NET Computer Science
• Pre PhD Entrance Exam
• DOEACC Exams
• Kendriya Vidyalaya Sangathan Entrance Exam
• GATE Computer Science
• Post Graduate Computer Science Test
•  PhD Entrance Exam
• Computer Engineering
• State Eligibility Test (SET)
• National Eligibility Test (NET)

Who can benefit

• Operating System Objective Questions Answers can be used by any student who is preparing for PhD entrance exam, pre PhD entrance exam, entrance exam or any other such exam.
• Any student who is preparing for DOEACC exams can also use Operating System questions answers for preparation of his exams.
• Operating System mcq can be useful for the students who are pursuing any undergraduate or post graduate degree in computer science like BE, ME , Btech, Mtech, .BSc, MSc, BCA, MCA, BS, MS  or any other such degree
• Operating System mcq with answers and explanation can also be useful for the students who are preparing for any competitive exam or recruitment exams like GATE Computer Science, UGC NET Computer Science, Kendriya Vidyalaya Sangathan PGT exam, PSU, IES or any other such exam.
• Operating System multiple choice questions answers  can also be used by any candidate who wants to gain credits in Operating System in BS Computer science or MS Computer science,