Professional Documents
Culture Documents
Operating System MCQ
Operating System MCQ
1. The systems which allows only one process 5. What is the ready state of a process?
execution at a time, are called a) when process is scheduled to run after some
a) uniprogramming systems execution
b) uniprocessing systems b) when process is unable to run until some task
c) unitasking systems has been completed
d) none of the mentioned c) when process is using the CPU
d) none of the mentioned
Answer: b
Explanation: Those systems which allows more Answer: a
than one process execution at a time, are called Explanation: When process is unable to run until
some task has been completed, the process is in
blocked state and if process is using the CPU, it 10. The address of the next instruction to be
is in running state.
advertisement executed by the current process is provided by
the
6. What is interprocess communication? a) CPU registers
a) communication within the process b) Program counter
b) communication between two process c) Process stack
c) communication between two threads of same d) Pipe
process
d) none of the mentioned
Answer: b
Answer: b Operating System Questions & Answers –
Processes
7. A set of processes is deadlock if
This set of Operating System Multiple Choice
a) each process is blocked and will remain so
Questions & Answers (MCQs) focuses on
forever
“Processes”.
b) each process is terminated
c) all processes are trying to kill each other 1. The systems which allows only one process
d) none of the mentioned execution at a time, are called
a) uniprogramming systems
b) uniprocessing systems
Answer: a
c) unitasking systems
8. A process stack does not contain d) none of the mentioned
a) Function parameters
b) Local variables Answer: b
c) Return addresses Explanation: Those systems which allows more
than one process execution at a time, are called
d) PID of child process multiprogramming systems. Uniprocessing means
only one processor.
Answer: d advertisement
Answer: a
Answer: c
3. When a process terminates :
advertisement
a) It is removed from all queues
b) It is removed from all, but the job queue 7. What is a short-term scheduler ?
c) Its process control block is de-allocated a) It selects which process has to be brought into
d) Its process control block is never de-allocated the ready queue
b) It selects which process has to be executed
next and allocates CPU b) the programs are developed by more than one
c) It selects which process to remove from person
memory by swapping c) more than one process resides in the memory
d) None of the mentioned d) a single user can execute many programs at
the same time
Answer: b
Answer: c
8. The primary distinction between the short term
scheduler and the long term scheduler is : 12. Suppose that a process is in “Blocked” state
a) The length of their queues waiting for some I/O service. When the service is
b) The type of processes they schedule completed, it goes to the :
c) The frequency of their execution a) Running state
d) None of the mentioned b) Ready state
c) Suspended state
Answer: c d) Terminated state
Answer: a
Answer: a
advertisement
advertisement
2. When several processes access the same data
6. Mutual exclusion can be provided by the
concurrently and the outcome of the execution
a) mutex locks
depends on the particular order in which the
b) binary semaphores
access takes place, is called
c) both mutex locks and binary semaphores
a) dynamic condition
d) none of the mentioned
b) race condition
c) essential condition
Answer: c
d) critical condition
Explanation: Binary Semaphores are known as
mutex locks.
Answer: b 7. When high priority task is indirectly preempted
by medium priority task effectively inverting the
3. If a process is executing in its critical section, relative priority of the two tasks, the scenario is
then no other processes can be executing in their called
critical section. This condition is called
a) priority inversion This set of Operating System Interview Questions
b) priority removal and Answers focuses on “Process Creation” and
c) priority exchange will also be useful for interview preparations.
d) priority modification
1. Restricting the child process to a subset of the
parent’s resources prevents any process from :
Answer: a a) overloading the system by using a lot of
secondary storage
8. Process synchronization can be done on
b) under-loading the system by very less CPU
a) hardware level
utilization
b) software level
c) overloading the system by creating a lot of sub-
c) both hardware and software level
processes
d) none of the mentioned
d) crashing the system by utilizing multiple
resources
Answer: c
Answer: a Answer: a
Operating System Questions and Answers –
Process Creation 4. With _____________ only one process can
execute at a time; meanwhile all other process
are waiting for the processor. With advertisement
______________ more than one process can be 8. The child process completes execution,but the
running simultaneously each on a different parent keeps executing, then the child process is
processor. known as :
a) Multiprocessing, Multiprogramming a) Orphan
b) Multiprogramming, Uniprocessing b) Zombie
c) Multiprogramming, Multiprocessing c) Body
d) Uniprogramming, Multiprocessing d) Dead
Answer: d
Answer: b
advertisement Operating System Questions and Answers – Inter
Process Communication
5. In UNIX, each process is identified by its :
a) Process Control Block This set of Operating System Multiple Choice
b) Device Queue Questions & Answers (MCQs) focuses on “Inter
c) Process Identifier Process Communication”.
d) None of the the mentioned
1. Inter process communication :
a) allows processes to communicate and
Answer: c
synchronize their actions when using the same
address space
6. In UNIX, the return value for the fork system
b) allows processes to communicate and
call is _____ for the child process and _____ for
synchronize their actions without using the same
the parent process.
address space
a) A Negative integer, Zero
c) allows the processes to only synchronize their
b) Zero, A Negative integer
actions without communication
c) Zero, A nonzero integer
d) none of the mentioned
d) A nonzero integer, Zero
Answer: b
Answer: c
advertisement
7. The child process can :
a) be a duplicate of the parent process 2. Message passing system allows processes to :
b) never be a duplicate of the parent process a) communicate with one another without
c) cannot have another program loaded into it resorting to shared data
d) never have another program loaded into it b) communicate with one another by resorting to
shared data
c) share data
Answer: a
d) name the recipient or sender of the message c) Exactly N/2 links exist between each pair of
processes(N = max. number of processes
Answer: a supported by system)
d) Exactly two link exists between each pair of
3. An IPC facility provides at least two operations processes
:
a) write & delete message Answer: b
b) delete & receive message
c) send & delete message 7. In indirect communication between processes
d) receive & send message P and Q :
a) there is another process R to handle and pass
Answer: d on the messages between P and Q
b) there is another machine between the two
4. Messages sent by a process : processes to help communication
a) have to be of a fixed size c) there is a mailbox to help communication
b) have to be a variable size between P and Q
c) can be fixed or variable sized d) none of the mentioned
d) None of the mentioned
Answer: c
Answer: c
8. In the non blocking send :
5. The link between two processes P and Q to a) the sending process keeps sending until the
send and receive messages is called : message is received
a) communication link b) the sending process sends the message and
b) message-passing link resumes operation
c) synchronization link c) the sending process keeps sending until it
d) all of the mentioned receives a message
d) none of the mentioned
Answer: a
Answer: b
advertisement
6. Which of the following are TRUE for direct 9. In the Zero capacity queue :
communication : a) the queue can store at least one message
a) A communication link can be associated with N b) the sender blocks until the receiver receives
number of process(N = max. number of the message
processes supported by system) c) the sender keeps sending and the messages
b) A communication link can be associated with don’t wait in the queue
exactly two processes
d) none of the mentioned d) None of the mentioned
Answer: b Answer: c
Answer: b Answer: c
advertisement
3. RPC provides a(an) _____ on the client side, a
11. Bounded capacity and Unbounded capacity separate one for each remote procedure.
queues are referred to as : a) stub
a) Programmed buffering b) identifier
b) Automatic buffering c) name
c) User defined buffering d) process identifier
d) No buffering
Answer: a
Answer: d
Answer: d
7. The remote method invocation : advertisement
a) allows a process to invoke memory on a
remote object 2. How does the software trigger an interrupt ?
b) allows a thread to invoke a method on a a) Sending signals to CPU through bus
remote object b) Executing a special operation called system
c) allows a thread to invoke memory on a remote call
object c) Executing a special program called system
d) allows a process to invoke a method on a program
remote object d) Executing a special program calle interrupt
trigger program
Answer: b
Answer: b
advertisement
3. What is a trap/exception ?
8. A process that is based on IPC mechanism
a) hardware generated interrupt caused by an
which executes on different systems and can
error
communicate with other processes using
b) software generated interrupt caused by an
message based communication, is called
error
________
c) user generated interrupt caused by an error
a) Local Procedure Call
d) none of the mentioned
b) Inter Process Communication
c) Remote Procedure Call
Answer: b
d) Remote Machine Invocation
4. What is an ISR ? accordingly
a) Information Service Request
b) Interrupt Service Request Answer: b
c) Interrupt Service Routine
d) Information Service Routine 8. In a programmed input/output(PIO) :
a) the CPU uses polling to watch the control bit
Answer: c constantly, looping to see if device is ready
b) the CPU writes one data byte to the data
5. An interrupt vector register and sets a bit in control register to show
a) is an address that is indexed to an interrupt that a byte is available
handler c) the CPU receives an interrupt when the device
b) is a unique device number that is indexed by is ready for the next byte
an address d) the CPU runs a user written code and does
c) is a unique identity given to an interrupt accordingly
d) none of the mentioned
Answer: a
Answer: a
9. In an interrupt driven input/output :
advertisement a) the CPU uses polling to watch the control bit
6. DMA is used for : constantly, looping to see if device is ready
a) High speed devices(disks and communications b) the CPU writes one data byte to the data
network) register and sets a bit in control register to show
b) Low speed devices that a byte is available
c) Utilizing CPU cycles c) the CPU receives an interrupt when the device
d) All of the mentioned is ready for the next byte
d) the CPU runs a user written code and does
accordingly
Answer: a
advertisement advertisement
11. How does the Hardware trigger an interrupt ? 2. The processes that are residing in main
a) Sending signals to CPU through system bus memory and are ready and waiting to execute are
b) Executing a special program called interrupt kept on a list called
program a) job queue
c) Executing a special program called system b) ready queue
program c) execution queue
d) Executing a special operation called system d) process queue
call
Answer: b
Answer: a
3. The interval from the time of submission of a
12. Which operation is performed by an interrupt process to the time of completion is termed as
handler ? a) waiting time
a) Saving the current state of the system b) turnaround time
b) Loading the interrupt handling code and c) response time
executing it d) throughput
c) Once done handling, bringing back the system
to the original state it was before the interrupt Answer: b
occurred
d) All of the mentioned 4. Which scheduling algorithm allocates the CPU
first to the process that requests the CPU first?
a) first-come, first-served scheduling
Answer: d b) shortest job scheduling
Operating System Questions & Answers – CPU c) priority scheduling
Scheduling
d) none of the mentioned
This set of Operating System Multiple Choice
Questions & Answers (MCQs) focuses on “CPU Answer: a
Scheduling”.
5. In priority scheduling algorithm
1. Which module gives control of the CPU to the
a) CPU is allocated to the process with highest
process selected by the short-term scheduler?
priority
a) dispatcher
b) CPU is allocated to the process with lowest
b) interrupt
priority
c) scheduler
c) Equal priority processes can not be scheduled
d) none of the mentioned
d) None of the mentioned
Answer: a 10. Which one of the following can not be
advertisement scheduled by the kernel?
a) kernel level thread
6. In priority scheduling algorithm, when a b) user level thread
process arrives at the ready queue, its priority is c) process
compared with the priority of d) none of the mentioned
a) all process
b) currently running process
c) parent process Answer: b
d) init process Explanation: User level threads are managed by
thread library and the kernel in unaware of
them.Operating System Questions and Answers
Answer: b – CPU Scheduling Benefits
Answer: b Answer: a
Explanation: There is no other choice.
advertisement 11. Turnaround time is :
7. The switching of the CPU from one process or a) the total waiting time for a process to finish
thread to another is called : execution
a) process switch b) the total time spent in the ready queue
b) task switch c) the total time spent in the running queue
d) the total time from the completion till the c) the total time taken from submission time till
submission of a process the response is output
d) none of the mentioned
Answer: d
Answer: b
Answer: b
Operating System Questions and Answers – The 4. The following three conditions must be satisfied
Critical Section (CS) Problem and Solutions to solve the critical section problem :
a) Mutual Exclusion
This set of Operating System Multiple Choice
b) Progress
Questions & Answers (MCQs) focuses on “The
c) Bounded Waiting
Critical Section (CS) Problem and Solutions”.
d) All of the mentioned
1. Concurrent access to shared data may result in
: Answer: d
a) data consistency
advertisement
b) data insecurity
c) data inconsistency 5. Mutual exclusion implies that :
d) none of the mentioned a) if a process is executing in its critical section,
then no other process must be executing in their
Answer: c critical sections
b) if a process is executing in its critical section,
advertisement
then other processes must be executing in their
2. A situation where several processes access critical sections
and manipulate the same data concurrently and c) if a process is executing in its critical section,
the outcome of the execution depends on the then all the resources of the system must be
particular order in which access takes place is blocked until it finishes execution
called : d) none of the mentioned
a) data consistency
b) race condition Answer: a
c) aging
d) starvation 6. Bounded waiting implies that there exists a
bound on the number of times a process is
Answer: b allowed to enter its critical section :
a) after a process has made a request to enter its
critical section and before the request is granted 1. An un-interruptible unit is known as :
b) when another process is in its critical section a) single
c) before a process has made a request to enter b) atomic
its critical section c) static
d) none of the mentioned d) none of the mentioned
Answer: a Answer: b
Answer: c
Answer: b
3. Semaphore is a/an _______ to solve the
advertisement
critical section problem.
8. In the bakery algorithm to solve the critical a) hardware for a system
section problem : b) special program for a system
a) each process is put into a queue and picked up c) integer variable
in an ordered manner d) none of the mentioned
b) each process receives a number (may or may
not be unique) and the one with the lowest Answer: c
number is served next
c) each process gets a unique number and the 4. The two atomic operations permissible on
one with the highest number is served next semaphores are :
d) each process gets a unique number and the a) wait
one with the lowest number is served next b) stop
c) hold
d) none of the mentioned
Answer: b
Operating System Questions and Answers –
Semaphores – 1 Answer: a
Answer: b Answer: c
Answer: d
Answer: c
Operating System Questions and Answers –
Explanation: Any one of the 9 processes can get
Semaphores – 2
into critical section after executing P(mutex)
which decrements the mutex value to 0. At this
time P10 can enter critical section by This set of Operating System Interview Questions
incrementing the value to 1. Now any of the 9 and Answers for freshers focuses on
processes can enter the critical section by again “Semaphores – 2” and will also be useful for
decrementing the mutex value to 0. None of the
interview preparations for freshers.
remaining processes can get into their critical
sections. 1. What will happen if a non-recursive mutex is
13. Two processes, P1 and P2, need to access a locked more than once ?
critical section of code. Consider the following a) Starvation
synchronization construct used by the processes : b) Deadlock
Process P1 : c) Aging
while(true) d) Signaling
{
w1 = true;
while(w2 == true); Answer: b
Critical section Explanation: If a thread which had already locked
a mutex, tries to lock the mutex again, it will enter Answer: b
into the waiting list of that mutex, which results in Explanation: P represents Wait and V represents
deadlock. It is because no other thread can Signal. P operation will decrease the value by 1
unlock the mutex. every time and V operation will increase the value
advertisement by 1 every time.
6. A binary semaphore is a semaphore with
2. A semaphore :
integer values :
a) is a binary mutex
a) 1
b) must be accessed from only one process
b) -1
c) can be accessed from multiple processes
c) 0.8
d) none of the mentioned
d) 0.5
Answer: c
Answer: a
3. The two kinds of semaphores are : advertisement
a) mutex & counting
b) binary & counting 7. The following pair of processes share a
c) counting & decimal common variable X :
d) decimal & binary Process A
int Y;
A1: Y = X*2;
Answer: b A2: X = Y;
4. A mutex : Process B
a) is a binary mutex int Z;
B1: Z = X+1;
b) must be accessed from only one process B2: X = Z;
c) can be accessed from multiple processes
d) None of the mentioned X is set to 5 before either process begins
execution. As usual, statements within a process
are executed sequentially, but statements in
Answer: b
process A may execute in any order with respect
5. At a particular time of computation the value of to statements in process B.
a counting semaphore is 7.Then 20 P operations How many different values of X are possible after
and 15 V operations were completed on this both processes finish executing ?
semaphore.The resulting value of the semaphore a) two
is : (GATE 1987) b) three
a) 42 c) four
b) 2 d) eight
c) 7
d) 12 Answer: c
Explanation: Here are the possible ways in which
statements from A and B can be interleaved.
A1 A2 B1 B2: X = 11 Answer: b
A1 B1 A2 B2: X = 6
A1 B1 B2 A2: X = 10 10. Spinlocks are intended to provide
B1 A1 B2 A2: X = 10
B1 A1 A2 B2: X = 6 __________ only.
B1 B2 A1 A2: X = 12. a) Mutual Exclusion
8. The program follows to use a shared binary b) Bounded Waiting
semaphore T : c) Aging
Process A d) Progress
int Y;
A1: Y = X*2;
A2: X = Y; Answer: b
signal(T); Operating System Questions and Answers –
Classic Synchronization Problems
Process B
int Z;
This set of 1000+ Operating System MCQs
B1: wait(T);
B2: Z = X+1; focuses on “The Classic Synchronization
X = Z; Problems”
T is set to 0 before either process begins 1. The bounded buffer problem is also known as :
execution and, as before, X is set to 5. a) Readers – Writers problem
Now, how many different values of X are possible b) Dining – Philosophers problem
after both processes finish executing ? c) Producer – Consumer problem
a) one d) None of the mentioned
b) two
c) three Answer: c
d) four
advertisement
advertisement Answer: a
advertisement 2. A monitor is characterized by :
9. Consider the methods used by processes P1 a) a set of programmer defined operators
and P2 for accessing their critical sections b) an identifier
whenever needed, as given below. The initial c) the number of variables in it
values of shared boolean variables S1 and S2 d) all of the mentioned
are randomly assigned. (GATE 2010)
Method used by P1 : Answer: a
while(S1==S2);
Critical section 3. A procedure defined within a ________ can
S1 = S2; access only those variables declared locally
within the _______ and its formal parameters.
Method used by P2 :
while(S1!=S2); a) process, semaphore
Critical section b) process, monitor
S2 = not(S1); c) semaphore, semaphore
Which of the following statements describes d) monitor, monitor
properties achieved ?
a) Mutual exclusion but not progress Answer: d
b) Progress but not mutual exclusion
c) Neither mutual exclusion nor progress 4. The monitor construct ensures that :
d) Both mutual exclusion and progress a) only one process can be active at a time within
the monitor
b) n number of processes can be active at a time
Answer: d within the monitor (n being greater than 1)
Operating System Questions and Answers – c) the queue has only one process in it at a time
Monitors
d) all of the mentioned
This set of Operating System Multiple Choice
Questions & Answers (MCQs) focuses on Answer: a
“Monitors”.
advertisement
1. A monitor is a type of :
5. The operations that can be invoked on a
a) semaphore
condition variable are :
b) low level synchronization construct
a) wait & signal
c) high level synchronization construct
b) hold & wait
d) none of the mentioned
c) signal & hold
d) continue & signal
Answer: c
advertisement Answer: a
6. The process invoking the wait operation is : a) committed, destroyed
a) suspended until another process invokes the b) aborted, destroyed
signal operation c) committed, aborted
b) waiting for another process to complete before d) none of the mentioned
it can itself call the signal operation
c) stopped until the next process in the queue Answer: c
finishes execution
d) none of the mentioned 3. The state of the data accessed by an aborted
transaction must be restored to what it was just
Answer: a before the transaction started executing. This
restoration is known as ________ of transaction.
7. If no process is suspended, the signal a) safety
operation : b) protection
a) puts the system into a deadlock state c) roll – back
b) suspends some default process’ execution d) revert – back
c) nothing happens
d) the output is unpredictable Answer: c
Answer: a
Answer: d
advertisement
6. An actual update is not allowed to a data item :
2. A terminated transaction that has completed its a) before the corresponding log record is written
execution successfully is ____________ out to stable storage
otherwise it is __________
b) after the corresponding log record is written out on T1
to stable storage b) There is a need to perform a redo operation on
c) until the whole log record has been checked for T1
inconsistencies c) There is no need to perform an undo and redo
d) all of the mentioned operation on T1
d) All of the mentioned
Answer: a
Answer: c
advertisement
7. The undo and redo operations must be 10. Serializable schedules are ones where :
_________ to guarantee correct behaviour, even a) concurrent execution of transactions is
if a failure occurs during recovery process. equivalent to the transactions executed serially
a) idempotent b) the transactions can be carried out one after
b) easy the other
c) protected c) a valid result occurs after execution
d) all of the mentioned transactions
d) none of the mentioned
Answer: a
Explanation: Idempotent – Multiple executions of Answer: a
an operation have the same result as does one
execution. 11. A locking protocol is one that :
8. The system periodically performs checkpoints a) governs how locks are acquired
that consists of the following operation(s) : b) governs how locks are released
a) Putting all the log records currently in main c) governs how locks are acquired and released
memory onto stable storage d) none of the mentioned
b) putting all modified data residing in main
memory onto stable storage
Answer: c
c) putting a log record onto stable storage
d) all of the mentioned 12. The two phase locking protocol consists of :
a) growing & shrinking phase
Answer: d b) shrinking & creation phase
c) creation & growing phase
9. Consider a transaction T1 that committed prior d) destruction & creation phase
to checkpoint. The <T1 commits> record appears
in the log before the <checkpoint> record. Any
Answer: a
modifications made by T1 must have been written
to the stable storage either with the checkpoint or advertisement
prior to it. Thus at recovery time:
a) There is a need to perform an undo operation
13. The growing phase is a phase in which : This set of Operating System Multiple Choice
a) A transaction may obtain locks, but does not Questions & Answers (MCQs) focuses on
release any “Deadlock”.
b) A transaction may obtain locks, and releases a
1. What is the reusable resource?
few or all of them
a) that can be used by one process at a time and
c) A transaction may release locks, but does not
is not depleted by that use
obtain any new locks
b) that can be used by more than one process at
d) A transaction may release locks, and does
a time
obtain new locks
c) that can be shared between various threads
d) none of the mentioned
Answer: a
Answer: a
14. The shrinking phase is a phase in which :
a) A transaction may obtain locks, but does not advertisement
release any
2. Which of the following condition is required for
b) A transaction may obtain locks, and releases a
deadlock to be possible?
few or all of them
a) mutual exclusion
c) A transaction may release locks, but does not
b) a process may hold allocated resources while
obtain any new locks
awaiting assignment of other resources
d) A transaction may release locks, and does
c) no resource can be forcibly removed from a
obtain new locks
process holding it
d) all of the mentioned
Answer: c
Answer: d
Answer: b
Answer: b
Explanation: Multiple threads can compete for
7. Deadlock prevention is a set of methods :
shared resources.
a) to ensure that at least one of the necessary
4. For a deadlock to arise, which of the following
conditions cannot hold
conditions must hold simultaneously ?
b) to ensure that all of the necessary conditions
a) Mutual exclusion
do not hold
b) No preemption
c) to decide if the requested resources for a
c) Hold and wait
process have to be given or not
d) All of the mentioned
d) to recover from a deadlock
Answer: d
Answer: a
5. For Mutual exclusion to prevail in the system :
8. For non sharable resources like a printer,
a) at least one resource must be held in a non
mutual exclusion :
sharable mode
a) must exist
b) the processor must be a uniprocessor rather
b) must not exist
than a multiprocessor
c) may exist
d) none of the mentioned d) None of the mentioned
Answer: a Answer: b
Explanation: A printer cannot be simultaneously
shared by several processes. 12. To ensure no preemption, if a process is
9. For sharable resources, mutual exclusion : holding some resources and requests another
a) is required resource that cannot be immediately allocated to
b) is not required it :
c) may be or may not be required a) then the process waits for the resources be
c) none of the mentioned allocated to it
b) the process keeps sending requests until the
Answer: b resource is allocated to it
Explanation: They do not require mutually c) the process resumes execution without the
exclusive access, and hence cannot be involved
in a deadlock. resource being allocated to it
10. To ensure that the hold and wait condition d) then all resources currently being held are
never occurs in the system, it must be ensured preempted
that :
a) whenever a resource is requested by a Answer: d
process, it is not holding any other resources
b) each process must request and be allocated all 13. One way to ensure that the circular wait
its resources before it begins its execution condition never holds is to :
c) a process can request resources only when it a) impose a total ordering of all resource types
has none and to determine whether one precedes another
d) all of the mentioned in the ordering
b) to never let a process acquire resources that
are held by other processes
Answer: d
Explanation: c – A process may request some c) to let a process wait for only one resource at a
resources and use them. Before it can can time
request any additional resources, however it must d) all of the mentioned
release all the resources that it is currently
allocated.
advertisement
Answer: a
11. The disadvantage of a process being Operating System Questions and Answers –
allocated all its resources before beginning its Deadlock Avoidance
execution is :
This set of Operating System Multiple Choice
a) Low CPU utilization
Questions & Answers (MCQs) focuses on
b) Low resource utilization
“Deadlock Avoidance”.
c) Very high resource utilization
1. Each request requires that the system consider occurrence
the _____________ to decide whether the b) the system can allocate resources to each
current request can be satisfied or must wait to process in some order and still avoid a deadlock
avoid a future possible deadlock. c) the state keeps the system protected and safe
a) resources currently available d) all of the mentioned
b) processes that have previously been in the
system Answer: b
c) resources currently allocated to each process
d) future requests and releases of each process 5. A system is in a safe state only if there exists a
:
Answer: a a) safe allocation
b) safe resource
advertisement c) safe sequence
2. Given a priori information about the ________ d) all of the mentioned
number of resources of each type that maybe
requested for each process, it is possible to Answer: c
construct an algorithm that ensures that the
system will never enter a deadlock state. 6. All unsafe states are :
a) minimum a) deadlocks
b) average b) not deadlocks
c) maximum c) fatal
d) approximate d) none of the mentioned
Answer: c Answer: b
advertisement
3. A deadlock avoidance algorithm dynamically
examines the __________ to ensure that a 7. A system has 12 magnetic tape drives and 3
circular wait condition can never exist. processes : P0, P1, and P2. Process P0 requires
a) resource allocation state 10 tape drives, P1 requires 4 and P2 requires 9
b) system storage state tape drives.
c) operating system Process
d) resources P0
P1
P2
Answer: a
Explanation: Resource allocation states are used Maximum needs (process-wise : P0 through
to maintain the availability of the already and P2 top to bottom)
current available resources. 10
4. A state is safe, if : 4
9
a) the system does not crash due to deadlock
d) none of the mentioned
Currently allocated (process-wise)
5
2 Answer: a
2
advertisement
Which of the following sequence is a safe
sequence ? 11. The data structures available in the Banker’s
a) P0, P1, P2 algorithm are :
b) P1, P2, P0 a) Available
c) P2, P0, P1 b) Need
d) P1, P0, P2 c) Allocation
d) All of the mentioned
Answer: d
Answer: d
8. If no cycle exists in the resource allocation
graph : 12. The content of the matrix Need is :
a) then the system will not be in a safe state a) Allocation – Available
b) then the system will be in a safe state b) Max – Available
c) all of the mentioned c) Max – Allocation
d) none of the mentioned d) Allocation – Max
Answer: b Answer: c
9. The resource allocation graph is not applicable 13. A system with 5 processes P0 through P4 and
to a resource allocation system : three resource types A, B, C has A with 10
a) with multiple instances of each resource type instances, B with 5 instances, and C with 7
b) with a single instance of each resource type instances. At time t0, the following snapshot has
c) single & multiple instance of each resource been taken :
type Process
d) none of the mentioned P0
P1
P2
Answer: a P3
P4
10. The Banker’s algorithm is _____________
Allocation (process-wise : P0 through P4
than the resource allocation graph algorithm. top TO bottom)
a) less efficient A B C
b) more efficient 0 1 0
2 0 0
c) equal
3 0 2
2 1 1
0 0 2 a) Pi is waiting for Pj to release a resource that Pi
MAX (process-wise : P0 through P4 top TO needs
bottom) b) Pj is waiting for Pi to release a resource that Pj
A B C needs
7 5 3
c) Pi is waiting for Pj to leave the system
3 2 2
9 0 2 d) Pj is waiting for Pi to leave the system
2 2 2
4 3 3
Answer: a
Available
A B C 3. If the wait for graph contains a cycle :
3 3 2 a) then a deadlock does not exist
b) then a deadlock exists
The sequence <P1, P3, P4, P2, P0> leads the
c) then the system is in a safe state
system to :
d) either deadlock exists or system is in a safe
a) an unsafe state
state
b) a safe state
c) a protected state
d) a deadlock Answer: b
Answer: a
Answer: a
advertisement
9. A system has 3 processes sharing 4 resources.
If each process needs a maximum of 2 units then, 2. The two ways of aborting processes and
deadlock : eliminating deadlocks are :
a) can never occur a) Abort all deadlocked processes
b) may occur b) Abort all processes
c) Abort one process at a time until the deadlock
cycle is eliminated a) aborted
d) All of the mentioned b) rolled back
c) terminated
Answer: c d) queued
Answer: d advertisement
Answer: a Answer: b
6. If execution time binding is being used, then a 10. The _________ time in a swap out of a
process ______ be swapped to a different running process and swap in of a new process
memory space. into the memory is very high.
a) has to be a) context – switch
b) can never b) waiting
c) must c) execution
d) may d) all of the mentioned
Answer: d Answer: a
Answer: a Answer: b
4. The relocation register helps in : 8. Using transient code, _______ the size of the
a) providing more address space to processes operating system during program execution.
b) a different address space to processes a) increases
c) to protect the address spaces of processes b) decreases
d) none of the mentioned c) changes
d) maintains
Answer: c
Answer: c
5. With relocation and limit registers, each logical
address must be _______ the limit register. 9. When memory is divided into several fixed
a) less than sized partitions, each partition may contain
b) equal to ________
c) greater than a) exactly one process
d) none of the mentioned b) at least one process
c) multiple processes at once
Answer: a d) none of the mentioned
advertisement
Answer: a
6. The operating system and the other processes
are protected from being modified by an already 10. In fixed size partition, the degree of
running process because : multiprogramming is bounded by ___________
a) they are in different memory spaces a) the number of partitions
b) they are in different logical addresses b) the CPU utilization
c) they have a protection algorithm c) the memory size
d) every address generated by the CPU is being d) all of the mentioned
checked against the relocation and limit registers
Answer: a
Explanation: None
Answer: d advertisement
7. Transient operating system code is code that : 11. The first fit, best fit and worst fit are strategies
a) is not easily accessible to select a ______
b) comes and goes as needed a) process from a queue to put in memory
c) stays in the memory always b) processor to run the next process
c) free hole from a set of available holes
d) all of the mentioned Answer: a
advertisement
Answer: c
6. When the valid – invalid bit is set to valid, it
means that the associated page : 10. To obtain better memory utilization, dynamic
a) is in the TLB loading is used. With dynamic loading, a routine
b) has data in it is not loaded until it is called. For implementing
c) is in the process’s logical address space dynamic loading,
d) is the system’s physical address space a) special support from hardware is required
b) special support from operating system is
essential
Answer: c
c) special support from both hardware and
7. Illegal addresses are trapped using the _____ operating system is essential
bit. d) user programs can implement dynamic loading
a) error without any special support from hardware or
b) protection operating system
c) valid – invalid
d) access Answer: d
advertisement
Answer: c
11. In paged memory systems, if the page size is
8. When there is a large logical address space, increased, then the internal fragmentation
the best way of paging would be : generally :
a) not to page a) becomes less
b) a two level paging algorithm b) becomes more
c) the page table itself c) remains constant
d) all of the mentioned d) none of the mentioned
Answer: b
Answer: b
9. In a paged memory, the page hit ratio is 0.35. Operating System Questions and Answers –
Memory Management – Segmentation
The required to access a page in secondary
memory is equal to 100 ns. The time required to This set of 1000+ Operating System MCQs
access a page in primary memory is 10 ns. The focuses on “Memory Management –
average time required to access a page is : Segmentation”
a) 3.0 ns
1. In segmentation, each address is specified by : b) starting physical address of the segment in
a) a segment number & offset memory
b) an offset & value c) segment length
c) a value & segment number d) none of the mentioned
d) a key & value
Answer: c
Answer: a
advertisement
advertisement
6. The offset ‘d’ of the logical address must be :
2. In paging the user provides only ________ a) greater than segment limit
which is partitioned by the hardware into b) between 0 and segment limit
________ and ______ c) between 0 and the segment number
a) one address, page number, offset d) greater than the segment number
b) one offset, page number, address
c) page number, offset, address Answer: b
d) none of the mentioned
7. If the offset is legal :
Answer: a a) it is used as a physical memory address itself
b) it is subtracted from the segment base to
3. Each entry in a segment table has a : produce the physical memory address
a) segment base c) it is added to the segment base to produce the
b) segment peak physical memory address
c) segment value d) none of the mentioned
d) none of the mentioned
Answer: a
Answer: a
8. When the entries in the segment tables of two
4. The segment base contains the : different processes point to the same physical
a) starting logical address of the process location :
b) starting physical address of the segment in a) the segments are invalid
memory b) the processes get blocked
c) segment length c) segments are shared
d) none of the mentioned d) all of the mentioned
Answer: b Answer: c
5. The segment limit contains the : 9. The protection bit is 0/1 based on :
a) starting logical address of the process a) write only
b) read only needed to implement the virtual address space of
c) read – write a process
d) none of the mentioned c) it is required by the translation lookaside buffer
d) it helps to reduce the number of page faults in
Answer: c page replacement algorithms
Answer: d
Answer: c
9. The hardware mechanism that allows a device
5. A ________ is a collection of electronics that
to notify the CPU is called _______
can operate a port, a bus, or a device.
a) polling
a) controller
b) interrupt
b) driver
c) driver
c) host
d) controlling
d) bus
Answer: b
Answer: a
Answer: a
Answer: a
9. A keyboard is an example of a device that is Operating System Questions & Answers – I/O
System – Kernel I/O Subsystems
accessed through a __________ interface.
a) block stream This set of Operating System Multiple Choice
b) set of blocks Questions & Answers (MCQs) focuses on “I/O
c) character stream System – Kernel I/O Subsystems”.
1. Buffering is done to : d) shell
a) cope with device speed mismatch
b) cope with device transfer size mismatch Answer: c
c) maintain copy semantics
d) all of the mentioned advertisement
advertisement
Answer: b
2. Hard real time operating system has ___ jitter
than a soft real time operating system. advertisement
a) less 6. The problem of priority inversion can be solved
b) more by
c) equal a) priority inheritance protocol
d) none of the mentioned b) priority inversion protocol
c) both priority inheritance and inversion protocol
Answer: a d) none of the mentioned
Explanation: Jitter is the undesired deviation from
the true periodicity.
Answer: a
7. Time duration required for scheduling Time System – Implementing RT Operating
Systems – 1
dispatcher to stop one process and start another
is known as This set of Operating System Multiple Choice
a) process latency Questions & Answers (MCQs) focuses on “Real
b) dispatch latency Time System – Implementing RT Operating
c) execution latency Systems – 1”.
d) interrupt latency
1. The disadvantage of real addressing mode is :
a) there is a lot of cost involved
Answer: b
b) time consumption overhead
8. Time required to synchronous switch from the c) absence of memory protection between
context of one thread to the context of another processes
thread is called d) restricted access to memory locations by
a) threads fly-back time processes
b) jitter
c) context switch time Answer: c
d) none of the mentioned
advertisement
4. Event latency is :
Answer: a a) the amount of time an event takes to occur
Operating System Questions & Answers – Real from when the system started
b) the amount of time from the event occurrence
till the system stops Answer: c
c) the amount of time from event occurrence till advertisement
the event crashes
d) the amount of time that elapses from when an 8. The most effective technique to keep dispatch
event occurs to when it is serviced. latency low is to :
a) provide non preemptive kernels
b) provide preemptive kernels
Answer: d
c) make it user programmed
advertisement d) run less number of processes at a time
Answer: c
Answer: a
6. Real time systems need to __________ the Operating System Questions & Answers – Real
interrupt latency. Time System – Implementing RT Operating
a) minimize Systems – 2
b) maximize
This set of Tough Operating System Questions
c) not bother about
and Answers focuses on “Real Time System –
d) none of the mentioned
Implementing RT Operating Systems – 2”.
Answer: d
Answer: b
9. The technique in which the CPU generates
advertisement
physical addresses directly is known as :
5. Some of the properties of real time systems a) relocation register method
include : b) real addressing
a) single purpose c) virtual addressing
b) inexpensively mass produced d) none of the mentioned
c) small size
d) all of the mentioned
Answer: b
Operating System Questions & Answers – Real
Answer: d Time System – Real Time CPU Scheduling – 1
This set of Operating System Multiple Choice d) None of the mentioned
Questions & Answers (MCQs) focuses on “Real
Time CPU Scheduling – 1”. Answer: a
1. Earliest deadline first algorithm assigns
5. Using EDF algorithm practically, it is impossible
priorities according to :
to achieve 100 percent utilization due to :
a) periods
a) the cost of context switching
b) deadlines
b) interrupt handling
c) burst times
c) power consumption
d) none of the mentioned
d) all of the mentioned
Answer: b
Answer: a
advertisement
advertisement
2. A process P1 has a period of 50 and a CPU
6. T shares of time are allocated among all
burst of t1 = 25, P2 has a period of 80 and a CPU
processes out of N shares in __________
burst of 35. The total CPU utilization is :
scheduling algorithm.
a) 0.90
a) rate monotonic
b) 0.74
b) proportional share
c) 0.94
c) earliest deadline first
d) 0.80
d) none of the mentioned
Answer: c
Answer: b
3. In the above question, the priorities of P1 and
7. If there are a total of T = 100 shares to be
P2 :
divided among three processes, A, B and C. A is
a) remain the same throughout
assigned 50 shares, B is assigned 15 shares and
b) keep varying from time to time
C is assigned 20 shares.
c) may or may not be change
A will have ______ percent of the total processor
d) none of the mentioned
time.
a) 20
Answer: b
b) 15
c) 50
4. In Question number 2, can the two processes
d) none of the mentioned
be scheduled using the EDF algorithm without
missing their respective deadlines ?
a) Yes Answer: c
b) No
c) Maybe
8. If there are a total of T = 100 shares to be Answer: b
Operating System Questions & Answers – Real
divided among three processes, A, B and C. A is
Time System – Real Time CPU Scheduling – 2
assigned 50 shares, B is assigned 15 shares and
C is assigned 20 shares. This set of Operating System Questions and
B will have ______ percent of the total processor Answers focuses on “Real Time CPU Scheduling
time. – 2” and will also be useful for GATE
a) 20 examinations.
b) 15
1. To schedule the processes, they are
c) 50
considered _________
d) none of the mentioned
a) infinitely long
b) periodic
Answer: b c) heavy weight
d) light weight
9. If there are a total of T = 100 shares to be
divided among three processes, A, B and C. A is
assigned 50 shares, B is assigned 15 shares and Answer: b
C is assigned 20 shares. advertisement
C will have ______ percent of the total processor
2. If the period of a process is ‘p’, then the rate of
time.
the task is :
a) 20
a) p2
b) 15
b) 2*p
c) 50
c) 1/p
d) none of the mentioned
d) p
Answer: a
Answer: c
10. If there are a total of T = 100 shares to be
3. The scheduler admits a process using :
divided among three processes, A, B and C. A is
a) two phase locking protocol
assigned 50 shares, B is assigned 15 shares and
b) admission control algorithm
C is assigned 20 shares.
c) busy wait polling
If a new process D requested 30 shares, the
d) none of the mentioned
admission controller would :
a) allocate 30 shares to it
b) deny entry to D in the system Answer: c
c) all of the mentioned
4. The ____________ scheduling algorithm
d) none of the mentioned
schedules periodic tasks using a static priority
policy with preemption.
a) earliest deadline first
b) rate monotonic Answer: a
c) first cum first served
8. If a set of processes cannot be scheduled by
d) priority
rate monotonic scheduling algorithm, then :
a) they can be scheduled by EDF algorithm
Answer: b
b) they cannot be scheduled by EDF algorithm
c) they cannot be scheduled by any other
5. Rate monotonic scheduling assumes that the :
algorithm
a) processing time of a periodic process is same
d) none of the mentioned
for each CPU burst
b) processing time of a periodic process is
different for each CPU burst Answer: c
c) periods of all processes is the same
9. A process P1 has a period of 50 and a CPU
d) none of the mentioned
burst of t1 = 25, P2 has a period of 80 and a CPU
burst of 35. The total CPU utilization is :
Answer: a
a) 0.90
advertisement b) 0.74
c) 0.94
6. In rate monotonic scheduling, a process with a
d) 0.80
shorter period is assigned :
a) a higher priority
Answer: c
b) a lower priority
c) higher & lower priority 10. Can the processes in the previous question
d) none of the mentioned be scheduled without missing the deadlines ?
a) Yes
Answer: a b) No
c) Maybe
7. There are two processes P1 and P2, whose
d) None of the mentioned
periods are 50 and 100 respectively. P1 is
assigned higher priority than P2. The processing
times are t1 = 20 for P1 and t2 = 35 for P2. Is it Answer: b
possible to schedule these tasks so that each Operating System Question & Answers –
meets its deadline using Rate monotonic Multimedia Systems
scheduling ?
This set of Operating System Multiple Choice
a) yes
Questions & Answers (MCQs) focuses on
b) no
“Multimedia Systems”.
c) maybe
d) none of the mentioned 1. A multimedia file
a) is same as any other regular file
b) must be accessed at specific rate b) SCAN-EDF scheduling
c) stored on remote server can not be delivered to c) Both Earliest-Deadline-First scheduling &
its client SCAN-EDF scheduling
d) none of the mentioned d) None of the mentioned
Answer: b Answer: c
2. In which type of streaming multimedia file is 6. Real time streaming protocol is used
delivered to the client, but not shared? a) to control streaming media servers
a) real-time streaming b) for establishing and controlling media sessions
b) progressive download between endpoints
c) compression c) to provide real time control of playback of
d) none of the mentioned media files from the server
d) all of the mentioned
Answer: a
Answer: d
3. Which one of the following is the characteristic
of a multimedia system? 7. In teardown state of real time streaming
a) high storage protocol
b) high data rates a) the server resources for client
c) both high storage and high data rates b) server delivers the stream to client
d) none of the mentioned c) server suspends delivery of stream
d) server breaks down the connection
Answer: c
Answer: d
4. The delay that occur during the playback of a
stream is called 8. CineBlitz multimedia server supports
a) stream delay a) real time clients
b) playback delay b) non-real time clients
c) jitter c) both real time & non-real time clients
d) event delay d) none of the mentioned
Answer: c Answer: c
5. Which algorithm can be optimized to meet the 9. Multimedia system require hard real time
timing deadlines and rate requirements of scheduling
continuous media? a) to ensure critical tasks will be serviced within
a) Earliest-Deadline-First scheduling timing deadlines
b) to deliver the media file to the client Answer: c
c) to minimize the delay
3. The faster the frames are displayed, :
d) for security
a) the rougher the video appears
b) the smoother the video appears
Answer: a
c) it gets blurry
d) none of the mentioned
10. Which one of the following resource is not
necessarily required on a file server?
a) secondary storage Answer: b
b) processor
4. The characteristic of the eye to retain the
c) network
image for a short time after it has been presented
b) monitor
is known as :
a) persistence of vision
Answer: d b) learning power
Operating System Questions & Answers – c) memory mapped input
Multimedia System – Compression – 1 d) none of the mentioned
Answer: d Answer: a
Explanation: Multimedia files must be accessed at
a specific rate whereas accessing regular files 6. Multimedia files stored on a remote server are
requires no special timings.
delivered to a client across the network using a
2. Video is represented as a series of images
technique known as :
formally known as :
a) download
a) pics
b) streaming
b) shots
c) flowing
c) frames
d) leaking
d) snaps
Answer: b advertisement
7. The two types of streaming techniques are : 11. Real time streaming is most useful for :
a) progressive download & real time streaming a) short video clips
b) regular download & real time streaming b) long video clips
c) real time & virtual time streaming c) extremely short and low quality videos
d) virtual time streaming d) none of the mentioned
Answer: a
Answer: b
Operating System Questions & Answers –
8. A media file containing audio or video is Multimedia System – Compression – 2
downloaded and stored on the client’s local file
system in : This set of Operating System Questions and
a) progressive download Answers focuses on “Multimedia System –
b) regular download Compression – 2” and will also be useful for GRE
c) real time streaming examinations.
d) virtual time streaming 1. The ability to move around within a media
stream is known as :
Answer: a a) buffering
Explanation: As the file is being downloaded, the b) random access
client is able to play back the media file without
having to wait for the file to be downloaded in its c) access
entirety. d) sequential access
9. Progressive download is most useful for :
a) short video clips Answer: b
b) long video clips
c) extremely long and high quality videos 2. The two types of real time streaming are :
d) none of the mentioned a) live & on demand streaming
b) dead & static streaming
Answer: a c) static & on demand streaming
d) on demand streaming
10. The media file is streamed to the client but is
only played and not stored by the client in : Answer: a
a) progressive download
b) regular download 3. Random access is not allowed in :
c) real time streaming a) live streaming
d) virtual time streaming b) dead streaming
c) static streaming
Answer: c d) on demand streaming
Answer: a 8. Compression ratio is the ratio of :
a) the original file size to the size of the
4. The streaming that takes place as the event is
compressed file
occurring is :
b) the number of pixels in a frame of the original
a) live streaming
size to those in a frame of the compressed file
b) dead streaming
c) compressed file size to the original file size
c) static streaming
d) none of the mentioned
d) on demand streaming
Answer: a
Answer: d
9. Lossy and lossless are classifications of :
5. For a computer to deliver continuous media it
a) multimedia storage systems
must guarantee the specific rate and timing
b) files
requirements, also known as :
c) compression algorithms
a) deadline
d) all of the mentioned
b) quality of service
c) period
Answer: c
d) burst time
Answer: c Answer: d
Answer: c
Answer: b
6. If several requests have different deadlines that
2. The priority of a process will ______________
are relatively close together, then using the SCAN
if the scheduler assigns it a static priority.
– EDF algorithm :
a) change
a) the SCAN ordering will service the requests in
b) remain unchanged
that batch
c) depends on the operating system
b) the EDF ordering will service the requests in
d) none of the mentioned
that batch
c) the FCFS ordering will service the requests in
Answer: b that batch
d) none of the mentioned Network Management” and will also be useful for
campus interviews.
Answer: a 1. The three general methods for delivering
content from a server to a client across a network
7. Multimedia systems require _________
are :
scheduling to ensure critical tasks will be serviced
a) unicasting
within timing deadlines.
b) multicasting
a) soft real time
c) broadcasting
b) hard real time
d) all of the mentioned
c) normal
d) none of the mentioned
Answer: d
Answer: b
Answer: a
4. Multicasting delivers the content to :
Operating System Questions & Answers –
Multimedia System – Network Management a) a single client
b) all clients, regardless whether they want the
This set of Operating System Questions and content or not
Answers focuses on “Multimedia System – c) a group of receivers who indicate they wish to
receive the content
d) none of the mentioned 9. In the TEARDOWN state :
a) the server breaks down the connection and
Answer: c releases the resources allocated for the session
b) the client breaks down the connection and
5. RTSP stands for : releases the resources allocated for the session
a) Real Time Streaming Policy c) the system crashes
b) Real Time Streaming Protocol d) none of the mentioned
c) Real Time Systems Protocol
d) Read Time Streaming Policy Answer: a
Answer: c
Answer: c
13. To let a client have random access to a media c) Stop
stream : d) Read
a) the protocol used must not be stateless
b) the server must support download Answer: c
c) the stream should give access rights to the
client 4. Which of the following is a good practice ?
d) all of the mentioned a) Give full permission for remote transferring
b) Grant read only permission
c) Grant limited permission to specified account
Answer: a d) Give both read and write permission but not
Operating System Questions & Answers – execute
Security – User Authentication
Answer: d
Answer: d Explanation: Telnet and FTP are not encrypted
and can be compromised.
2. What are common security threats ? 6. Which of the following is least secure method
a) File Shredding of authentication ?
b) File sharing and permission a) Key card
c) File corrupting b) fingerprint
d) File integrity c) retina pattern
d) Password
Answer: b
Explanation: Sharing and associated permissions Answer: d
are usual exploits which can compromise the Explanation: Passwords can be be compromised
system. more easily than to replicate a physical thing like
3. From the following, which is not a common file key card, fingerprint or retina.
permission ? 7. Which of the following is a strong password ?
a) Write a) 19thAugust88
b) Execute b) Delhi88
c) P@assw0rd a) Authorization
d) !augustdelhi b) Authentication
c) Authorization & Authentication are same
Answer: c d) None of the mentioned
Explanation: It has a combination of Alphabet
both capital and small along with number and
special character. Thus always use complex Answer: a
password with combination of all these.
8. Why is one time password safe ? 12. What is characteristics of Authorization ?
a) It is easy to generated a) RADIUS and RSA
b) It cannot be shared b) 3 way handshaking with syn and fin
c) It is different for every access c) Multilayered protection for securing resources
d) It is a complex encrypted password d) Deals with privileges and rights
Answer: c Answer: d
Explanation: One time password is safe since it is
generated per access and thus cannot be brute advertisement
forced or deduced.
13. What forces the user to change password at
9. What does Light Directory Access Protocol
first logon ?
(LDAP) doesn’t store ?
a) Default behavior of OS
a) Users
b) Part of AES encryption practice
b) Address
c) Devices being accessed forces the user
c) Passwords
d) Account administrator
d) Security Keys
Answer: d
Answer: b Explanation: Its administrator’s job to ensure that
password of the user remains private and is
10. What is characteristic of RADIUS system ? known only to user. But while making a new user
a) It is essential for centralized encryption and account he assigns a random general password
to give it to user. Thus even administrator cannot
authentication access a particular users account.
b) It works on Network layer to deny access to 14. What is not a best practice for password
unauthorized people policy ?
c) It provides centralized authentication a) Deciding maximum age of password
mechanism via network devices b) Restriction on password reuse and history
d) It’s a strong File access system c) Password encryption
d) Having change password every 2 years
Answer: c
Answer: d Answer: d
Explanation: Virus can be detected by having a
antivirus program. advertisement
9. What is known as masquerading ?
13. Which is not a valid port scan type ?
a) When one participant in communication
a) ACK scanning
pretends to be someone else
b) Window scanning
b) When attacker modifies data in communication
c) IGMP scan
c) When attack is of fraudulent repeat of a valid
d) FIN scanning
data
d) When attack gains access to remote systems
Answer: c
Answer: c Answer: c
Explanation: Firewall create a protective barrier to
16. With regard to DOS attack what is not true secure internal network. A antivirus can only
detect harmful viruses but cannot stop illegal
from below options ? access by remote attacker.
a) We can stop DOS attack completely 3. What is best practice in firewall domain
b) By upgrading OS vulnerability we can stop environment ?
DOS attack to some extent a) Create two domain trusted and untrusted
c) DOS attack has to be stopped at network level domain
d) Such attack can last for hours b) Create strong policy in firewall to support
different types of users
c) Create a Demilitarized zone
Answer: a
d) Create two DMZ zones with one untrusted
Operating System Questions & Answers –
Security – Securing Systems and Facilities domain
Answer: c
Answer: a Explanation: Connection from internet are never
Explanation: RAM has no effect on security of a allowed to directly access internal PCs but is
system. System’s protection remains unchanged routed through DMZ zone to prevent attacks.
in increasing or decreasing amount of RAM. 5. What are two features of a tripwire file system
2. What is used to protect network from outside ?
internet access ? a) It is a tool to monitor file systems
a) A trusted antivirus b) It is used to automatically take corrective action
b) 24 hours scanning for virus c) It is used to secure UNIX system
c) Firewall to separate trusted and untrusted d) None of the mentioned
network
Answer: a d) None of the mentioned
Answer: d
Answer: a
2. What are major components of intrusion
advertisement
detection system ?
8. What is known as sandbox ? a) Analysis Engine
a) It is a program which can be molded to do b) Event provider
desired task c) Alert Database
b) It is program that is controlled or emulated d) All of the mentioned
section of OS
c) It is a special mode of antivirus
Answer: d
d) None of the mentioned
3. What are the different ways to classify an IDS ?
Answer: b a) anomaly detection
b) signature based misuse
9. What is are two safe computing practices ? c) stack based
a) Not to open software from unknown vendors d) all of the mentioned
b) Open and execute programs in admin
level/root
Answer: d
c) Open and execute programs in presence of
antivirus 4. What are the different ways to classify an IDS ?
a) Zone based
b) Host & Network based Answer: a
c) Network & Zone based
8. What are drawbacks of signature based IDS ?
d) Level based
a) They are unable to detect novel attacks
b) They suffer from false alarms
Answer: b
c) They have to be programmed again for every
new pattern to be detected
5. What are characteristics of anomaly based IDS
d) All of the mentioned
?
a) It models the normal usage of network as a
noise characterization Answer: d
b) It doesn’t detect novel attacks
9. What are characteristics of Host based IDS ?
c) Anything distinct from the noise is not assumed
a) The host operating system logs in the audit
to be intrusion activity
information
d) It detects based on signature
b) Logs includes logins,file opens and program
executions
Answer: a
c) Logs are analysed to detect tails of intrusion
d) All of the mentioned
6. What is major drawback of anomaly detection
IDS ?
a) These are very slow at detection Answer: d
b) It generates many false alarms
10. What are drawbacks of the host based IDS ?
c) It doesn’t detect novel attacks
a) Unselective logging of messages may increase
d) None of the mentioned
the audit burdens
b) Selective logging runs the risk of missed
Answer: b
attacks
c) They are very fast to detect
7. What are characteristics of signature based
d) They have to be programmed for new patterns
IDS ?
a) Most are based on simple pattern matching
algorithms Answer: a
b) It is programmed to interpret a certain series of
11. What are strengths of the host based IDS ?
packets
a) Attack verification
c) It models the normal usage of network as a
b) System specific activity
noise characterization
c) No additional hardware required
d) Anything distinct from the noise is assumed to
d) All of the mentioned
be intrusion activity
Answer: d
12. What are characteristics of stack based IDS ? This set of Operating System Multiple Choice
a) They are integrated closely with the TCP/IP Questions & Answers (MCQs) focuses on
stack and watch packets “Security – Cryptography”.
b) The host operating system logs in the audit
1. What is preferred way of encryption ?
information
a) pre shared secret key
c) It is programmed to interpret a certain series of
b) using key distribution center (KDC)
packets
c) public key-encryption
d) It models the normal usage of network as a
d) symmetric key
noise characterization
Answer: c
Answer: a Explanation: Pre Shared key can be
compromised and either party can be suspected.
advertisement Likewise KDC or symmetric key can have breach
which are undesirable. Public and private key
13. What are characteristics of Network based encryption is a known industry standard.
IDS ? 2. What is not a role of encryption ?
a) They look for attack signatures in network a) It is used to protect data from unauthorized
traffic access during transmission
b) Filter decides which traffic will not be discarded b) It is used to ensure user authentication
or passed c) It is used to ensure data integrity
c) It is programmed to interpret a certain series of d) It is used to ensure data corruption doesn’t
packet happens
d) It models the normal usage of network as a
noise characterization
Answer: d
Explanation: Encryption doesn’t have error
Answer: a correction or detection facility thus cannot be
used to safeguard from data corruption.
14. What are strengths of Network based IDS ? 3. What is cipher-block chaining ?
a) Cost of ownership reduced a) Data is logically ‘ANDed’ with previous block
b) Malicious intent detection b) Data is logically ‘ORed’ with previous block
c) Real time detection and response c) Data is logically ‘XORed’ with previous block
d) All of the mentioned d) None of the mentioned
Answer: c
Answer: d
Operating System Questions & Answers – 4. What is not an encryption standard ?
Security – Cryptography a) AES
b) TES
c) Triple DES
d) DES b) AES
c) DAS
Answer: b d) Digital-signature
Answer: c 9. Linux is
a) single user, single tasking
5. Which one of the following bootloader is not b) single user, multitasking
used by linux? c) multi user, single tasking
d) multi user, multitasking a) other threads in the another process can also
read from that file
Answer: d b) other threads in the same process can also
read from that file
10. Which one of the following is not a linux c) any other thread can not read from that file
distribution? d) all of the mentioned
a) debian
b) gentoo Answer: b
c) open SUSE
d) multics
4. The time required to create a new thread in an
existing process is
Answer: d a) greater than the time required to create a new
Operating System Questions & Answers – process
Threads c) less than the time required to create a new
process
This set of Operating System Multiple Choice
c) equal to the time required to create a new
Questions & Answers (MCQs) focuses on
process
“Threads”.
d) none of the mentioned
1. Which one of the following is not shared by
threads? Answer: b
a) program counter
b) stack
5. When the event for which a thread is blocked
c) both program counter and stack
occurs,
d) none of the mentioned
a) thread moves to the ready queue
b) thread remains blocked
Answer: c
c) thread completes
d) a new thread is provided
2. A process can be
a) single threaded Answer: a
b) multithreaded
c) both single threaded and multithreaded
6. The jacketing technique is used to
d) none of the mentioned
a) convert a blocking system call into non
blocking system call
Answer: c
b) create a new thread
c) communicate between threads
3. If one thread opens a file with read privileges d) terminate a thread
then
Answer: a Answer: d
Answer: a Answer: b
12. Which of the following is FALSE ? 3. In the Many to One model, if a thread makes a
a) Context switch time is longer for kernel level blocking system call :
threads than for user level threads a) the entire process will be blocked
b) User level threads do not need any hardware b) a part of the process will stay blocked, with the
support rest running
c) Related kernel level threads can be scheduled c) the entire process will run
on different processors in a multiprocessor d) none of the mentioned
system
d) Blocking one kernel level thread blocks all
Answer: a
other related threads
1. Signals that occur at the same time, are 5. Signals are identified by :
presented to the process : a) signal identifiers
a) one at a time, in a particular order b) signal handlers
b) one at a time, in no particular order c) signal actions
c) all at a time d) none of the mentioned
d) none of the mentioned
Answer: a
Answer: b
Answer: d
8. In UNIX, the set of masked signals can be set
or cleared using the ________ function.
a) sigmask 12. In most cases, if a process is sent a signal
b) sigmaskproc while it is executing a system call :
c) sigprocmask a) the system call will continue execution and the
d) sigproc signal will be ignored completely
b) the system call is interrupted by the signal, and
Answer: c the signal handler comes in
c) the signal has no effect until the system call
completes
9. The usefulness of signals as a general inter
d) none of the mentioned
process communication mechanism is limited
because :
Answer: c
a) they do not work between processes
b) they are user generated
c) they cannot carry information directly advertisement
d) none of the mentioned 13. A process can never be sure that a signal it
has sent _____________
Answer: c a) has which identifier
b) has not been lost
10. The usual effect of abnormal termination of a c) has been sent
program is :
d) all of the mentioned Answer: b
Answer: b
Answer: c
Operating System Questions and Answers –
4. The idea behind thread pools is :
Thread Pools
a) a number of threads are created at process
This set of Operating System Multiple Choice startup and placed in a pool where they sit and
Questions & Answers (MCQs) focuses on wait for work
“Thread Pools”. b) when a process begins, a pool of threads is
chosen from the many existing and each thread is
1. Thread pools are useful when :
allotted equal amount of work
a) when we need to limit the number of threads
c) all threads in a pool distribute the task equally
running in the application at the same time
among themselves
b) when we need to limit the number of threads
d) none of the mentioned
running in the application as a whole
c) when we need to arrange the ordering of
threads Answer: a
d) none of the mentioned
5. If the thread pool contains no available thread :
Answer: a a) the server runs a new process
b) the server goes to another thread pool
c) the server demands for a new pool creation
2. Instead of starting a new thread for every task
d) the server waits until one becomes free
to execute concurrently, the task can be passed
to a ___________
a) process Answer: d
b) thread pool
c) thread queue 6. Thread pools help in :
d) none of the mentioned a) servicing multiple requests using one thread
b) servicing a single request using multiple
threads from the pool c) instructions
c) faster servicing of requests with an existing d) none of the mentioned
thread rather than waiting to create a new thread
d) none of the mentioned Answer: a
Answer: a
Operating System Questions & Answers – Virtual
7. In FIFO page replacement algorithm, when a Memory – Demand Paging
page must be replaced
This set of Operating System Multiple Choice
a) oldest page is chosen
Questions & Answers (MCQs) focuses on “Virtual
b) newest page is chosen
Memory – Demand Paging”.
c) random page is chosen
d) none of the mentioned 1. Virtual memory allows :
a) execution of a process that may not be
completely in memory
8. Which algorithm chooses the page that has not
b) a program to be smaller than the physical
been used for the longest period of time
memory
whenever the page required to be replaced?
c) a program to be larger than the secondary
a) first in first out algorithm
storage
b) additional reference bit algorithm
d) execution of a process without being in
c) least recently used algorithm
physical memory
d) counting based page replacement algorithm
Answer: a
Answer: c
Answer: a
3. Error handler codes, to handle unusual errors Answer: a
are :
a) almost never executed 7. Segment replacement algorithms are more
b) executed very often complex than page replacement algorithms
c) executed periodically because :
d) none of the mentioned a) Segments are better than pages
b) Pages are better than segments
Answer: a c) Segments have variable sizes
d) Segments have fixed sizes
Answer: b
4. A memory page containing a heavily used
variable that was initialized very early and is in
constant use is removed, then the page 7. If no frames are free, _____ page transfer(s)
replacement algorithm used is : is/are required.
a) LRU a) one
b) LFU b) two
c) three long time
d) four b) Replace the page that has been used for a
long time
Answer: b c) Replace the page that will not be used for a
long time
d) None of the mentioned
8. When a page is selected for replacement, and
its modify bit is set :
a) the page is clean Answer: c
b) the page has been modified since it was read
in from the disk 12. Optimal page – replacement algorithm is
c) the page is dirty difficult to implement, because :
d) the page has been modified since it was read a) it requires a lot of information
in from the disk & page is dirty b) it requires future knowledge of the reference
string
Answer: d c) it is too complex
d) it is extremely expensive
This set of Operating System MCQs focuses on 4. Applying the LRU page replacement to the
“Virtual Memory – Page Replacement Algorithms following reference string :
– 2”. 12452124
1. When using counters to implement LRU, we The main memory can accommodate 3 pages
replace the page with the : and it already has pages 1 and 2. Page 1 came in
a) smallest time value before page 2.
b) largest time value How many page faults will occur ?
c) greatest size a) 2
d) none of the mentioned b) 3
c) 4
d) 5
Answer: a
Explanation: Whenever a reference to a page is
made, the contents of the clock register are Answer: c
copied into the time-of-use field in the page-table
entry for that page. In this way we always have
the time of the last reference to each page. 5. Increasing the RAM of a computer typically
improves performance because:
2. In the stack implementation of the LRU
a) Virtual memory increases
algorithm, a stack can be maintained in a manner
b) Larger RAMs are faster
:
c) Fewer page faults occur
a) whenever a page is used, it is removed from
d) None of the mentioned 9. The reason for using the MFU page
replacement algorithm is :
Answer: c a) an actively used page should have a large
reference count
b) a less used page has more chances to be used
6. The essential content(s) in each entry of a
again
page table is / are :
c) it is extremely efficient and optimal
a) Virtual page number
d) all of the mentioned
b) Page frame number
c) Both virtual page number and page frame
number Answer: b
d) Access right information
10. The implementation of the LFU and the MFU
Answer: b algorithm is very uncommon because :
a) they are too complicated
b) they are optimal
7. The minimum number of page frames that
c) they are expensive
must be allocated to a running process in a virtual
d) all of the mentioned
memory environment is determined by :
a) the instruction set architecture
Answer: c
b) page size
c) physical memory size
d) number of processes in memory
Operating System Questions & Answers – Virtual
Memory – Allocation of Frames
Answer: a
This set of Operating System Multiple Choice
Questions & Answers focuses on “Virtual Memory
8. The reason for using the LFU page – Allocation of Frames”.
replacement algorithm is :
a) an actively used page should have a large 1. The minimum number of frames to be allocated
reference count to a process is decided by the :
b) a less used page has more chances to be used a) the amount of available physical memory
again b) operating System
c) it is extremely efficient and optimal c) instruction set architecture
d) all of the mentioned d) none of the mentioned
Answer: a Answer: c
2. When a page fault occurs before an executing d) none of the mentioned
instruction is complete :
a) the instruction must be restarted Answer: b
b) the instruction must be ignored
c) the instruction must be completed ignoring the
6. The algorithm in which we allocate memory to
page fault
each process according to its size is known as :
d) none of the mentioned
a) proportional allocation algorithm
b) equal allocation algorithm
Answer: a c) split allocation algorithm
d) none of the mentioned
3. Consider a machine in which all memory
reference instructions have only one memory Answer: a
address, for them we need at least _____
frame(s).
7. With either equal or proportional algorithm, a
a) one
high priority process is treated ___________ a
b) two
low priority process.
c) three
a) greater than
d) none of the mentioned
b) same as
c) lesser than
Answer: b d) none of the mentioned
Explanation: At least one frame for the instruction
and one for the memory reference.
Answer: b
4. The maximum number of frames per process is
defined by :
a) the amount of available physical memory 8. _________ replacement allows a process to
b) operating System select a replacement frame from the set of all
c) instruction set architecture frames, even if the frame is currently allocated to
d) none of the mentioned some other process.
a) Local
b) Universal
Answer: a
c) Global
d) Public
5. The algorithm in which we split m frames
among n processes, to give everyone an equal
Answer: c
share, m/n frames is known as :
a) proportional allocation algorithm
b) equal allocation algorithm 9. _________ replacement allows each process
c) split allocation algorithm to only select from its own set of allocated frames.
a) Local b) it spends a lot of time paging, than executing
b) Universal c) it has no memory allocated to it
c) Global d) none of the mentioned
d) Public
Answer: b
Answer: a
2. Thrashing _______ the CPU utilization.
10. One problem with the global replacement a) increases
algorithm is that : b) keeps constant
a) it is very expensive c) decreases
b) many frames can be allocated to a process d) none of the mentioned
c) only a few frames can be allocated to a
process Answer: c
d) a process cannot control its own page – fault
rate
3. A locality is :
a) a set of pages that are actively used together
Answer: d b) a space in memory
c) an area near a set of processes
advertisement d) none of the mentioned
11. ________ replacement generally results in
greater system throughput. Answer: a
a) Local
b) Global 4. When a subroutine is called,
c) Universal a) it defines a new locality
d) Public b) it is in the same locality from where it was
called
c) it does not define a new locality
Answer: b
d) none of the mentioned
Operating System Questions & Answers – Virtual
Memory – Thrashing
Answer: a
This set of Operating System Multiple Choice
Questions & Answers (MCQs) focuses on “Virtual
Memory – Thrashing”. 5. A program is generally composed of several
different localities, which _____ overlap.
1. A process is thrashing if : a) may
a) it spends a lot of time executing, rather than b) must
paging c) do not
d) must not c) it will cause memory problems
d) none of the mentioned
Answer: a
Answer: b
6. In the working set model, for :
26157777516234123444343444 10. If the sum of the working – set sizes
1323 increases, exceeding the total number of
if DELTA = 10, then the working set at time t1 available frames :
(….7 5 1) is : a) then the process crashes
a) {1, 2, 4, 5, 6} b) the memory overflows
b) {2, 1, 6, 7, 3} c) the system crashes
c) {1, 6, 5, 7, 2} d) the operating system selects a process to
d) {1, 2, 3, 4, 5} suspend
Answer: c Answer: d
7. The accuracy of the working set depends on 11. Consider the following page reference string :
the selection of : 12342156212376321236
a) working set model For LRU page replacement algorithm with 4
b) working set size frames, the number of page faults is :
c) memory size a) 10
d) number of pages in memory b) 14
c) 8
Answer: b d) 11
Answer: a
8. If working set window is too small :
a) it will not encompass entire locality
b) it may overlap several localities 12. Consider the following page reference string :
c) it will cause memory problems 12342156212376321236
d) none of the mentioned For LRU page replacement algorithm with 5
frames, the number of page faults is :
Answer: a a) 10
b) 14
c) 8
9. If working set window is too large :
d) 11
a) it will not encompass entire locality
b) it may overlap several localities
Answer: c Answer: d
Operating System Questions & Answers – File
System Concepts
advertisement
This set of Operating System Multiple Choice
13. Consider the following page reference string :
Questions & Answers (MCQs) focuses on “File
12342156212376321236
System Concepts”.
For FIFO page replacement algorithms with 3
frames, the number of page faults is : 1. ______ is a unique tag, usually a number,
a) 16 identifies the file within the file system.
b) 15 a) File identifier
c) 14 b) File name
d) 11 c) File type
d) None of the mentioned
Answer: a
Answer: a
14. Consider the following page reference string :
12342156212376321236 2. To create a file
For FIFO page replacement algorithms with 4 a) allocate the space in file system
frames, the number of page faults is : b) make an entry for new file in directory
a) 16 c) allocate the space in file system & make an
b) 15 entry for new file in directory
c) 14 d) none of the mentioned
d) 11
Answer: c
Answer: c
Answer: a
Answer: c
Operating System Questions & Answers – File
System Implementation
7. Mapping of file is managed by
This set of Operating System Multiple Choice
a) file metadata
Questions & Answers (MCQs) focuses on “File
b) page table
System Implementation”.
c) virtual memory
d) file system 1. Management of metadata information is done
by
Answer: a a) file-organisation module
b) logical file system
c) basic file system
8. Mapping of network file system protocol to local
d) application programs
file system is done by
a) network file system
Answer: b
b) local file system
2. A file control block contains the information 6. What is raw disk?
about a) disk without file system
a) file ownership b) empty disk
b) file permissions c) disk lacking logical file system
c) location of file contents d) disk having file system
d) all of the mentioned
Answer: a
Answer: d
7. The data structure used for file directory is
3. Which table contains the information about called
each mounted volume? a) mount table
a) mount table b) hash table
b) system-wide open-file table c) file table
c) per-process open-file table d) process table
d) all of the mentioned
Answer: b
Answer: d
Answer: b Answer: a
5. When a process closes the file 9. If the block of free-space list is free then bit will
a) per-process table entry is not removed a) 1
b) system wide entry’s open count is b) 0
decremented c) any of 0 or 1
c) all of the mentioned d) none of the mentioned
d) none of the mentioned
Answer: a
Answer: b
10. Which protocol establishes the initial logical
connection between a server and a client?
a) transmission control protocol 4. A file is a/an _______ data type.
b) user datagram protocol a) abstract
c) mount protocol b) primitive
d) datagram congestion control protocol c) public
d) private
Answer: c
Answer: a
Operating System Questions & Answers – File
System Interface Access Methods – 1
5. The operating system keeps a small table
This set of Operating System Multiple Choice
containing information about all open files called :
Questions & Answers (MCQs) focuses on “File
a) system table
System Interface Access Methods – 1”.
b) open-file table
1. Data cannot be written to secondary storage c) file table
unless written within a ______ d) directory table
a) file
b) swap space Answer: b
c) directory
d) text format
6. In UNIX, the open system call returns :
a) pointer to the entry in the open file table
Answer: a
b) pointer to the entry in the system wide table
c) a file to the process calling it
2. File attributes consist of : d) none of the mentioned
a) name
b) type Answer: a
c) identifier
d) all of the mentioned
7. System wide table in UNIX contains process
independent information such as :
Answer: d
a) location of file on disk
b) access dates
3. The information about all files is kept in : c) file size
a) swap space d) all of the mentioned
b) operating system
c) seperate directory structure Answer: d
d) none of the mentioned
advertisement
Answer: c
8. The open file table has a/an _______ c) same
associated with each file. d) none of the mentioned
a) file content
b) file permission Answer: a
c) open count
d) close count
3. In the sequential access method, information in
the file is processed :
Answer: c a) one disk after the other, record access doesnt
Explanation: open count indicates the number of
processes that have the file open. matter
b) one record after the other
9. The file name is generally split into two parts : c) one text document after the other
a) name & identifier d) none of the mentioned
b) identifier & type
c) extension & name
Answer: b
d) type & extension
Answer: c
2. The larger the block size, the ______ the
internal fragmentation.
6. For a direct access file :
a) greater
a) there are restrictions on the order of reading
b) lesser
and writing This set of Operating System Multiple Choice
b) there are no restrictions on the order of reading Questions & Answers (MCQs) focuses on “File
and writing System Interface Directory Structure – 1”.
c) access is restricted permission wise
1. To organise file systems on disk, :
d) access is not restricted permission wise
a) they are split into one or more partitions
b) information about files is added to each
Answer: b partition
c) they are made on different storage spaces
7. A relative block number is an index relative to : d) all of the mentioned
a) the beginning of the file
b) the end of the file Answer: b
c) the last written position in file
d) none of the mentioned
2. The directory can be viewed as a _________
that translates file names into their directory
Answer: a entries.
a) symbol table
advertisement b) partition
c) swap space
8. The index contains :
d) cache
a) names of all contents of file
b) pointers to each page
c) pointers to the various blocks Answer: a
d) all of the mentioned
3. In the single level directory :
Answer: c a) All files are contained in different directories all
at the same level
b) All files are contained in the same directory
9. For large files, when the index itself becomes
c) Depends on the operating system
too large to be kept in memory :
d) None of the mentioned
a) index is called
b) an index is created for the index file
c) secondary index files are created Answer: b
d) all of the mentioned
4. In the single level directory :
a) all directories must have unique names
Answer: b b) all files must have unique names
Operating System Questions & Answers – File
System Interface Directory Structure – 1 c) all files must have unique owners
d) all of the mentioned c) it does not isolate users from one another
d) it isolates users from one another
Answer: b
Answer : d
5. In the two level directory structure :
a) each user has his/her own user file directory 9. In the tree structured directories,
b) the system doesn’t its own master file directory a) the tree has the stem directory
c) all of the mentioned b) the tree has the leaf directory
d) none of the mentioned c) the tree has the root directory
d) all of the mentioned
Answer: a
Answer : c
Answer: c advertisement
Answer: c Answer : a
Operating System Questions & Answers – File
System Interface Directory Structure – 2
8. The disadvantage of the two level directory
structure is that : This set of JUnit Problems focuses on “File
a) it does not solve the name collision problem System Interface Directory Structure – 2”.
b) it solves the name collision problem
1. An absolute path name begins at the : a) allows
a) leaf b) may restrict
b) stem c) restricts
c) current directory d) none of the mentioned
d) root
Answer : c
Answer : d
6. With a shared file :
2. A relative path name begins at the : a) actual file exists
a) leaf b) there are two copies of the file
b) stem c) the changes made by one person are not
c) current directory reflected to the other
d) root d) the changes made by one person are reflected
to the other
Answer : c
Answer : d
Answer : c Answer: b
Operating System Questions & Answers – File
System Interface Mounting and Sharing
4. A process _____ lower the priority of another
This set of Operating System Multiple Choice process, if both are owned by the same owner.
Questions & Answers (MCQs) focuses on “File a) must
System Interface Mounting and Sharing”. b) can
c) cannot
d) none of the mentioned 8. The machine containing the files is the
_______ and the machine wanting to access the
Answer: b files is the ______
a) master, slave
b) memory, user
5. In distributed file system, ______ directories
c) server, client
are visible from the local machine.
d) none of the mentioned
a) protected
b) local
c) private Answer: c
d) remote
9. Distributed naming services/Distributed
Answer: d information systems have been devised to :
a) provide information about all the systems
b) provide unified access to the information
6. In the world wide web, a ____ is needed to
needed for remote computing
gain access to the remote files, and separate
c) provide unique names to all systems in a
operations are used to transfer files.
network
a) laptop
d) all of the mentioned
b) plugin
c) browser
Answer: b
d) player
This set of Operating System Multiple Choice 5. All users in a group get _______ access to a
Questions & Answers (MCQs) focuses on “File file.
System Interface Protection”. a) different
1. Reliability of files can be increased by : b) similar
a) keeping the files safely in the memory c) same
b) making a different partition for the files c) none of the mentioned
c) by keeping them in external storage
d) by keeping duplicate copies of the file Answer: b
10. In a multi level directory structure : 1. The three major methods of allocating disk
a) the same previous techniques will be used as space that are in wide use are :
in the other structures a) contiguous
b) a mechanism for directory protection will have b) linked
to applied c) indexed
c) the subdirectories do not need protection once d) all of the mentioned
the directory is protected
d) none of the mentioned Answer: d
2. In contiguous allocation : d) file control block
a) each file must occupy a set of contiguous
blocks on the disk Answer: a
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed
6. The VFS (virtual file system) activates file
together in one location
system specific operations to handle local
d) none of the mentioned
requests according to their _______
a) size
Answer: a b) commands
c) timings
3. In linked allocation : d) file system types
a) each file must occupy a set of contiguous
blocks on the disk Answer: d
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed
7. The real disadvantage of a linear list of
together in one location
directory entries is the :
d) none of the mentioned
a) size of the linear list in memory
b) linear search to find a file
Answer: b c) it is not reliable
d) all of the mentioned
4. In indexed allocation :
a) each file must occupy a set of contiguous Answer: b
blocks on the disk
b) each file is a linked list of disk blocks
8. Contiguous allocation of a file is defined by :
c) all the pointers to scattered blocks are placed
a) disk address of the first block & length
together in one location
b) length & size of the block
d) none of the mentioned
c) size of the block
d) total size of the file
Answer: c
Answer: a
5. On systems where there are multiple operating
system, the decision to load a particular one is
9. One difficulty of contiguous allocation is :
done by :
a) finding space for a new file
a) boot loader
b) inefficient
b) bootstrap
c) costly
c) process control block
d) time taking FCB takes it all
c) the file cannot be extended
Answer: a d) the file cannot be opened
Answer: b
2. The file organization module knows about :
a) files
12. To solve the problem of external
b) logical blocks of files
fragmentation, ________ needs to be done
c) physical blocks of files
periodically.
d) all of the mentioned
a) compaction
b) check
Answer: d
c) formatting
d) replacing memory
3. Metadata includes :
Answer: a a) all of the file system structure
b) contents of files
c) both file system structure and contents of files
13. If too little space is allocated to a file
d) none of the mentioned
a) the file will not work
b) there will not be any space for the data, as the
Answer: c d) none of the mentioned
Answer: b
6. During compaction time, other normal system
operations _______ be permitted.
10. The major disadvantage with linked allocation
a) can
is that :
b) cannot
a) internal fragmentation
c) is
b) external fragmentation
d) none of the mentioned
c) there is no sequential access
d) there is only sequential access
Answer: b
Answer: d
7. When in contiguous allocation the space
cannot be extended easily : advertisement
a) the contents of the file have to be copied to a
new space, a larger hole 11. If a pointer is lost or damaged in a linked
b) the file gets destroyed allocation :
c) the file will get formatted and lost all its data a) the entire file could get damaged
b) only a part of the file would be affected Answer: a
c) there would not be any problems
d) none of the mentioned 2. If the extents are too large, then the problem
that comes in is :
Answer: a a) internal fragmentation
b) external fragmentation
c) starvation
12. FAT stands for :
d) all of the mentioned
a) File Attribute Transport
b) File Allocation Table
c) Fork At Time Answer: a
d) None of the mentioned
3. The FAT is used much as a _________
Answer: b a) stack
b) linked list
c) data
13. By using FAT, random access time is
d) pointer
__________
a) the same
b) increased Answer: b
c) decreased
d) not affected 4. A section of disk at the beginning of each
partition is set aside to contain the table in :
a) fat
Answer: c b) linked allocation
Operating System Questions & Answers – File
c) hashed allocation
System Implementation – Allocation Methods – 3
d) indexed allocation
This set of Operating System Puzzles focuses on
“File System Implementation – Allocation Answer: a
Methods – 3”.
1. A better way of contiguous allocation to extend 5. Contiguous allocation has two problems
the file size is : _________ and _________ that linked allocation
a) adding an extent (another chunk of contiguous solves.
space) a) external – fragmentation & size – declaration
b) adding an index table to the first contiguous b) internal – fragmentation & external –
block fragmentation
c) adding pointers into the first contiguous block c) size – declaration & internal – fragmentation
d) none of the mentioned d) memory – allocation & size – declaration
Answer: a address of the file in memory and calculate
immediately the disk address of the ith block and
read it directly.
6. Each _______ has its own index block.
a) partition 10. Consider a disk where blocks
b) address 2,3,4,5,8,9,10,11,12,13,17,18,25,26 and 27 are
c) file free and the rest of the blocks are allocated. Then
d) all of the mentioned the free space bitmap would be :
a) 10000110000001110011111100011111…
b) 110000110000001110011111100011111…
Answer: c
c) 01111001111110001100000011100000…
d) 001111001111110001100000011100000…
7. Indexed allocation _________ direct access.
a) supports
Answer: d
b) does not support
c) is not related to
d) none of the mentioned Operating System Questions & Answers – File
System Implementation – Performance
Answer: a
This set of Operating System Multiple Choice
Questions & Answers (MCQs) focuses on “File
8. The pointer overhead of indexed allocation is System Implementation – Performance”.
generally _________ the pointer overhead of
1. _______ tend to represent a major bottleneck
linked allocation.
in system performance.
a) less than
a) CPUs
b) equal to
b) Disks
c) greater than
c) Programs
d) keeps varying with
d) I/O
Answer: c
Answer: b
Answer: a
Explanation: We can easily keep the initial
Answer: b d) all of the mentioned
Answer: a
Answer: b
advertisement
4. Each set of operations for performing a specific
task is a _________ 8. All the changes that were done from a
a) program transaction that did not commit before the system
b) code crashed, have to be _________
c) transaction a) saved
d) all of the mentioned b) saved and the transaction redone
c) undone
d) none of the mentioned
Answer: c
Answer: a
Answer: b
Answer: c Answer: d
Answer: b
Answer: a
Operating System Questions & Answers – Disk
Scheduling – 1
7. The device-status table contains
This set of Operating System Multiple Choice
a) each I/O device type
Questions & Answers (MCQs) focuses on “Disk
b) each I/O device address
Scheduling – 1”.
c) each I/O device state
d) all of the mentioned 1. In _______ information is recorded
magnetically on platters.
Answer: d a) magnetic disks
b) electrical disks
c) assemblies
8. Which buffer holds the output for a device?
d) cylinders
a) spool
b) output
Answer: a Answer: d
2. The heads of the magnetic disk are attached to 6. When the head damages the magnetic surface,
a _____ that moves all the heads as a unit. it is known as _________
a) spindle a) disk crash
b) disk arm b) head crash
c) track c) magnetic damage
d) none of the mentioned d) all of the mentioned
Answer: b Answer: b
3. The set of tracks that are at one arm position 7. A floppy disk is designed to rotate
make up a ___________ ___________ as compared to a hard disk drive.
a) magnetic disks a) faster
b) electrical disks b) slower
c) assemblies c) at the same speed
d) cylinders d) none of the mentioned
Answer: d Answer: b
4. The time taken to move the disk arm to the 8. The host controller is :
desired cylinder is called the : a) controller built at the end of each disk
a) positioning time b) controller at the computer end of the bus
b) random access time c) all of the mentioned
c) seek time d) none of the mentioned
d) rotational latency
Answer: b
Answer: c
Answer: d
Operating System Questions & Answers – Disk
Scheduling – 2
4. Consider a disk queue with requests for I/O to
This set of Operating System online quiz focuses blocks on cylinders :
on “Disk Scheduling – 2”. 98 183 37 122 14 124 65 67
1. Whenever a process needs I/O to or from a Considering SSTF (shortest seek time first)
disk it issues a ______________ scheduling, the total number of head movements
a) system call to the CPU is, if the disk head is initially at 53 :
b) system call to the operating system a) 224
c) a special procedure b) 236
d) all of the mentioned c) 245
d) 240
Answer: b
Answer: b
Answer: c
Explanation: The farther a track is from the center advertisement
of the disk.
11. In the ______ algorithm, the disk arm goes as
8. SSTF algorithm, like SJF __________ of some far as the final request in each direction, then
requests. reverses direction immediately without going to
a) may cause starvation the end of the disk.
b) will cause starvation a) LOOK
c) does not cause starvation b) SCAN
d) causes aging c) C-SCAN
d) C-LOOK
Answer: a
Answer: a
9. In the ______ algorithm, the disk arm starts at Operating System Questions & Answers – Disk
one end of the disk and moves toward the other Management
end, servicing requests till the other end of the
This set of Operating System Multiple Choice
disk. At the other end, the direction is reversed
Questions & Answers (MCQs) focuses on “Disk
and servicing continues.
Management”.
a) LOOK
b) SCAN 1. The process of dividing a disk into sectors that
c) C-SCAN the disk controller can read and write, before a
d) C-LOOK disk can store data is known as :
a) partitioning
b) swap space creation
c) low-level formatting controllers and the contents of main memory, and
d) none of the mentioned then starts the operating system.
a) main
Answer: c b) bootloader
c) bootstrap
d) rom
2. The data structure for a sector typically
contains :
a) header Answer: c
b) data area
c) trailer 6. For most computers, the bootstrap is stored in
d) all of the mentioned ________
a) RAM
Answer: d b) ROM
c) Cache
d) Tertiary storage
3. The header and trailer of a sector contain
information used by the disk controller such as
Answer: b
_________ and _________
a) main section & disk identifier
b) error correcting codes (ECC) & sector number 7. A disk that has a boot partition is called a
c) sector number & main section _________
d) disk identifier & sector number a) start disk
b) end disk
Answer: b c) boot disk
d) all of the mentioned
Answer: d Answer: d
Answer: a Answer: c
Explanation: Other requests are allowed to be
processed by other disks.
9. The potential overuse of a single parity disk is
5. The overall I/O rate in RAID level 4 is : avoided in RAID level _______
a) low a) 3
b) very low b) 4
c) high c) 5
d) none of the mentioned d) all of the mentioned
Answer: c Answer: c
Explanation: All disks can be read in parallel.
10. RAID level 0+1 is used because, RAID level 0 1. A large number of disks in a system improves
provides ______ whereas RAID level 1 provides the rate at which data can be read or written :
________ a) if the disks are operated on sequentially
a) performance, redundancy b) if the disks are operated on selectively
b) performance, reliability c) if the disks are operated in parallel
c) redundancy, performance d) all of the mentioned
d) none of the mentioned
Answer: c
Answer: b
2. RAID stands for :
advertisement a) Redundant Allocation of Inexpensive Disks
11. If a disk fails in RAID level ___ rebuilding lost b) Redundant Array of Important Disks
data is easiest. c) Redundant Allocation of Independent Disks
a) 1 d) Redundant Array of Independent Disks
b) 2
c) 3 Answer: d
d) 4
3. If the mean time to failure of a single disk is
Answer: a 100,000 hours, then the mean time to failure of
Explanation: Data can be copied from another some disk in an array of 100 disks will be :
disk in raid level 1, for other raid levels all other
a) 100 hours
disks have to be accessed.
b) 10 days
12. Where performance and reliability are both c) 10 hours
important, RAID level ____ is used. d) 1000 hours
a) 0
b) 1 Answer: d
c) 2
d) 0+1
4. The solution to the problem of reliability is the
introduction of __________
Answer:d a) aging
Operating System Questions & Answers – RAID b) scheduling
Structure – 2 c) redundancy
d) disks
This set of Advanced Operating System
Questions and Answers focuses on “RAID
Structure – 2”. Answer: c
5. The technique of duplicating every disk is Answer: b
known as :
a) mirroring 9. RAID level ______ is also known as bit
b) shadowing interleaved parity organisation.
c) redundancy a) 0
d) all of the mentioned b) 1
c) 2
Answer: a d) 3
Answer: b
Answer: a
This set of Operating System Multiple Choice 5. Optical disks ______ magnetism.
Questions & Answers (MCQs) focuses on a) use
“Tertiary Storage”. b) do not use
c) may use
1. Tertiary storage is built with :
d) none of the mentioned
a) a lot of money
b) unremovable media
Answer: b
c) removable media
d) secondary storage
6. The phase change disk is coated with a
Answer: c material that can freeze into either _______ or
________ state.
a) crystalline, solid
2. Floppy disks are examples of :
b) ice, amorphous
a) primary storage
c) crystalline, liquid
b) secondary storage
d) crystalline, amorphous
c) tertiary storage
d) none of the mentioned
Answer: d
Answer: c
7. WORM stands for :
a) write only, read mandatory
3. A magneto-optic disk is :
b) write once, read many times
a) primary storage
c) write only once, read multiple
b) secondary storage
d) none of the mentioned
c) removable disk
d) none of the mentioned
Answer: b
Answer: c
8. A tape holds _______ data than optical or
magnetic disk cartridge.
4. The magneto-optic head flies ___________ the
a) lesser
disk surface than a magnetic disk head does.
b) more
a) much farther from
c) much lesser
b) much closer to
d) none of the mentioned This set of Operating System Multiple Choice
Questions & Answers (MCQs) focuses on
Answer: b “Protection – Access Matrix”.
Answer: b Answer: d
4. The protection domain of a process contains 8. For a domain _______ is a list of objects
a) object name together with the operation allowed on these
b) rights-set objects.
c) both object name and rights-set a) capability list
d) none of the mentioned b) access list
c) both capability and access list
Answer: c d) none of the mentioned
Answer: a Answer: a
Answer: b
Answer: a
Operating System Questions & Answers –
Protection – Memory Protection
7. Which one of the following is not an attack, but
This set of Operating System Multiple Choice
a search for vulnerabilities to attack?
Questions & Answers (MCQs) focuses on
a) denial of service
“Protection – Memory Protection”.
b) port scanning
c) memory access violation 1. What is true regarding ‘Fence’ ?
d) dumpster diving a) Its a method to confine users to one side of a
boundary
Answer: b b) It can protect Operating system from one user
c) It cannot protect users from each other
d) All of the mentioned
8. File virus attaches itself to the
a) source file
Answer: d
b) object file
c) executable file
d) all of the mentioned 2. What is not true regarding ‘Fence’ ?
a) It is implemented via hardware register
Answer: c b) It doesn’t protect users from each other
c) It good to protect OS from abusive users
d) Its implementation is unrestricted and can take
9. Multipartite viruses attack on
any amount of space in Operating system.
a) files
b) boot sector
Answer: d
c) memory
d) all of the mentioned
3. What is correct regarding ‘relocation’ w.r.t
Answer: d protecting memory ?
a) It is a process of taking a program as if it
began at address 0
10. In asymmetric encryption
b) It is a process of taking a program as if it
a) same key is used for encryption and decryption
began at address 0A
b) different keys are used encryption and
c) Fence cannot be used within relocation
decryption
process
c) no key is required for encryption and
d) All of the mentioned Answer: b
Answer: a Answer: a
6. Processes on the remote systems are 10. Internet provides _______ for remote login.
identified by a) telnet
a) host ID b) http
b) host name and identifier c) ftp
c) identifier d) RPC
d) process ID
Answer: a
Answer: b
Answer: a
Answer: a
Answer: d
Answer: b
Answer: a
6. What are characteristic of Network Operating
Systems ?
10. What are characteristics of computation
a) Users are aware of multiplicity of machines
migration ?
b) They are transparent
a) transfer data by entire file or immediate portion
c) They are simple to use
required
b) transfer the computation rather than the data c) Star
c) execute an entire process or parts of it at d) All of the mentioned
different sites
d) none of the mentioned Answer: d
Answer: c Answer: d
5. Which layer lies between transport layer and 9. In which OSI layer encryption and decryption
data link layer ? happens ?
a) Physical a) Application
b) Network b) Presentation
c) Application c) Transport
d) Session d) Data Link
Answer: b Answer: b
6. Which of the following is an application layer 10. What are important step followed when
service ? recovery from failure happens ?
a) Mail service a) Post repairing integration with main system
b) File transfer should happen smoothly and gracefully
c) Remote access b) Upon link failure both parties at end must not
d) All of the mentioned be notified
c) Fault recovery system must me adjusted
Answer: d d) Failures are logged systematically
Answer: a
7. What are different ways distributed may suffer
?
a) Failure of a link
Operating System Questions & Answers –
b) Failure of a site Distributed File System – 1
c) Loss of message
d) All of the mentioned This set of Operating System Multiple Choice
Questions & Answers (MCQs) focuses on
“Distributed File System – 1”.
Answer: d
1. What are the different ways in which clients
8. What are design issues in distributed system and servers are dispersed across machines ?
structure ? a) Servers may not run on dedicated machines
a) Scalability b) Servers and clients can be on same machines
b) Fault-tolerance c) Distribution cannot be interposed between a
c) Clustering OS and the file system
d) OS cannot be distributed with the file system a d) System service
part of that distribution
Answer: c
Answer: b
6. What are the different ways mounting of file
2. What are not the characteristics of a DFS ? system ?
a) login transparency and access transparency a) boot mounting
b) Files need not contain information about their b) auto mounting
physical location c) explicit mounting
c) No Multiplicity of users d) all of the mentioned
d) No Multiplicity if files
Answer: d
Answer: c
Answer: d Answer: a
5. Which is not a major components of file system 9. What are examples of state information ?
? a) opened files and their clients
a) Directory service b) file descriptors and file handles
b) Authorization service c) current file position pointers
c) Shadow service
d) all of the mentioned Answer: a
Answer: b Answer: d
2. What are the characteristics of stateless server 6. What is coherency of replicated data ?
? a) All replicas are identical at all times
a) Easier to implement b) Replicas are perceived as identical only at
b) They are not fault-tolerant upon client or server some points in time
failures c) Users always read the most recent data in the
c) They store all information file server replicas
d) They are redundant to keep data safe d) All of the mentioned
Answer: d
7. What are the three popular semantic modes ? c) The burden of coordinating file sharing is
a) Unix, Coherent & Session semantics ignored by the system
b) Unix, Transaction & Session semantics d) Easy to implement in a single processor
c) Coherent, Transaction & Session semantics system
d) Session, Coherent semantics
Answer: d
Answer: b
Answer: a Answer: a
4. Swap space exists in 8. Which algorithm chooses the page that has not
a) primary memory been used for the longest period of time
b) secondary memory whenever the page required to be replaced?
c) cpu a) first in first out algorithm
d) none of the mentioned b) additional reference bit algorithm
c) least recently used algorithm
Answer: b d) counting based page replacement algorithm
Answer: c
5. When a program tries to access a page that is
mapped in address space but not loaded in
physical memory, then 9. A process is thrashing if
a) segmentation fault occurs a) it is spending more time paging than executing
b) fatal error occurs b) it is spending less time paging than executing
c) page fault occurs c) page fault occurs
d) no error occurs d) swapping can not take place
Answer: c Answer: a
6. Effective access time is directly proportional to 10. Working set model for page replacement is
a) page-fault rate based on the assumption of
b) hit ratio a) modularity
c) memory access time b) locality
d) none of the mentioned c) globalization
d) random access
Answer: a
Answer: b
7. In FIFO page replacement algorithm, when a
page must be replaced
Operating System Questions & Answers –
a) oldest page is chosen Distributed File System – 2
b) newest page is chosen
c) random page is chosen
This set of JUnit Questions and Answers for Answer: a
Aptitude test focuses on “Distributed File System
– 2”. 5. What are characteristic of NFS protocol ?
1. What is a stateless file server ? a) Search for file within directory
a) It keeps tracks of states of different objects b) Read a set of directory entries
b) It maintains internally no state information at all c) Manipulate links and directories
c) It maintains some information in them d) All of the mentioned
d) None of the mentioned
Answer: d
Answer: b
6. What is coherency of replicated data ?
2. What are the characteristics of stateless server a) All replicas are identical at all times
? b) Replicas are perceived as identical only at
a) Easier to implement some points in time
b) They are not fault-tolerant upon client or server c) Users always read the most recent data in the
failures replicas
c) They store all information file server d) All of the mentioned
d) They are redundant to keep data safe
Answer: d
Answer: a
7. What are the three popular semantic modes ?
3. Implementation of a stateless file server must a) Unix, Coherent & Session semantics
not follow ? b) Unix, Transaction & Session semantics
a) Idempotency requirement c) Coherent, Transaction & Session semantics
b) Encryption of keys d) Session, Coherent semantics
c) File locking mechanism
d) Cache consistency Answer: b
Answer: b
Answer: d
Answer: b Answer: b
6. In distributed file system, _______ is mapping 10. Which one of the following is a distributed file
between logical and physical objects. system?
a) client interfacing a) andrew file system
b) naming b) network file system
c) migration c) novel network
d) heterogeneity d) all of the mentioned
Answer: b Answer: d
Answer : d Answer : a
8. Single coordinator approach has the following 12. Which are the two complementary deadlock-
advantages : prevention schemes using timestamps ?
a) Simple implementation a) The wait-die & wound-wait scheme
b) Simple deadlock handling b) The wait-n-watch scheme
c) bottleneck c) The wound-wait scheme
d) All of the mentioned d) The wait-wound & wound-wait scheme
Answer : d
Answer : a
Operating System Questions & Answers –
advertisement Distributed Synchronization
9. Single coordinator approach has the following This set of Operating System Multiple Choice
disadvantages : Questions & Answers (MCQs) focuses on
a) Bottleneck “Distributed Synchronization”.
b) Slow response
c) Deadlock 1. In distributed systems, a logical clock is
d) One request per second associated with
a) each instruction
b) each process
Answer : a
c) each register
d) none of the mentioned
10. What are the disadvantages of majority
protocol ?
Answer: b
a) Complicated implementation
b) Deadlock cannot occur easily
c) Bottleneck 2. If timestamps of two events are same, then the
d) All of the mentioned events are
a) concurrent
b) non-concurrent
Answer : a
c) monotonic
d) non-monotonic 6. In the token passing approach of distributed
systems, processes are organized in a ring
Answer: a structure
a) logically
b) physically
3. If a process is executing in its critical section
c) both logically and physically
a) any other process can also execute in its
d) none of the mentioned
critical section
b) no other process can execute in its critical
section Answer: a
c) one more process can execute in its critical
section 7. In distributed systems, transaction coordinator
d) none of the mentioned a) starts the execution of transaction
b) breaks the transaction into number of sub
Answer: b transactions
c) coordinates the termination of the transaction
d) all of the mentioned
4. A process can enter into its critical section
a) anytime
Answer: d
b) when it receives a reply message from its
parent process
c) when it receives a reply message from all other 8. In case of failure, a new transaction coordinator
processes in the system can be elected by
d) none of the mentioned a) bully algorithm
b) ring algorithm
Answer: c c) both bully and ring algorithm
d) none of the mentioned
Answer: b