Register

GATE CSE 2002 | Question: 1.22

• edited by
18,275 views

5 Answers

0 votes
0 votes
NON PREEMPTIVE  PROPERY FOLLOW ONLY FCFS  

 BCZ ONCE YOU GIVE CPU TO PROCEES WE DOES TAKE UNTIL IS FINISH THE WORK SO THAT WHY NON PREEMPTIVE IS ONLY OPTION IS FCFS
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

21 votes
21 votes
1 answer
1
Kathleen asked Sep 15, 2014
8,248 views
GATE CSE 2002 | Question: 1.23
The optimal page replacement algorithm will select the page that Has not been used for the longest time in the past Will not be used for the longest time in the future Has been used least number of times Has been used most number of times
The optimal page replacement algorithm will select the page thatHas not been used for the longest time in the pastWill not be used for the longest time in the futureHas b...
User Avatar
28 votes
28 votes
4 answers
2
Kathleen asked Sep 15, 2014
6,877 views
GATE CSE 2002 | Question: 2.20
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking
Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...
User Avatar
39 votes
39 votes
8 answers
4
Kathleen asked Sep 15, 2014
18,708 views
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
User Avatar
Link Copied!