View note:Operating-Systems-10CS53-unit-4



Questions of this subject!.

QuestionLikes!Dislikes!Answers!
1)Why is deadlock state more critical than starvation? Describe resource allocation graph with a deadlock with a cycle but no deadlock.

002
2)What are two options for breaking deadlock?

101
3)What is wait for graph ? How is it useful for detection of deadlock?

001
4)Solve the deadlock to find safe or unsafe state?

001
5)Describe necessary conditions for a deadlock situation to arise?

001
6)Explain different methods to recover deadlocks

002
7)Give an example of a general resource graph that cannot be completely reduced, but which represents a system state that is free from deadlock?.

111
8)What all are the break conditions for deadlock?

001
9)What is mutual exclusion?

004
10)Explain process state with a diagram.

001
11)What is meant by circular wait?

001
12)What are the different commands available to check the disk usage?

001
13)When is a system safe?

001
14)What are the four condition for deadlock.

001
15)Explain the three methods of handling deadlocks.

001
16)Draw a wait for graph for 5 processes waiting for adjacent resources.

001
17)Explain safety algorithm in Operating system

001
18)Explain resource-request algorithm.

001
19)What is deadlock modelling?

001
20)What is resource abstraction?

001
21)What do you mean by wait state?

001
22) What is the possible order of life-cycle hooks?

001
23)Describe any two methods for deadlock detection in Distributed databases.-Distributed databases-Mumbai University-Sem 6-May 2015

101
24)How are inject printer different from Dot-Matrix printer? CBSE CLASS VI-2015

001
25)C onsider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of 𝐾 instances. Resource instances can be requested and released only one at a time. The largest value of 𝐾 that will always avoid deadlock is ____.

001
26)In a system, there are three types of resources: 0 E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[P2,F] is the maximum number of instances of F that P2 would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation.

101
27)Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]); wait(m[(i+1) mode 4]); ------ release (m[i]); release (m[(i+1)mod 4]); This could cause (GATE CS 2000) (a) Thrashing (b) Deadlock (c) Starvation, but not deadlock (d) None of the above

100
28)Which one of the following functions is used to determine whether a class exists?

001
29)The step-by-step instructions that solve a problem are called _____ A. an algorithm B. a list C. a plan D. a sequential structure

001
30)The step-by-step instructions that solve a problem are called _____ A. an algorithm B. a list C. a plan D. a sequential structure

000
31)Deadlock implies Starvation?

001
32)To claim the reward, a special transaction called a?

101
33)If you recover a deleted branch, what work is restored?

002
34)Which one of the following functions is used to determine whether a class exists?

001
35)How does one prevent the following Warning ‘Warning: Cannot modify header information – headers already sent’ and why does it occur in the first place?

001
36)What is the difference between HTTP request and response?

002
37)If you are assigned a task, to find the information of PROCEDURES. What are the basic commands that you will use to do so?

000
38)True or false: HTTP requires certificates

001
39)What is HTTP request lines?

002
40)What are the advantages of request methods available in HTTP?

001
41)What are the core components of an HTTP request?

002
42)What measures would you put in place to prevent brute forcing?

001