GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

145.

The enter_CS ( ) and leave_CS ( ) functions to implement critical section of a process are realized using test-and-set instruction as follows:
void enter_CS ( X)
{
while (test-and-set (X));
}
void leave_CS (X)
{
X = 0;
}
In the above solution, X is a memory location associated with the CS and is initialized to 0. Now consider the following statements:
I. The above solution to CS problem is deadlock-free
II. The solution is starvation free
III. The processes enter CS is FIFO order
IV. More than one process can enter CS at the same time
Which of the above statements are TRUE? [2 marks]
(A) I only
(B) I and II
(C) II and III
(D) IV only

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
146.

In the following process state transition diagram for a uni-processor system, assume that there are always some processes in the ready state:

Now consider the following statements:
I. If a process makes a transition D, it would result in another process making transition A immediately
II. A process P2 in blocked state can take transition E while another process P1 is in running state
III. The OS uses preemptive scheduling
IV. The OS uses non-preemptive scheduling
Which of the above statements are TRUE? [2 marks]
(A) I and II
(B) I and III
(C) II and III
(D) II and IV

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
147.

Consider n disk system with 100 cylinders. The requests to access the cylinders occur in the 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? [2 marks]
(A) 95 ms
(B) 119 ms
(C) 233 ms
(D) 276 ms

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]

148.

Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it can’t be completely satisfied. Three processes P1, P2 and P3 request the resources as follows if executed independently

Process P1: Process P2: Process P3:

t = 0: requests 2 units of R2
t = 1: requests 1 units of R3
t = 3: requests 2 units of R1
t = 5: releases 1 unit of R2 and 1 unit of R1
t = 7: releases 1 unit of R3
t = 8: requests 2 unit of R4
t = 10: Finishes t = 0: requests 2 units of R3
t = 2: requests 1 unit of R4
t = 4: requests 1 unit of R1
t = 6: releases 1 unit of R3
t = 8: Finishes t = 0: requests 1 unit of R4
t = 2: requests 2 units of R1
t = 5: releases 2 units of R1
t = 7: requests 1 unit of R2
t = 8: requests 1 unit of R3
t = 9: Finishes

Which one of the following statements is TRUE if all three processes run concurrently starting at time t = 0? [2 marks]
(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

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]

801 1 ...‹‹23 2425 26 27 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now