1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider a disk system with $$100$$ cylinders. The requests to access the cylinders occur in following sequence:
$$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$$
Assuming that the head is currently at cylinder $$50,$$ what is the time taken to satisfy all requests if it takes $$1$$ $$ms$$ to move from one cylinder to adjacent one and shortest seek time first policy is used?
A
$$95\,\,ms$$
B
$$119\,\,ms$$
C
$$233\,\,ms$$
D
$$276\,\,ms$$
2
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2 units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely satisfied. Three processes P1, P2, P3 request the sources as follows if executed independently. GATE CSE 2009 Operating Systems - Deadlocks Question 13 English Which one of the following statements is TRUE if all three processes run concurrently starting at time t = 0?
A
All processes will finish without any deadlock
B
Only P1 and P2 will be in deadlock
C
Only P1 and P3 will be in deadlock
D
All three processes will be in deadlock
3
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
The coupling between different modules of a software is categorized as follows
$${\rm I}.\,\,\,\,\,\,\,\,\,\,\,$$ Content coupling
$${\rm II}.\,\,\,\,\,\,\,\,\,$$ Common coupling
$${\rm III}.\,\,\,\,\,\,\,$$ Control coupling
$${\rm IV}.\,\,\,\,\,\,\,$$ Stamp coupling
$${\rm V}.\,\,\,\,\,\,\,\,\,$$ Data coupling
Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows.
A
$${\rm I} - {\rm I}{\rm I} - {\rm I}{\rm I}{\rm I} - {\rm I}V - V$$
B
$$V - {\rm I}V - {\rm I}{\rm I}{\rm I} - {\rm I}{\rm I} - {\rm I}$$
C
$${\rm I} - {\rm I}{\rm I}{\rm I} - V - {\rm I}{\rm I} - {\rm I}V$$
D
$${\rm I}V - {\rm I}{\rm I} - V - {\rm I}{\rm I}{\rm I} - {\rm I}$$
4
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?

$${\rm I}.\,\,\,\,\,\,$$ The cyclomatic complexity of a module is equal to the maximum number of
$$\,\,\,\,\,\,\,\,\,\,\,$$linearly independent circuits in the graph.
$${\rm II}.\,\,\,$$ The cyclomatic complexity of a module is the number of decisions in the
$$\,\,\,\,\,\,\,\,\,\,$$module plus one, where a decision is effectively any conditional statement in
$$\,\,\,\,\,\,\,\,\,\,$$the module.
$${\rm III}\,$$ The cyclomatic complexity can also be used as a number of linearly
$$\,\,\,\,\,\,\,\,\,\,$$independent paths that should be tested during path coverage testing.

A
$${\rm I}$$ & $${\rm I}$$$${\rm I}$$
B
$${\rm I}$$$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
C
$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
D
$${\rm I}$$, $${\rm I}$$$${\rm I}$$ & $${\rm I}$$$${\rm I}$$$${\rm I}$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12