Operating System (OS)

OS Questions and Answers Set 1

Questions 1 to 10
1. Which of the following can be said about a segmentation fault caused when a process is
active?
  It will recover from the fault transparently to the user, by moving the required page from the
secondary memory
  The fault’s cause may most likely be an error in programming
  It will not  abruptly terminate the process and a core image of the process will be saved for
further observations
  It will cause the process to go into the ‘blocked’ state
  It will most likely be caused by a hardware fault.
2. A common programming construct for implementing mutual exclusion which uses condition
variables is called
(a)  Semaphore                                      (b)  Deadlock                                         (c)  Monitor
(d)  Locking interrupts                             (e)  Threads.
3. Suppose requests have recently arrived for data on cylinders 25, 46, 12, and 3, in that order,
and that the read-write head is currently at cylinder 20.  If the disk scheduling policy is SSTF,
the outstanding requests will be serviced in the order
(a)  25, 46, 12, 3                                     (b)  25, 46, 3, 12                            (c)  3, 12, 25, 46
(d)  25, 12, 3, 46                                     (e)  12,3,25,46.
4. DMA stands for
(a)  Direct Management access               (b)  Direct memory access
(c)  Dual memory access                        (d)  Data memory access
(e)  Dual memory array.
5. Which of the following disk-scheduling methods is most likely to lead to starvation for requests
on inner or outer cylinders?
(a)  FCFS                (b)  SSTF                (c)  SCAN                (d)  C-SCAN            (e)  b-SCAN.
6. Which of the following is in correct order of size, smallest first?
(a)  Cylinder, track, sector                       (b)  Cylinder, sector, track                      
(c)  Sector, track, cylinder                       (d)  Sector, cylinder, track                      
(e)  Track, cylinder, sector.
7. A process that executes a READ instruction for a data record currently on disk will undergo a
process state transition from
(a)  Ready to blocked                                                            (b)  Running to blocked        (c) 
Blocked to ready
(d)  Blocked to running                            (e)  Terminated.
8. In a certain system, process A has just arrived at time 0, process B at time 3, and process C at
time 6.  A needs 5 seconds in the CPU, B 3 seconds, and C 1 second.  All processes are
totally CPU-bound and process-switching time is negligible, so that after 9 seconds all
processes have completed.  At what time does process B complete if the process-scheduling
algorithm is preemptive SJF and the quantum is 1 second?
(a)  6                       (b)  7                       (c)  8                       (d)  9                       (e)  10.
 9. If the value of a binary semaphore S is 0, and a process executes a WAIT instruction on S,
then
  S will remain zero and the process will proceed
  S will remain zero and the process will be placed on a queue
  S will become one and the process will proceed
  S will become one and the process will be placed on a queue
  S will become -1 and the process will not be placed on a queue.
10. The process of collecting fragments of available memory space into contiguous blocks by
moving programs and data in a computer's memory or disk is known as 
(a)  Compaction       (b)  Coalescing         (c)  Segmentation     (d)  Fragmentation    (e) 
Paging.

Answers

1. Answer : (b)
Reason:  It will  abruptly terminate the process and a core image of the process will be saved for further
observations.
2. Answer : (c)
Reason:  Monitor uses a condition variable for implementing mutual exclusion.
3. Answer : (d)
Reason:  Remaining all donot satisfy the SSTF policy.
4. Answer : (b)
Reason:  DMA stands for direct memory Acess.
5. Answer : (b)
Reason:  SSTF disk scheduling method is most likely to lead to starvation for requests on inner or outer
cylinders.
6. Answer : (c)
Reason:  Sector track and cylinder is the correct order of size.
7. Answer : (b)
Reason:  Running to blocked is the correct process state transition.
8. Answer : (d)
Reason:  In Preemptive SJF the process B complete in 9 seconds.
9. Answer : (b)
Reason:  According to the condition of semaphore s will remain zero and the process will be placed on a
quesue.
10. Answer : (a)
Reason:  Compaction is the process of collecting fragments of available memory space into contiguous
blocks by moving programs and data in a computer's memory or disk.

OS Questions and Answers Set 2

Operating System (OS)

 Questions 11 to 20
11. Which of the following controls all the computer resources and provides the base upon which
the application programs can be written?
(a)  Application Software                         (b)  C.P.U                (c)  Operating System
(d)  Bare Hardware                                  (e)  Device Drivers.
12. Which of the following system call loads a process into memory?
(a)  Load                  (b)  Create               (c)  Fork                  (d)  Execv                (e)  Copy.
13. Expand the term UNICS
Uniplexed Information Computing System
Unipoint Information Computing System
Uniplexed Instruction Computing System
Unipoint Instruction Computing System
Union  Instruction Common System.
14. Which of the following software layer is used between the kernel and the user computations in
the network O.S?
(a)  Local O.S                                        (b)  Network O.S      (c)  Global  O.S
(d)  Distributed O.S                                 (e)  Remote O.S.
15. Which of the following allows many users to share the computer simultaneously?
(a)  Time Sharing O.S                                                           (b)  Real Time O.S
(c)  Interactive O.S                                  (d)  Batch O.S         (e)  Network O.S.
16. If a program is under execution by CPU then we say the process is under
(a)  CPU Burst                                       (b)  Process                                           (c)  I/O Burst
(d)  Ready Queue                                   (e)  New State.
17. Each process is represented in the operating system by its own
(a)  Thread               (b)  PCB                  (c)  State                 (d)  Instructions        (e)  PCC.
18. The amount of time that a job waits in a ready queue for getting selected by CPU is called
(a)  Turn around time                                                             (b)  Waiting time                     (c) 
Completion time
(d)  Submission time                                                             (e)  Throughput.
19. The process of storing and restoring from PCB is called
(a)  Loading                                            (b)  Relocation         (c)  Dispatcher
(d)  Process                                           (e)  context switch.
20. Which of the following memory management scheme loads all pages of a program from disk
into main memory?
(a)  Paging                                             (b)  Demand paging
(c)  Segmentation                                   (d)  Segmentation with paging
(e)  Demand segmentation.

Answers

Answer
11. :  (c)
Reason : Operating system controls all the computer resources and provides the base upon which the
application programs can be written
Answer
12. :  (a)
Reason : Load system call loads a process into main memory
Answer
13. :  (a)
Reason : Uniplexed Information Computing System
Answer
14. :  (b)
Reason : Network Operating System is the software layer used between the kernel and the user
Answer
15. :  (a)
Reason : Timesharing Operating System allows many users to share the computer simultaneously
Answer
16. :  (a)
Reason : CPU burst
Answer
17. :  (b)
Reason : Each process is represented in the operating system by its own PCB
Answer
18. :  (b)
Reason:  The amount of time that a job waits in a ready queue for getting selected by CPU is called
Waiting time.
Answer
19. :  (e)
Reason :       The process of storing and restoring from PCB is called Context switch
Answer
20. :  (a)
Reason: Paging memory management scheme loads all pages of a program from disk into main memory.

OS Questions and Answers Set 2

Operating System (OS)

Questions 21 to 30
21. Which of the following page replacement algorithm use the technique of replace that page
which is not used in the near future?
(a)  LRU                  (b)  LFU                   (c)  ORA                  (d)  FIFO                 (e)  MFU.
22. The set of pages that a process is currently using is called as
(a)  Program                                           (b)  Page Group                      (c)  Working Group
(d)  Working Set                                     (e)  None of the above.
23. Which of the following  registers contains starting address of the program in the main
memory?
(a)  Address register                               (b)  Base register                                    (c)  GPR
(d)  Index register                                   (e)  Limit register.
24. The process of converting logical address into physical address is known as
(a)  Conversion                                       (b)  Displacement     (c)  Relocation
(d)  Transfer                                           (e)  None of the above.
25. In a segmentation  scheme the logical memory will be divided into
(a)  Pages               (b)  Frames              (c)  Blocks               (d)  Cells              (e)  Segments.
26. Which of the following area is used to store the O.S programs in the main memory?
(a)  User memory area                                                          (b)  Monitor memory area
(c)  Heap area                                        (d)  Stack area                        (e)  Data area.
27. In Unix which of the following system calls returns the meta data about a file?
 (a)  fstat                  (b)  mstat                (c)  Metacall            (d)  Sigabort             (e)  fork.
28. Information in the file is processed in order, one record after another. This mode of access is
called________.
(a)  Relative             (b)  Sequential         (c)  Direct                (d)  Index    (e)  Indexed-
sequential.
29. Which of the technique  is used to recover  the process from starvation situation?
(a)  Paging               (b)  Aging                (c)  Compaction       (d)  Starvation     (e)  Reduction.
30. Before we store data into a disk it must be divided into sectors and from where the disk
controller can read and write. This is known as________.
(a)  Low-level formatting                           (b)  Fragmenting                    (c)  High-level
formatting
(d)  Cleaning                                          (e)  Portioning a  disk.

Answers

Answer
21. :  (c)
Reason:  ORA page replacement algorithm uses the technique of replace that page which is not used in
the near future.
Answer
22. :  (d)
Reason:  The set of pages that a process is currently using is called Working set.
Answer
23. :  (b)
Reason :       Base register contains starting address of the program in the main memory
Answer
24. :  (c)
Reason:  The process of converting logical address into physical address is called relocation.
Answer
25. :  (e)
Reason: In a segmentation scheme the logical memory will be divided into Segments.
Answer
26. :  (b)
Reason:  The place where OS programs are stored in the main memory is called Monitor memory area.
Answer
27. :  (a)
Reason : fstat system cal returns the met data about a file
Answer
28. :  (b)
Reason : Sequential orer
Answer
29. :  (b)
Reason : Aging technique is used to recover the process from starvation
Answer
30. :  (d)
Reason : Low-level formatting or Physical formatting

OS Questions and Answers Set 3

Operating System (OS)

Questions 31 to 40
31. The disk controller can be told to replace each bad sector logically with one of the spare
sectors in the disk. This scheme is known as_______.
(a)  Sector sparing                                  (b)  Sector slipping   (c)  Forwarding
(d)  Back word replacing                          (e) Sector replace.
32. Controlling the access of programs, processes or users to the resources defined by the
system is known as_______.
(a)  Prevention                                        (b)  Security             (c)  Protection
(d)  Access stop                                     (e) Access right.
33. Which of the following symbol is used to represent the process vertex in a RAG?

34. Which of the following mechanism is used to achieve concurrency control?

(a)  Clusters                                           (b)  Triggers             (c)  Control access
(d)  Cursors                                            (e)  Locks.
35. Every process before starting execution should know what resources are allocated to it. This is
known as
(a)  Know-to-need                                   (b)  Need-to-Know               (c)  Know about what
(d)  Need-to-use                                     (e)  Know-to-use.
36. The ability to execute an operation on an object is known as
(a)  Access Right                                   (b)  Access Control              (c)  Domain Knowledge
(d)  Control Right                                    (e)  Protection.
37. The time required to move the disk head to the desired track is known as
(a)  Access Time                                    (b)  Track Time         (c)  Latency Time
(d)  Seek Time                                       (e)  Block Time.
38. A distributed system is a collection of processors that do not share_______.
(a)  CPU                  (b)  Memory             (c)  I/O devices         (d)  Network             (e)  File.
39. The name of the file does not reveal any hint of the file’s physical storage location is
called_____.
(a)  Location independence                      (b)  Protection          (c)  Location transparency
(d)  File migration                                   (e)  Inter-machine interface.
40. software entity running on one or more machines and providing a particular type of function to
a priori unknown clients is called________.
(a)  Client                (b)  Server                (c)  Service             (d)  Process   (e)  None of the
above.

Answers
Answer
31. :  (a)
Reason : The disk controller can be told to replace each bad sector logically with one of the spare sectors
in the disk is called Sector sparing
Answer
32. :  (c)
Reason:  Controlling the access of programs, processes or users to the resources defined by the system is
known as protection.
Answer
33. :  (b)
Reason :
Answer
34. :  (e)
Reason : Locks mechanism is used to achieve concurrency control
Answer
35. :  (b)
Reason : Every process before starting execution should know what resources are allocated to it is known
as Nee-to-know
Answer
36. :  (a)
Reason : The ability to execute an operation on an object is known as Access Right
Answer
37. :  (d)
Reason : The time required to move the disk head to the desired track is known as Seek Time
Answer
38. :  (b)
Reason:  A distributed system is a collection of processors that do not share Memory.
Answer
39. :  (c)
Reason : The name of the file does not reveal any hint of the Low-level formatting or Physical formatting h
file’s physical storage location is called Location Transparency
Answer
40. :  (c)
Reason : Software entity running on one or more machines and providing a particular type of function to a
point to a priori unknown clients is called Service