Welcome to Operating System Quiz, Randomly Selected !!

Question 1. You just added a new user, pankaj to the system. What group is pankaj added to by default





Question 2. A tree structured file directory system

allows easy storage and retrieval of file names

is a much debated unecessary feature

is not essential when we have millions of files

none of the above

Question 3. Which is not the state of the process





Question 4. Consider Peterson?s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below
          flag [i] = true;
          turn = j;
          while ( P ) do no-op;
          Enter critical section, perform actions, then exit critical section
      flag [ i ] = false;
      Perform other non-critical section actions
     until false;

For the program to guarantee mutual exclusion, the predicate P in the while loop should be

flag [j] = true and turn = i

flag [j] = true and turn = j

flag [i] = true and turn = j

flag [i] = true and turn = i

Question 5. Where does the swap space reside ?




On-chip cache

Question 6. Demand paged memory allocation

allows the virtual address space to be independent of the physical memory

allows the virtual address space to be a multiple of the physical memory size

allows deadlock to be detected in paging schemes

is present only in Windows NT

Question 7. In a multithreaded environment _______.

Each thread is allocated with new memory from main memory.

Main thread terminates after the termination of child threads.

Every process can have only one thread.

none of the above

Question 8. The problem of thrashing is effected scientifically by

Program structure

Program size

Primary storage size

None of the above

Question 9. Which of the following file name extension suggests that the file is Backup copy of another file





Question 10. Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively . P1 : 10 : 3 , P2 : 1 : 1 , P3 : 2 : 4 , P4 : 1 : 5 , P5 : 5 : 2.

8 milliseconds

8.2 milliseconds

7.75 milliseconds

3 milliseconds