Time Left - 12:00 mins
ISRO CS 2019 : OS Booster Quiz 2
Attempt now to get your rank among 962 students!
Question 1
Consider the following Scheduling Strategies:
1) Longest Job First Scheduling
2) Longest Remaining Time First Scheduling
3) Shortest Job First Scheduling
4) Shortest Remaining Time First Scheduling
5) Priority Scheduling
6) Multilevel Queue Scheduling
7) First Come Fist Serve Scheduling
Which of the following do not suffers from starvation?
1) Longest Job First Scheduling
2) Longest Remaining Time First Scheduling
3) Shortest Job First Scheduling
4) Shortest Remaining Time First Scheduling
5) Priority Scheduling
6) Multilevel Queue Scheduling
7) First Come Fist Serve Scheduling
Which of the following do not suffers from starvation?
Question 2
Consider the following table.
Assume all the processes are arrived at time 0. Compute the average waiting time of processes in the system using shortest job first scheduling.
Assume all the processes are arrived at time 0. Compute the average waiting time of processes in the system using shortest job first scheduling.
Question 3
In resource allocation graph two situation exists some process is either allocated the resource or requests for the resource. If in a resource allocation graph contains a cycle then which of the following is true
Question 4
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
Question 5
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give 50% better benchmark results, what is the expected improvement in the I/O performance of user programs?
Question 6
Consider the following code for concurrent processes S1 - S8
Draw the precedence graph for the above concurrent code and find the maximum number of processes at any level of the graph .
Question 7
Consider A system having a page table with 4k entries and the logical address is 29 bits then what is the physical address if the system has 512 frames?
Question 8
Where does the dispatcher reside?
Question 9
A windowing system uses the notion of ‘damage’ for what purpose?
Question 10
The dining Philosphers problem with N philospheres has the solution for synchronization without deadlock. Which of the following is correct solution?
- 962 attempts
- 3 upvotes
- 6 comments
Jun 25GATE & PSU CS
