Time Left - 10:00 mins
ECIL GET 2018 : Topic wise test-1 (Operating System)
Attempt now to get your rank among 551 students!
Question 1
Which of the following process scheduling algorithm may lead to starvation?
Question 2
The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using
Question 3
Resources are allocated to the process to non-sharable basis is
Question 4
Consider the following performance table for SPFS(Shortest Path First Scheduling).
For this batch of process, the throughput is:
For this batch of process, the throughput is:
Question 5
Which of the following statements is NOT true?
Question 6
Which one of the following is not involved in Preventing the dead lock.
Question 7
Which of the following is not the disk scheduling algorithm?
Question 8
A small disk drive with 80 cylinders (numbered 0 through 79) receives following batch of cylinder requests: 4, 16, 3, 43, 60, 2, 79
The head is initially at cylinder 40 and was headed in the direction of higher cylinder numbers when the batch of requests arrived. Assuming that seek time is proportional to distance, which of these algorithms will result in highest total seek time?
The head is initially at cylinder 40 and was headed in the direction of higher cylinder numbers when the batch of requests arrived. Assuming that seek time is proportional to distance, which of these algorithms will result in highest total seek time?
Question 9
Which of the following operation is performed by swap space?
Question 10
If n processors are present in the system, how many ways are possible to schedule them?
- 551 attempts
- 2 upvotes
- 11 comments
Oct 4GATE & PSU CS
