OPERATING
SYSTEMS
MULTIPLE
CHOICE QUESTIONS
1 1)
The address of the next
instruction to be executed by the current process is provided by the
a) CPU registers
b) program counter
c) process stack
d) pipe
Answer:b
a) CPU registers
b) program counter
c) process stack
d) pipe
Answer:b
2 2) A
Process Control Block(PCB) does not contain which of the following :
a) Process State
b) Stack
c) Heap
d) boot strap
a) Process State
b) Stack
c) Heap
d) boot strap
Answer:
d
3 3) The number of processes completed
per unit time is known as __________.
a) Output
b) Throughput
c) Efficiency
d) Capacity
a) Output
b) Throughput
c) Efficiency
d) Capacity
Answer: b
4 4) The state of a process is
defined by :
a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process
a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process
Answer:
d
5 5) Which
of the following is not the state of a process ?
a) New
b) Old
c) Waiting
d) Running
e) Ready
a) New
b) Old
c) Waiting
d) Running
e) Ready
Answer:
b
6 6) The Process Control Block is :
a) Process type variable
b) Data Structure
c) a secondary storage section
d) a Block in memory
Answer: b
a) Process type variable
b) Data Structure
c) a secondary storage section
d) a Block in memory
Answer: b
7 7) Which of the following do not belong
to queues for processes ?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b
8 8) When a process terminates : (Choose
Two)
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Answer: a and c
9 9)
What is a long-term scheduler ?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these
Answer: a
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these
Answer: a
1 10)
What is a medium-term scheduler ?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these
Answer: c
11) In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :
a a) Blocked state
b)Ready state
c )Suspended state
d)Terminated state
a) overloading the system by using a lot of secondary storage
b) under-loading the system by very less CPU utilization
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these
Answer: c
11) In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :
a a) Blocked state
b)Ready state
c )Suspended state
d)Terminated state
Answer: b
2 12) What is a short-term scheduler ?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these
Answer: b
1 13)Restricting the child
process to a subset of the parent’s resources prevents any process from :a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these
Answer: b
a) overloading the system by using a lot of secondary storage
b) under-loading the system by very less CPU utilization
c) overloading the system by
creating a lot of sub-processes
d) crashing the system by utilizing multiple resources
Answer: c
d) crashing the system by utilizing multiple resources
Answer: c
2 14) A parent process calling _____
system call will be suspended until children processes terminate.
a) wait
b) fork
c) exit
d) exec
a) wait
b) fork
c) exit
d) exec
Answer: a
315) Cascading termination refers to
termination of all child processes before the parent terminates ______.
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of these
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of these
Answer: a
416) When the process issues an I/O
request :
a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue
Answer: a
a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue
Answer: a
517)
Which of the following do not belong
to queues for processes ?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: b
618)
Message passing system
allows processes to :
a) communicate with one another without resorting to shared data.
b) communicate with one another by resorting to shared data.
c) share data
d) name the recipient or sender of the message
Answer: a
a) communicate with one another without resorting to shared data.
b) communicate with one another by resorting to shared data.
c) share data
d) name the recipient or sender of the message
Answer: a
7 19) Inter process communication :
a) allows processes to communicate and synchronize their actions when using the same address space.
b) allows processes to communicate and synchronize their actions without using the same address space.
c) allows the processes to only synchronize their actions without communication.
d) None of these
a. Answer: b
a) allows processes to communicate and synchronize their actions when using the same address space.
b) allows processes to communicate and synchronize their actions without using the same address space.
c) allows the processes to only synchronize their actions without communication.
d) None of these
a. Answer: b
8 20) The link between
two processes P and Q to send and receive messages is called :
a) communication link
b) message-passing link
c) synchronization link
d) All of these
a) communication link
b) message-passing link
c) synchronization link
d) All of these
Answer:
a
9 21) In indirect communication
between processes P and Q :
a) there is another process R to handle and pass on the messages between P and Q
b) there is another machine between the two processes to help communication
c) there is a mailbox to help communication between P and Q
d) None of these
a) there is another process R to handle and pass on the messages between P and Q
b) there is another machine between the two processes to help communication
c) there is a mailbox to help communication between P and Q
d) None of these
Answer: c
1 22)
In the non blocking send :
a) the sending process keeps sending until the message is received
b) the sending process sends the message and resumes operation
c) the sending process keeps sending until it receives a message
d) None of these
Answer: b
a) the sending process keeps sending until the message is received
b) the sending process sends the message and resumes operation
c) the sending process keeps sending until it receives a message
d) None of these
Answer: b
1 23)
In the Zero capacity queue : (choose
two)
a) the queue has zero capacity
b) the sender blocks until the receiver receives the message
c) the sender keeps sending and the messages dont wait in the queue
d) the queue can store atleast one message
Answer: a and b
a) the queue has zero capacity
b) the sender blocks until the receiver receives the message
c) the sender keeps sending and the messages dont wait in the queue
d) the queue can store atleast one message
Answer: a and b
1 24)
The interval from the time of
submission of a process to the time of completion is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput
Answer:b
a) waiting time
b) turnaround time
c) response time
d) throughput
Answer:b
1 25)
The processes that are residing
in main memory and are ready and waiting to execute are kept on a
list called
a) job queue
b) ready queue
c) execution queue
d) process queue
Answer:b
a) job queue
b) ready queue
c) execution queue
d) process queue
Answer:b
1 26)
Which scheduling algorithm allocates
the CPU first to the process that requests the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
Answer: a
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
Answer: a
1 27)
In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) equal priority processes can not be scheduled
d) none of the mentioned
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) equal priority processes can not be scheduled
d) none of the mentioned
Answer:a
1 28)
Time quantum is defined in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Answer:b
1 29)
In multilevel feedback scheduling
algorithm
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned
Answer:a
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned
Answer:a
130)
CPU scheduling is the basis of
____________.
a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) None of these
Answer: b
a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) None of these
Answer: b
131)
The two steps of a process execution
are : (choose two)
a) I/O Burst
b) CPU Burst
c) Memory Burst
d) OS Burst
Answer: a and b
a) I/O Burst
b) CPU Burst
c) Memory Burst
d) OS Burst
Answer: a and b
2 32)
An I/O bound program will
typically have :
a) a few very short CPU bursts
b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts
a) a few very short CPU bursts
b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts
Answer: c
2 33)
Scheduling is done so as to :
a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
d) None of these
Answer: a
34) In Unix, Which system call creates the new process?
a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
d) None of these
Answer: a
34) In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
Answer:a
b) create
c) new
d) none of the mentioned
Answer:a
35)A process can be terminated due to
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
Answer:d
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
Answer:d
36)What is interprocess communication?
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned
Answer:b
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned
Answer:b
37)
Turnaround time is :
a) the total waiting
time for a process to finish execution
b) the total time
spent in the ready queue
c) the total time
spent in the running queue
d) the total time
from the completion till the submission of a process
Answer: d
38)
Waiting time is :
a) the total time in the blocked and waiting queues
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process
a) the total time in the blocked and waiting queues
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process
Answer: b
39)
Response time is :
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
d) None of these
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
d) None of these
Answer: b
440) Round robin scheduling falls
under the category of :
a) Non preemptive scheduling
b) Preemptive scheduling
c) None of these
a) Non preemptive scheduling
b) Preemptive scheduling
c) None of these
Answer: b
441) Which process can affect of be affected by
other processes executing in the system?
a) cooperating process
b) child process
c) parent process
d) init process
a) cooperating process
b) child process
c) parent process
d) init process
Answer:a
442) When several processes access the same data
concurrently and the outcome of the
execution depends on the particular order in which the access takes
place, is called
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
Answer:b
443) If a process is executing in its critical
section, then no other processes can be executing in their critical section.
This condition is called
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Answer:a
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Answer:a
444) Which one of the following is a
synchronization tool?
a) thread
b) pipe
c) semaphore
d) socket
a) thread
b) pipe
c) semaphore
d) socket
Answer:c
445) Mutual exclusion can be provided by the
a) mutex locks
b) binary semaphores
c) both (a) and (b)
d) none of the mentioned
a) mutex locks
b) binary semaphores
c) both (a) and (b)
d) none of the mentioned
Answer:c
4 46) A monitor is characterized by :
a a) a set of programmer defined operators
b b) an identifier
c c) the number of variables in it
d d) All of these
a a) a set of programmer defined operators
b b) an identifier
c c) the number of variables in it
d d) All of these
Answer:
a
4 47)
Concurrent access to shared data may result in :
a) data consistency
b) data insecurity
c) data inconsistency
d) None of these
a) data consistency
b) data insecurity
c) data inconsistency
d) None of these
Answer:
c
4 48)
A situation where several processes access and manipulate the same data
concurrently and the outcome of the execution depends on
the particular order in which access takes place is called :
a) data consistency
b) race condition
c) aging
d) starvation
a) data consistency
b) race condition
c) aging
d) starvation
Answer:
b
4 49)
In the bakery algorithm to solve the critical section problem :
a) each process is put into a queue and picked up in an ordered manner
b) each process receives a number (may or may not be unique) and the one with the lowest number is served next
c) each process gets a unique number and the one with the highest number is served next
d) each process gets a unique number and the one with the lowest number is served next
a) each process is put into a queue and picked up in an ordered manner
b) each process receives a number (may or may not be unique) and the one with the lowest number is served next
c) each process gets a unique number and the one with the highest number is served next
d) each process gets a unique number and the one with the lowest number is served next
Answer:
b
5 50)
The TestAndSet instruction is executed :
a) after a particular process
b) periodically
c) atomically
d) None of these
a) after a particular process
b) periodically
c) atomically
d) None of these
Answer:
c
5
0 comments: