LawMint Sign in

Rajasthan SET (RSET) System Software and Operating System Previous Year Questions

Try the preview and open any solution for a worked explanation.

Rajasthan SET (RSET) practice pack

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.

Question 1

Consider the following code segment:

pid_t pid;
pid = fork();
if(pid ==0)
{
    /*child process */
    fork();
    thread_create(..);
}
    fork();

How many unique new processes are created (excluding the initial process)?

Select one answer

Question 2

What structures typically represent the records or elements lined up in the ready queue for CPU scheduling ?

Select one answer

Question 3

If a resource’s semaphore count drops to 0 and all instances are currently being used, what happens to any subsequent process that tries to perform a wait() operation ?

Select one answer

Question 4

Consider the following resource allocation graph and analyze the possibility of deadlock in operating system.

Resource allocation graph. Each of the upper and lower resource boxes contains two instances. T1 requests the upper resource. Upper instances are allocated to T2 and T3. T3 requests the lower resource. Lower instances are allocated to T1 and T4.

Select one answer

Question 5

Consider a logical address space of 256 pages with 4 KB page size, mapped onto physical memory of 64 frames.
(a) How many bits are required in the logical address ?
(b) How many bits are required in the physical address ?

Select one answer

Question 6

What is the Base Register called in a simple Memory Management Unit (MMU) scheme, where its value is added to every address generated by a user process at the time it is sent to memory ?

Select one answer

Question 7

What is the name of the procedure used by the Kernel to inform an application about specific event occurrence, such as when a thread is about to block ?

Select one answer

Question 8

Which file system is commonly used in Windows 10 and Windows 11 ?

Select one answer

Question 9

Assume that you have a page-reference for a process with m frames (initially all empty). The page reference string of length P contains n distinct pages. The number of page faults for any page replacement algorithm is bounded by

Select one answer

Question 10

In the producer-consumer problem using shared memory, which of the following is a correct statement ?
1. A producer can consume while the consumer is producing another item.
2. There is no need of any synchronization between producer and consumer.
3. The buffer resides in the memory area which is not shared by producer or consumer.
4. A buffer must be available that can be filled by the producer and emptied by the consumer.

Select one answer

Continue practising

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.

Rajasthan SET (RSET) practice pack

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.