Time Left - 06:00 mins

NIELIT Scientist –B Day-20 Operating System Quiz-1

Attempt now to get your rank among 694 students!

Question 1

How many wires are threaded through the cores in a coincident-current core memory?

Question 2

Comparing the time T1 taken for a single instruction on a pipelined CPU, with time T2 taken on a non-pipelined but identical CPU, we can say that ____?

Question 3

A disk has 200 tracks (numbered 0 through 199). At a given time, it was servicing the request of reading data from track 120 and at the previous request, service was for track 90. The pending requests (in order of their arrival) are for track numbers.
30 70 115 130 110 80 20 25.
How many times will the head change its direction for the disk scheduling policies SSTF (Shortest Seek Time First) and FCFS (First Come First Serve)?

Question 4

Consider the following snapshot of a system running n processes. Process i is holding Xi instances of a resource R, 1<= I <= n. Currently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional Yi instances while holding the Xi instances it already has. There are exactly two processes p and q such that Yp = Yq = 0. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

Question 5

A system has n resources R₀,….., R_n-1 and k processes P₀,…..P_k-1. The implementation of the resource request logic of each process P_i is as follows:
if (I % 2==0){
if (i < n) request Ri
if (i+2 < n) request Ri+2
}
else {
if (i < n) request Rn-i
if (i+2 < n) request Rn-i-2
}
In which one of the following situations is a deadlock possible?

694 attempts
2 upvotes
3 comments

Tags :

GATE & PSU CS Operating System

Apr 1GATE & PSU CS