Rajasthan Technical Education Second Year Paper 2016 Operating System Principles
Which of the following task is managed by operating system ?
(a) Memory
(b) Processor
(c) Disk and I/O device
(d) All of these
What is use of real time system ?
(a) used in main frame computers
(b) used for monitoring events as they occur
(c) used for program analysis
(d) used for real time interactive users
Which of the followings in NOT an advantage of multiprogramming ?
(a) Increased throughout
(b) Shorter response time
(c) Decrease operating system overhead
(d) Ability to assign priorities of job
What is man function of distributed system ?
(a) Resource sharing
(b) Compilation speed up
(c) Reliability
(d) All of these
What is process ?
(a) A program in high level language kept on disk
(b) Contents of main memory
(c) A program in execution
(d) A job in secondary memory
The address of the next instruction to be executed by current process is provided by the
(a) CPU register
(b) Program counter
(c) Process stack
(d) Pipe
Context switching is a part of following
(a) Spooling
(b) Polling
(c) Interrupt handling
(d) Interrupt servicing
Time quantum is defined in
(a) Shortest job scheduling algorithm
(b) Round robin scheduling algorithm
(c) Priority based scheduling algorithm
(d) Multilevel queue scheduling algorithm
Process are classified into different groups in
(a) Shortest job scheduling algorithm
(b) Round robin scheduling algorithm
(c) Priority based scheduling algorithm
(d) Multilevel queue scheduling algorithm
Which one of the following is the most optimal scheduling algorithm ?
(a) FCFS – First Come First Served
(b) SJF – Shortest Job First
(c) RR – Round Robin
(d) None of these
The problem of indefinite blockage of low-priority processes is called
(a) Starvation
(b) Wait queue
(c) Ready queue
(d) Aging
A thread also called from following
(a) Heavy weight process
(b) Light weight process
(c) Part of I/O
(d) None of these
A set of processes is in deadlock if
(a) each process is blocked and will remain so forever
(b) each process is terminated
(c) all processes are trying to kill each other
(d) None of these
A system has 3 processes sharing 4 resources. If each process needs a maximum of two resources, then
(a) Deadlock can never occur
(b) Deadlock may occur
(c) Deadlock has to occur
(d) None of these
A system is in a safe state only if there exists
(a) safe allocation
(b) safe resource
(c) safe sequence
(d) all of these
Leave a Reply