LawMint Sign in

Maharashtra and Goa SET (MH SET) System Software and Operating System Previous Year Questions

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

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Question 1

Network operating system runs on __________.

Select one answer

Question 2

A CPU generates 32-bit virtual addresses. The page size is 4KB. The processor has a translation look-aside Buffer (TLB) which can hold a total of 128 page-table entries and is 4-way set associative. The maximum size of the TLB tag is :

Select one answer

Question 3

Consider a disk that has 150 cylinders, numbered from 0 to 149. Currently the disk arm is at 80 and moving towards higher cylinders. The disk access requests for cylinders are 30, 78, 96, 123, 141, 15, 13, 68. What will be the absolute difference between the distances traversed by the R/W head when C-SCAN and C-LOOK are used, counting the return movement of the head in each total?

Select one answer

Question 4

Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can be present in ready, running and blocked state at maximum ?

Select one answer

Question 5

Which of the below statements is false ?

Select one answer

Question 6

Consider a program, which spawn 20 threads to find out the sum of elements in a shared array of 200. Each thread i, takes elements A[i] to A[(20 * i) – 1] and compute local sum loc_sum [i] and eventually adds loc_sum[i] to a shared variable tot_sum for total sum which of the following needs to be placed inside a critical section ?

Select one answer

Question 7

The number of child processes created using the following code is:

int main()
{
    fork();
    fork();
    fork();
    return 0;
}
Select one answer

Question 8

The term “snapshot” is used in the context of virtualization to refer to __________ .

Select one answer

Question 9

Consider the following proposed solution to the dining philosophers’ problem to avoid deadlock. The binary semaphore lock is initialized to 1.

Philosopher (int i)
{
  while (1)
  {
    think();
    wait(lock);                 // (i)
    wait(fork[i]);
    wait(fork[(i+1)%5]);
    signal(lock);               // (ii)
    eat();
    wait(lock);                 // (iii)
    signal(fork[i]);
    signal(fork[(i+1)%5]);
    signal(lock);               // (iv)
  }
}

Which of the following is correct?

Select one answer

Question 10

Which of the following type is at lowest level in terms of operating system security ?

Select one answer

Continue practising

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.