31. SPOOLING stands for _________

A. Simultaneous Peripheral Operations OnLine 

B. Spontaneous Peripheral Operations OnLine 

C. Serial pheral Operations OnLine 

D. None of the above 

32. When a single resource deadlock occures ?

A. if there are more than two processes computing for that resource  

B. if there are only than two processes computing for that resource 

C. if there are a single process computing for that resource  

D. None of the above 

33. _____________ is a significant factor in maintaining fragmentation

A. External Fragmentation 

B. Paging 

C. Coalescing of hole 

D. Both 2 and 3 

34. Pre-emptive scheduling is the strategy of temporarily suspending a running process

A. before the cpu time slice expires 

B. to allow starving process to run 

C. when it request i/o 

D. none of the above 

35. ________ is an example of sharable resource and __________ is an example of non Sharable resouece.

A. Memory,Terminal. 

B. Mouse,KeyBoard 

C. Monitor,CPU 

D. None of above 

36. Which of the following cpu schedulling algorithms will prevented stravation?

A. shortest-job-first 

B. priority schedulling algorithm 

C. priority schedulling will againg mechanism 

D. none 

37. Which of the following statement is true?

A. A computer Virus is complete program that makes active attacks. 

B. A computer virus is program segment that makes passive attatcks. 

C. A logic bomb is program segment that makes passive attacks. 

D. A logic bomb is program that makes active attacks. 

38. The time of admission of job to ready queue to completion is_______

A. Turnaround time 

B. Burst time 

C. Response time 

D. None of the above. 

39. The fastest strogage element is?

A. CDRAM 

B. DRAM 

C. EDO-DRAM 

D. SDRAM 

40. Which of the following CPU scheduling algorithm will prevent starvation problem.

A. shortest-job-first 

B. priority scheduling 

C. priority scheduling with aging mechanism 

D. None of the above 

• 1
• 2
• 3
• 4
• 5