Operating System PYQ ISRO QUIZ

Last Updated :
Discuss
Comments

Question 1

Mutual exclusion problem occurs

  • Between two disjoint processes that do not interact

  • Among processes that share resources

  • Among processes that do not use the same resource

  • Between two processes that uses different resources of different machine

Question 2

What is the output of the following program? 

main( )
{
int a = 10;
if ((fork ( ) == 0))
a++;
printf (“%d\\n”, a );
}

  • 10 and 11

  • 10

  • 11

  • 11 and 11

Question 3

A critical region

  • is a piece of code which only one process executes at a time

  • is a region prone to deadlock

  • is a piece of code which only a finite number of processes execute

  • is found only in windows NT operating system

Question 4

Which of the following is false?

  • User level threads are not scheduled by the kernel

  • Context switching between user level threads is faster than context switching between kernel level threads

  • When a user thread is blocked all other threads of its processes are blocked

  • Kernel level threads cannot utilize multiprocessor systems by splitting threads on different processors or cores

Question 5

A process executes the following code 

for (i = 0; i < n; i++) fork( );

The total number of child processes created are

  • n2

  • 2n+1 -1

  • 2n

  • 2n -1

Question 6

Consider three CPU intensive processes, which require 10, 20, 30 units and arrive at times 0, 2, 6 respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at 0 is included but context switch at end is ignored

  • 1

  • 2

  • 3

  • 4

Question 7

What is the name of the operating system that reads and reacts in terms of operating system?

  • Batch system

  • Quick response time

  • real time system

  • Time sharing system

Question 8

With Round-Robin CPU scheduling in a time shared system

  • using very large time slices (quantas) degenerates into FirstCome First served (FCFS) algorithm.

  • using extremely small time slices improves performance

  • using very small time slices degenerates into Last-In First-Out (LIFO) algorithm.

  • using medium sized times slices leads to shortest Request time First (SRTF) algorithm

Question 9

Which of the following need not necessarily be saved on a context switch between processes?

  • General purpose registers

  • Translation look-aside buffer

  • Program counter

  • All of the above

Question 10

Four jobs to be executed on a single processor system arrive at time 0 in the order A, B, C, D . Their burst CPU time requirements are 4, 1, 8, 1 time units respectively. The completion time of A under round robin scheduling with time slice of one time unit is

  • 10

  • 4

  • 8

  • 9

There are 124 questions to complete.

Take a part in the ongoing discussion