Unint 2
Unint 2
Answer
B . Inode
Answer
3. The kernel keeps track of the state of each task by using a data structure
called __
Answer
D . Dispatcher
Answer
B . Only one
C . Greater than 50
Answer
A . Heavy Weight
B . Mutliprocess
C . Inter Thread
D . Light wieght
Answer
A . Batch
B . Real time
C . Multiprogramming
D . Monoprogramming
Answer
A . Definite blocking
B . Starvation
C . Low priority
Answer
9. ________ scheduler selects the jobs from the pool of jobs and loads into
the ready queue.
A . Long term
B . Short term
C . Medium term
Answer
10. Saving the state of the old process and loading the saved state of the new
process is called ________.
A . Context Switch
B . State
C . Multi programming
11. A thread
Answer
12. 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.
A . 8 milliseconds
B . 8.2 milliseconds
C . 7.75 milliseconds
D . 3 milliseconds
Answer
A . Information Sharing
B . Convenience
C . Computation Speed-Up
Answer
14. The kernel of the operating system remains in the primary memory because
________.
D . It is low level
Answer
computers
Answer
A . Ready
B . new
C . running
D . waiting
Answer
17. -------time is the sum of the periods spend waiting in the ready queue
A . waiting
B . turnaround
C . response
D . burst
Answer
A . preemptive
B . non-preemptive
C . priority
D . none
Answer
19. Which of the following system call is used for replicating a process?
A . fork
B . exec
C . wait
D . _exit
Answer
20. Which of the following system call is more powerful (in waiting mechanism)
than wait system call?
A . waitp
B . waitpid
C . kill
D . run
Answer