Take Mock Exam #34
A specially designed blog for sharing and distributing UGC NET Computer Science examination materials viz Exam Syllabi, Previous Questions,Current Trends, Topics like Mobile Computing, Operating System, Database Management System,Computer Networks,System analysis and Design, and Programming using C & C++ etc.
Search Topics....
Sunday, November 5, 2017
Deadlock : OS
1. In this Algorithm, it is assumed that a deadlock will never occur
A.Banker's Algorithm
B.Dijkstra's algorithm
C.Ostrich Algorithm
D.Greedy Algorithm
This approach may be used in dealing with deadlocks in concurrent programming if they are believed to be very rare and the cost of detection or prevention is high. It is named for the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem."
2. Resources are allocated to the process on non-sharable basis is
A. mutual exclusion
B. hold and wait
C. no pre-emption
D. circular wait
3. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
A. resource allocation graph
B. starvation graph
C. inversion graph
D. none of the mentioned
4.Name the situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function.
A.Starvation
B.Fragmentation
C.Deadlock
D.None of these
5. Banker's algorithm is
A.Deadlock Prevention
B.Deadlock Detection
C.Deadlock Avoidance
D.All of these
A.Banker's Algorithm
B.Dijkstra's algorithm
C.Ostrich Algorithm
D.Greedy Algorithm
This approach may be used in dealing with deadlocks in concurrent programming if they are believed to be very rare and the cost of detection or prevention is high. It is named for the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem."
2. Resources are allocated to the process on non-sharable basis is
A. mutual exclusion
B. hold and wait
C. no pre-emption
D. circular wait
3. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
A. resource allocation graph
B. starvation graph
C. inversion graph
D. none of the mentioned
4.Name the situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function.
A.Starvation
B.Fragmentation
C.Deadlock
D.None of these
5. Banker's algorithm is
A.Deadlock Prevention
B.Deadlock Detection
C.Deadlock Avoidance
D.All of these
HSST Exam Preparation
1. Processor manufactured by AMD
- Sempron.
- Phenom.
- Turion.
- All of these
2. Which unit is largest
- Yotta Byte
- Peta Byte
- Tera Byte
- Zeta Byte
3.
X is an electronic toll collection system by national highway
authority of India. It was initially set up in the golden quadrilateral
stretch but now is implemented in over 247 toll plaza across national
highways. Name this system which uses Radio frequency identification to
work
- Speedtag
- Fastrack
- Fastag
- Speedtrack
4.Technique
for defeating a cipher or authentication mechanism by trying to
determine its decryption key or passphrase by trying hundreds or
sometimes millions of likely possibilities
- Salami Attack
- Data Diddling
- Data Mining
- Dictionary Attack
5. Characteristics of Salami Attack
- Small attacks add up to one major attack that can go undetected
- unauthorized changing of data before or during their input to a computer system
- process of discovering patterns in large data sets
- All of these
Subscribe to:
Posts (Atom)