Dr.G.R.

Damodaran College of Science

(Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Re-accredited at the 'A' Grade Level by the NAAC and ISO
9001:2008 Certified
CRISL rated 'A' (TN) for MBA and MIB Programmes

I BCA [2013-2016]
Semester II
Core: Operating Systems – 206A
Multiple Choice Questions.

1. Which system software acts as interface between user of a computer and computer hardware?
A. Compiler.
B. Operating system.
C. Interpreter.
D. Editor.
ANSWER: B

2. Which of the following is an operating system?

A. DOT NET.
B. PYTHON.
C. JAVA.
D. UNIX.
ANSWER: D

3. Processes hold resources already allocated to them while waiting for additional resources is ____.
A. mutual exclusion condition.
B. non preemption condition.
C. wait for condition.
D. circular wait for condition.
ANSWER: C

4. A process is said to be ___ if it currently has the CPU.

A. ready.
B. running.
C. blocked.
D. dispatching.
ANSWER: B
5. Clients and servers come under ______ computing.
A. single user.
B. distributed.
C. graphical.
D. sequence.
ANSWER: B

6. The Strategies which are concerned determining where in main storage to place an incoming program are____.
A. fetch strategies.
B. replacement strategies.
C. placement strategies.
D. management strategies.
ANSWER: C

7. ________ Protocol is used for communicating over the internet.

A. FTTP.
B. HTTP.
C. TCP/IP.
D. DTP.
ANSWER: C

8. The amount of work performed per unit time is _______.

A. throughput time.
B. process time.
C. output time.
D. input time.
ANSWER: A

9. Spooling Systems are often prone to _____.

A. deadlock.
B. interrupt.
C. blocked state.
D. completed state.
ANSWER: A

10. The act of assigning a process to the first process to the first processor on the ready list is _______.
A. dispatcher.
B. block.
C. wakeup.
D. quantum.
ANSWER: A
11. ________ contains the value of which instruction the processor should execute next.
A. Program control block.
B. Program counter.
C. Program identification number.
D. Process descriptor.
ANSWER: B

12. An action performed by the OS to remove a process from a processor and replace it with another is _____.
A. interrupting.
B. control switching.
C. solaris.
D. running.
ANSWER: B

13. Technique to discover hardware status by repeatedly testing each device is _______.
A. piping.
B. polling.
C. dispatching.
D. interrupting.
ANSWER: B

14. The first operating system was initially implemented in _______.

A. 1950.
B. 1940.
C. 1960.
D. 1970.
ANSWER: A

15. ________ correspond to conditions such as overflows or breakpoints.

A. Fault.
B. Trap.
C. Abort.
D. Error.
ANSWER: A

16. ______ indicate that an error has occurred, either is hardware or as a result of a software instruction.
A. Interrupt.
B. Quantum.
C. Exception.
D. Dispatching.
ANSWER: C
17. A data structure that contains information that characterizes a process is _____.
A. PID.
B. PCB.
C. Process in execution.
D. Process priority.
ANSWER: D

18. Removing a process from a suspended state is called ____.

A. ready.
B. obtain.
C. resume.
D. finish.
ANSWER: C

19. A unit of time during which a process can execute before it is removed from the processor is _____.
A. spawn.
B. quartz.
C. quantum.
D. trap.
ANSWER: C

20. A situation in which a process or thread is waiting for an event that will never occur is ____.
A. interrupt.
B. deadlock.
C. checkpoint.
D. deadline.
ANSWER: B

21. Dijsktra’s Barker’s Algorithm is an example for ____.

A. deadlock prevention.
B. deadlock detection.
C. deadlock avoidance.
D. deadlock recovery.
ANSWER: C

22. Which of the following is not a condition for a deadlock to occur?

A. Mutual exclusion.
B. Wait-for.
C. Pre-emption.
D. Circular wait.
ANSWER: C
23. Thread operation that transitions its target from the waiting state to ready state is ___.
A. ready.
B. active.
C. wake.
D. sleep.
ANSWER: C

24. Process control block is also called as___________.

A. file descriptor.
B. process descriptor.
C. task.
D. child process.
ANSWER: B

25. It is possible to run programs larger than the main storage by using _______.
A. boundary register.
B. coalescing.
C. overlays.
D. garbage collection.
ANSWER: C

26. _______ contains the highest address used by the operating system.
A. Coalescing.
B. Boundary register.
C. Garbage collection.
D. Overlays.
ANSWER: B

27. In _____ several users simultaneously compete for system resources.

A. batch processing.
B. storage allocation.
C. single stream batch processing.
D. multi programming.
ANSWER: D

28. The technique of _______ involves moving all occupied areas of storage to one end or the other of main storage.
A. storage compaction.
B. storage swapping.
C. storage placement.
D. storage replacement.
ANSWER: A
29. An incoming job is placed in the hole in main storage in which it fits more tightly in ____ strategy.
A. best-fit.
B. first-fit.
C. worst-fit.
D. last-fit.
ANSWER: A

30. Storage compaction is also called as ____.

A. coalescing.
B. overlay.
C. garbage collection.
D. virtual storage.
ANSWER: C

31. The process of merging adjacent holes to form a single larger hole is called ____.
A. coalescing.
B. overlay.
C. garbage collection.
D. virtual storage.
ANSWER: A

32. In contiguous storage allocation multiprogramming systems, protection is often implemented with ____.
A. overlays.
B. garbage collection.
C. boundary registers.
D. compaction.
ANSWER: C

33. In ______ a program is divided into several blocks that are placed throughout the main storage.
A. contiguous allocation.
B. non contiguous allocation.
C. variable partition.
D. fixed partition.
ANSWER: B

34. In _____ page replacement strategy, we replace the page that has been in the system the longest.
A. FIFO.
B. LRU.
C. LFU.
D. NUR.
ANSWER: A
35. FIFO anomaly is also called as _____.
A. baden’s anomaly.
B. brethren’s anomaly.
C. bowel’s anomaly.
D. be lady’s anomaly.
ANSWER: D

36. A popular scheme for approximating LRU with little overhead is the _____ page replacement strategy.
A. FIFO.
B. LRU.
C. LFU.
D. NUR.
ANSWER: D

37. The referenced bit in not recently used page replacement is called ____
A. modified bit.
B. waiting bit.
C. accessed bit.
D. queued bit.
ANSWER: C

38. When a process first executes, the system loads into main memory the page that contains its first instruction. This is ___ paging.
A. local.
B. future.
C. anticipatory.
D. demand.
ANSWER: D

39. The ____ algorithm adjusts a process’s resident page set based on the frequency at which the process is faulting.
A. FIFO.
B. Optimal.
C. PFF.
D. RAND.
ANSWER: B

40. The time between page faults is called as _____ time.

A. fault.
B. interfault.
C. intrafault.
D. error.
ANSWER: B
41. Exercise paging activity causing low processor utilization is called ____.
A. crashing.
B. hashing.
C. thrashing.
D. holding.
ANSWER: C

42. The amount of internal fragmentation can be reduced by employing _____ page sizes.
A. smaller.
B. larger.
C. simple.
D. multiple.
ANSWER: A

43. The problems of determining when processors should be assigned & to which processes is called _____.
A. processor scheduling.
B. job scheduling.
C. high-level scheduling.
D. low-level scheduling.
ANSWER: A

44. A scheduling discipline is ___________ if once a process has given the CPU.
A. preemptive.
B. non-preemptive.
C. real time.
D. online
ANSWER: A

45. Keeping non-running programs is main storage involves______.

A. no overhead.
B. page faults.
C. overhead.
D. page default.
ANSWER: C

46. In _______ scheduling, certain jobs are scheduled to be completed by a specific time or deadline.
A. processor scheduling.
B. job scheduling.
C. deadline scheduling.
D. real time scheduling.
ANSWER: C
47. Processes are dispatched FIFO but are given a limited amount of CPU time called _____.
A. time–slice or quantum.
B. RR.
C. SJF.
D. HRN.
ANSWER: A

48. ________ is effective in timesharing environments in which the system needs to guarantee reasonable response times for interactive users.
A. RR.
B. FIFO.
C. HRN.
D. LIFO.
ANSWER: A

49. SJF stands for _________.

A. shortest job first.
B. shortest job for.
C. short job first.
D. short job for.
ANSWER: A

50. SJF is not useful in _____ environments in which reasonable response times much be guaranteed.
A. real time.
B. time sharing.
C. online.
D. multiprogramming.
ANSWER: B

51. SRT has ____ overhead than SJF.

A. lower.
B. medium.
C. higher.
D. equal.
ANSWER: C

52. Who developed HRN?

A. Flynn.
B. Klein-rock.
C. Brinch Hansen.
D. Berkley.
ANSWER: C
53. _______ is the system’s response time to the job if the job were to be initiated.
A. Time waiting.
B. Service time.
C. Time waiting + service time.
D. System time.
ANSWER: C

54. ________ referred to as an array processor.

A. SISD.
B. SIMD.
C. MISD.
D. MIMD.
ANSWER: B

55. ________ is a true parallel processor.

A. MIMD.
B. MISD.
C. SISD.
D. SIMD.
ANSWER: A

56. SISD machines process data form a _______ data stream.

A. single.
B. double.
C. medium.
D. multiple.
ANSWER: A

57. Data flow computers can perform many operations in _____.

A. parallel.
B. sequential.
C. linear.
D. non linear.
ANSWER: A

58. The time taken by the disk surface for data to rotate from its current position to the beginning of the read / write head is called ______.
A. seek time.
B. transmission time.
C. read /write latency time.
D. rotational latency time.
ANSWER: D
59. Fined – size unit of data, typically much larger than a byte is ________.
A. contiguous seconds.
B. sectors.
C. blocks.
D. tracks.
ANSWER: C

60. _____ are set of tracks that can be accessed by read / write head.
A. Cylinder.
B. Sector.
C. Boom.
D. Blocks.
ANSWER: A

61. ________ is recorded on a series of magnetic disks.

A. Spindle.
B. File.
C. Data
D. Symbols.
ANSWER: C

62. What is the pattern that has series of request in cylinder randomly distributed access disk surfaces?
A. Seek operating.
B. Memory.
C. Random seek pattern.
D. System.
ANSWER: C

63. Name the magnetic rotational secondary storage that provides persistent storage for random access to data.
A. Hot space disk.
B. Hard disk device.
C. Independent disks.
D. Dependent disks.
ANSWER: B

64. What is the average time a system spends waiting for a disk request to be serviced?
A. mean time to failure.
B. mean response time.
C. response time.
D. request time.
ANSWER: B
65. The smallest portion of a track that can be accessed by an I/O request is ___.
A. sector.
B. partition.
C. blocks.
D. tracks.
ANSWER: A

66. What is the path name, beginning at the root directory?

A. absolute path.
B. relative path.
C. correct path.
D. normal path.
ANSWER: A

67. What is the file property that places restrictions in which users can access file data?
A. Accessibility.
B. Location.
C. Volatility.
D. Activity.
ANSWER: A

68. What are the two types of file system organization?

A. Encryption and decryption.
B. Data hierarchical system and file system.
C. Both A and B.
D. Sequential and Direct.
ANSWER: D

69. Which is the directory entry that references a data file or directory that is typically located in a different directory?
A. Hard disk.
B. Soft link.
C. Link.
D. Soft disk.
ANSWER: C

70. The file descriptor is also called as ______.

A. File attributes.
B. File server.
C. Access control matrix.
D. File control block.
ANSWER: D
71. Which is not a file organization schemes?
A. Partitioned.
B. Direct.
C. Sequential.
D. Hierarchical.
ANSWER: D

72. What is called as indexed non-contiguous allocation technique?

A. Chaining.
B. Check point.
C. Contiguous chaining.
D. Non contiguous chaining.
ANSWER: A

73. __________ is the mechanisms for files to be stored, to be referenced, shared and secured.
A. File reorganization.
B. File integrity mechanism.
C. File management.
D. File system.
ANSWER: C

74. Which is the table that stores pointers to file data blocks in Microsoft’s FAT file system?
A. Open file table.
B. File allocation table.
C. File reallocation table.
D. Close file table.
ANSWER: B

75. The first optical disks were _____________ devices.

A. WORM.
B. ROM.
C. RAM.
D. PROM
ANSWER: A

76. ___________ strategies are concerned with determining which piece of program or data to displace to make room for incoming programs.
A. Fetch.
B. Replacement.
C. Placement.
D. Demand fetch.
ANSWER: B
77. The default shell in the Berkeley version of UNIX is____.
A. korn shell.
B. C shell.
C. bourne shell.
D. K shell.
ANSWER: B

78. Command interpreter of UNIX operating system is _____ .

A. the shell.
B. the structure.
C. the kernel.
D. the signal.
ANSWER: A

79. The UNIX command which is used to insert text or new line is ____.
A. x.
B. o.
C. a.
D. i.
ANSWER: D

80. Bourne shell is developed by _____.

A. steve bourne.
B. bill joy.
C. david korn.
D. james gosling.
ANSWER: A

81. _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory.
A. Translation look aside buffer.
B. Inverse page table.
C. Segmented page table.
D. All the above.
ANSWER: A

82. A program at the time of executing is called ________.

A. dynamic program.
B. static program.
C. binded Program.
D. a process.
ANSWER: D
83. _________ page replacement algorithm suffers from Belady's anamoly.
A. LRU.
B. MRU.
C. FIFO.
D. LIFO.
ANSWER: C

84. A binary semaphore _____.

A. has the value one or zero.
B. is essential to binary computers.
C. is used only for synchronization.
D. is used only for mutual exclusion.
ANSWER: A

85. The kernel keeps track of the state of each task by using a data structure called ______.
A. process control block.
B. user control block.
C. memory control block.
D. memory.
ANSWER: A

86. Virtual memory is __________.

A. an extremely large main memory.
B. an extremely large secondary memory.
C. an illusion of extremely large main memory.
D. a type of memory used in super computers.
ANSWER: C

87. Virtual Memory is commonly implemented by __________.

A. segmentation.
B. swapping.
C. demand Paging.
D. demand line.
ANSWER: C

88. Process State is a part of ______.

A. process control block.
B. inode.
C. file allocation table.
D. file reallocation table.
ANSWER: A
89. ___________ begins at the root and follows a path down to the specified file.
A. Relative path name.
B. Absolute path name.
C. Standalone name.
D. Standalone sequence.
ANSWER: B

90. The Hardware mechanism that enables a device to notify the CPU is called __________.
A. polling.
B. interrupt.
C. system Call.
D. system request.
ANSWER: B

91. The Vi editor has _________ modes

A. One.
B. Two.
C. Three.
D. Zero.
ANSWER: B

92. What is a shell?

A. It is a hardware component.
B. It is a command interpreter.
C. It is a part in compiler.
D. It is a tool in CPU scheduling.
ANSWER: B

93. Which of the following will determine the choice of systems software for your computer?
A. Is the applications software you want to use compatible with it?
B. Is it expensive?
C. Is it compatible with your hardware?
D. Both A and C.
ANSWER: D

94. The removal of process from active contention of CPU and reintroduce them into memory later is known as ____________.
A. interrupt.
B. swapping.
C. signal.
D. thread.
ANSWER: B
95. A process said to be in ___________ state if it was waiting for an event that will never occur.
A. safe.
B. unsafe.
C. starvation.
D. dead lock.
ANSWER: D

96. Super computers typically employ _______.

A. real time Operating system.
B. multiprocessors OS.
C. desktop OS.
D. desktop and palmtop OS.
ANSWER: B

97. Which of the following is contained in Process Control Block (PCB)?

A. Process Number.
B. List of Open files.
C. Memory Limits.
D. All of the Above
ANSWER: D

98. Which of the following is a criterion to evaluate a scheduling algorithm?

A. CPU Utilization: Keep CPU utilization as high as possible.
B. Throughput: number of processes completed per unit time.
C. Waiting Time: Amount of time spent ready to run but not running.
D. All of the above.
ANSWER: D

99. SISD stands for ___________.

A. single instruction stream, single data stream.
B. single information stream, single data stream.
C. single instruction stream, single dynamic stream.
D. single information stream, single dynamic stream.
ANSWER: A

100. The primary job of the operating system of a computer is to ________.

A. command resources.
B. manage resources.
C. provide utilities.
D. be user friendly
ANSWER: B
101. A __________ is the software that manages the time of a microprocessor to ensure that all time critical events are processed as efficiently as possible.
A. kernel.
B. shell.
C. processor.
D. device driver.
ANSWER: A

102. The vi editor stands for___________.

A. Visual editor.
B. viso.
C. Winrunner.
D. None.
ANSWER: A

103. Expand PCB.

A. Program Control Block.
B. Process Control Block.
C. Process Communication Block.
D. Process Common Block.
ANSWER: B

104. CPU performance is measured through ________.

A. throughput.
B. mhz.
C. flaps.
D. flips.
ANSWER: A

105. _______kind of operating systems pays more attention on the meeting of the time limits.
A. distributed.
B. network.
C. real time.
D. online.
ANSWER: C

106. Inter Process Communication can be done through __________.

A. mails.
B. messages.
C. system calls.
D. traps.
ANSWER: B
107. Counting semaphores is also called as __________.
A. time-sharing.
B. binary semaphore.
C. mutual exclusion.
D. general semaphores.
ANSWER: D

108. Real time systems are ________.

A. primarily used on mainframe computers.
B. used for monitoring events as they occur.
C. used for program development.
D. used for real time interactive users.
ANSWER: B

109. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.
A. FCFS scheduling algorithm.
B. round robin scheduling algorithm.
C. shortest job - first scheduling algorithm.
D. shortest job - last scheduling algorithm
ANSWER: C

110. In ______ operating system, the response time is very critical.

A. multitasking.
B. batch.
C. online.
D. real-time.
ANSWER: D

111. Which of the following is not advantage of multiprogramming?

A. Increased throughput.
B. Shorter response time.
C. Decreased operating system overhead.
D. Ability to assign priorities to jobs.
ANSWER: C

112. Cryptography technique is used in ________.

A. polling.
B. job scheduling.
C. protection.
D. file management.
ANSWER: C
113. Identify the odd thing in the services of operating system.
A. accounting.
B. protection.
C. error detection and correction.
D. dead lock handling.
ANSWER: C

114. Which file system does Windows 95 typically use?

A. FAT16 and FAT12.
B. FAT32 and FAT16.
C. NTFS.
D. FAT16, FAT32,FAT12.
ANSWER: A

115. The time taken by the disk arm to locate the specific address of a sector for getting information is called __________.
A. rotational latency.
B. seek time.
C. search time.
D. response time.
ANSWER: B

116. In UNIX, KSH stands for _________Shell.

A. C.
B. Korn.
C. Bourne.
D. both A& B.
ANSWER: B

117. FCFS stands for______.

A. First come first served.
B. First come fetch served.
C. First coming first serve.
D. First come first scan
ANSWER: A

118. The problem of fragmentation arises in ________.

A. static storage allocation.
B. stack allocation storage
C. stack allocation with dynamic binding.
D. heap allocation.
ANSWER: D
119. Distributed OS works on the ________ principle.
A. file foundation.
B. single system image.
C. multi system image.
D. networking image.
ANSWER: B

120. Information about a process is maintained in a _________.

A. stack.
B. translation look aside buffer.
C. process control block.
D. program control block.
ANSWER: C

121. Which of the following memory allocation scheme suffers from external fragmentation?
A. segmentation
B. pure demand paging.
C. swapping.
D. paging.
ANSWER: A

122. Unix Operating System is a __________.

A. time sharing operating system.
B. multi-user operating system.
C. multi-tasking operating system.
D. real time operating system
ANSWER: D

123. The time between submission of a job and the return of its results is ___ time.
A. saved.
B. waiting.
C. sharing.
D. turn around.
ANSWER: D

124. Which of the following is crucial time while accessing data on the disk?
A. seek time.
B. rotational time.
C. transmission time.
D. waiting time.
ANSWER: A
125. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of
loading is called _________ .
A. static loading.
B. dynamic loading.
C. dynamic linking
D. overlays.
ANSWER: C

126. The file handle 1 indicates ____.

A. standard input device.
B. standard output device.
C. standard error device.
D. standard input and output device.
ANSWER: B

127. A _____ is a program that processes input data to produce output data directed to some file.
A. filter.
B. setuid.
C. inode.
D. pipe.
ANSWER: A

128. The _____ file is used to specify the OS of hardware device changes to additional hardware.
A. CONFIG.SYS.
B. IO.SYS.
C. MSDOS.SYS.
D. All the above.
ANSWER: A

129. What is size allocated for directories in MS DOS systems?

A. 8 bytes.
B. 16 bytes.
C. 32 bytes.
D. 64 bytes.
ANSWER: C

130. Which is the least level partition of disk?

A. Clusters.
B. Sectors.
C. Slides.
D. Tracks.
ANSWER: B
131. What is the full form of FAT?
A. File Allot Table.
B. File Allocation Tab.
C. File Allied Table.
D. File Allocation Table.
ANSWER: D

132. The Sun OS provides UNIX System ________ to control access to shared resources.
A. pipes.
B. messages.
C. signals.
D. semaphores.
ANSWER: D

133. An array of ______ is used to define the file in the file system.
A. mount.
B. inode.
C. pipe.
D. setuid.
ANSWER: B

134. The system call _______ creates a new child process from the parent process.
A. trap.
B. vfork.
C. fork.
D. copy.
ANSWER: C

135. When a system call return -1, _______.

A. if an error occurs.
B. if execution is successful.
C. if execution is incomplete.
D. if an interrupt occurs.
ANSWER: A

136. What is the commercial version of UNIX system announced by Microsoft?

A. USENIX.
B. MINUX.
C. XENIX.
D. COMMIX.
ANSWER: C
137. UNIX was designed for the development of ________.
A. operating system.
B. multics system.
C. file system.
D. memory system.
ANSWER: B

138. Which one of the following is not a characteristic of a file system?

A. File management.
B. File integrity mechanism.
C. File access methods.
D. File sizing.
ANSWER: D

139. ___________ loses their content when power is turned off or when the power supply is interrupted.
A. ROM.
B. Both A & D.
C. file.
D. RAM.
ANSWER: D

140. In sequential file organization, the records are placed in _______ order.
A. random.
B. physical.
C. index block.
D. logical sequential.
ANSWER: B

141. SSTF stands for _________.

A. shortest seek time first.
B. short short time file.
C. sequential seek time first .
D. none.
ANSWER: A

142. The symbolic name is _________.

A. path name.
B. device independent name.
C. dependent time.
D. independent time.
ANSWER: B
143. _________ is a technique that enables us to read the data unit’s original form.
A. Encryption.
B. Decryption.
C. Allocation.
D. Reallocation.
ANSWER: B

144. What is the file property that places restrictions in which users can access file data?
A. Accessibility.
B. Location.
C. Volatility.
D. Activity.
ANSWER: A

145. Disk that stores files in discontinuous blocks as the result of file creation is ____.
A. hard disk.
B. hot space disk.
C. fragmented disk.
D. defragmented disk.
ANSWER: C

146. Which reduces unfairness and variance of response time as compare to SSTF?
A. SCAN disk scheduling.
B. Look disk scheduling.
C. Disk scheduling.
D. Disk processing.
ANSWER: A

147. A _______ is a communication path, consisting of a FIFO queue of bytes between two processes.
A. pipe line.
B. pipe.
C. sockets.
D. filters.
ANSWER: B

148. ________ are software mechanism similar to hardware interrupts.

A. Signals.
B. Signal handler.
C. Sigblock.
D. Sigset mask.
ANSWER: A
149. The Sun OS provides UNIX System ________ to control access to shared resources.
A. pipes.
B. messages.
C. signals.
D. semaphores.
ANSWER: D

150. The block locator field 11 contains______________.

A. direct block address.
B. indirect block address.
C. double indirect block address.
D. triple indirect block address.
ANSWER: C

Staff Name
KAVITHA.K.