TRUE or FALSE

1. File & directory permissions in Linux are assigned by numerically only

FALSE

2. File is an abstract data type

TRUE

3. Bootstrap program is known as firmware

TRUE

4. Network File System (NFS) is a common distributed file-sharing method

TRUE

5. Linux terminal is case-sensitive

TRUE

6. Most of the mordern operating systems today are the hybrid systems

TRUE

7. When a resource is released by a process, assignment edge reconverts to a request edge

FALSE

8. Kernel is the most important part of every operating system

TRUE

9. A thread is also called a Heavy Weight Process (HWP)

FALSE

10. Linux is the best-known and often-used open-source operating system

TRUE

11. Thread to be executed is target thread

FALSE

12. Pthread API is OS-independent

TRUE
13. Claim edge converts to request edge when a process requests a resource

TRUE

14. A process is a program in execution

TRUE

15. In Linux, ASCII text file can be saved without any extension

TRUE

16. With virtualization software, computer users can work with 2 operating systems simultaneously

TRUE

17. If a deadlock is detected, operating system should always kill the process in the deadlock

FALSE

18. Logical file system manages metadata information

TRUE

19. Device driver controls the logical device

FALSE

20. Ubuntu OS is developed based on Linux kernel

TRUE

21. A file system must be mounted before it can be accessed

TRUE
 ALL

1. What is the drawback of banker’s algorithm?

d. All of the mentioned

2. To ensure that the hold and wait condition never occurs in the system, it must be ensured that

________

d. all of the mentioned

3. What is operating system?

c. All of the choices

4. Which operation is performed by an interrupt handler?

a. All of the mentioned

5. The data structures available in the Banker’s algorithm are ____________

b. All of the mentioned

6. The disadvantages of "Compile and Go" loading scheme is (are)

c. all of the choices

7. The switching of the CPU from one process or thread to another is called

c. All of the mentioned

8. Which of the following condition is required for a deadlock to be possible?

a. All of the mentioned

9. The function(s) of file system is (are)

d. all of the choices

10. Advantage(s) of using assembly language rather than machine language is (are):

c. all of the choices

11. The function(s) of the Storage Assignment is (are)

d. all of the choices

12. For a deadlock to arise, which of the following conditions must hold simultaneously?
c. All of the mentioned

13. Which of the following command is used to create file in Linux?

a. all of the choices are correct

14. What does stub do?

b. all of the mentioned

15. How can you add Amit, a new user, to your system?

c. All of the choices

16. The process to be aborted is chosen on the basis of the following factors?

c. all of the mentioned

17. The advantage(s) inherent to using high level languages is (are)

d. All of the choices

18. Which of the following are(is) Language Processor(s)

a. assembles

b. compilers

c. all of the choices

d. interpreters

19. Which one of the following error will be handle by the operating system?

c. all of the choices

20. Poor response times are caused by

a. Any of the choices

21. Which of the following is characteristic of an operating system?

a. all of the choices

22. Which of the following command(s) is/are used to reboot a Linux system?

b. all options are correct

23. The function(s) performed by the paging software is (are)

a. all of the choices

DEF

1. Virtual memory is

b. used in all major commercial operating systems

2. A linker

c. creates a load module

3. Paging

c. is a method of memory allocation by which the program is subdivided into equal portions, or pages

and core is subdivided into equal portions or blocks.

4. Multiprogramming

d. allows multiple programs to reside in separate areas of core at the time.

5. Scheduling is

d. allowing jobs to use the processor

6. in CPU Scheduling, 'aging' is

a. increasing the priority of jobs to ensure termination in a finite time

7. Turnaround time is

b. the total time from the completion till the submission of a process

8. Trojan-Horse programs

c. are legitimate programs that allow unauthorized access

9. System maintenance

a. is necessary on all systems, regardless of how good

10. Swapping

a. allows each program in turn to use the memory

 11. Multiprogramming systems

c. execute more jobs in the same time period

12. Assembler is

a. a program that automate the translation of assembly language into machine language.

13. Object code

b. must be "loaded" before execution

14. Data encryption

b. is mostly used by financial networks

15. Bug means

d. A logical error in a program

16. A Processor

a. is a device that performs a sequence of operations specified by instructions in memory.

17. The dispatcher

d. actually schedules the tasks into the processor

18. Addressing modes

a. are variations in the use of fundamental addressing structures, or some associated actions which are

related to addressing.

19. The instruction register

a. is a group of electrical circuits (hardware), that performs the intent of instructions fetched from

memory.

20. Assembler language

b. is a mnemonic form of machine language

21. Dispatch latency is :

a. the time to stop one process and start running another one

22. Scheduling is :
a. allowing a job to use the processor

23. What is a reusable resource?

a. A resource that can be used by one process at a time and is not depleted by that use

24. What is an ISR?

a. Interrupt Service Routine

25. An incremental backup

b. saves only files that have recently changed

26. What is the full form of RMI?

b. Remote Method Invocation

27. A program

c. is a sequence of instructions

28. The command interpreter

a. is usually the primary user interface

29. Page-map table is

c. Used for address translation

30. Complex scheduling algorithms :

a. are very appropriate for very large computers

31. Seeks analysis

b. is used for analyzing device busy problems

32. What is a trap/exception?

b. software generated interrupt caused by an error

33. Memory management is :

d. critical for even the simplest operating systems

34. Virtual Memory

d. consists of those addresses that may be generated by a processor during execution of a

computation.

35. The FIFO algorithm

d. executes first the job that first entered the queue

36. The physical layer of a network

b. defines the electrical characteristics of signals passed between the computer and communication

37. Scissoring enables

d. a part of data to be displayed

38. What is an interrupt vector?

b. It is an address that is indexed to an interrupt handler

 LINUX

1. In Linux, what command is used to remove files?

c. rm

2. In Linux, which command is used to list all the files in your current directory (including

hidden)?

b. ls -a

3. Which is the core of the Linux operating system?

d. Kernel

4. In Linux, which command is used see the list of users who are currently logged-in?

a. login

5. In Linux, which among the following interacts directly with system hardware?

c. Kernel

6. In Linux, what command is used with vi editor to delete a single character?

c. x

7. Which directory in Linux contains all the config file of the system?

b. /etc

8. In Linux, wtmp and utmp files contain:

d. User login-logout log

 9. In Linux, which of the following command is used to know last shutdown/reboot date and

time?

c. last

10. In Linux, to the response time and throughput, the kernel minimizes the frequency of disk

access increase by keeping a pool of internal data buffer called

a. Buffer cache

11. In Linux, what file specifies the order in which to use specified name services?

c. /etc/nsswitch.conf

12. In Linux, what command is used to remove the directory?

c. rmdir

13. Which command is/are used to remove directory in Linux?

a. rmdir or rm -r

14. Which of the following OS is not based on Linux?

d. BSD

15. Which of the following command can be used as an alternative to echo command in Linux?

c. printf

16. In Linux, what command is used to count the total number of lines, words, and characters

contained in a file?

a. wc

17. In Linux environment, at start of process execution, STDOUT & STDERR

c. Point to current terminal device

18. Which command is used to get the kernel version in Linux?

c. uname – r

19. In Linux, which combination of keys is used to exit from terminal?

d. Ctrl + d
 20. Which command is used to change password of your Linux system?

d. passwd

1. The advantage of a command processor running only built-in commands is

d. the command set being common across different hardware configurations

2. The term 'polling' in a computer means a process by which a computer system

c. inquires to see if a terminal has any transaction to send

3. The principle of locality of reference justifies the use of

b. cache memory

4. Which, of the following, is true for testing and debugging?

c. Testing checks for logical errors in the programs, while debugging is a process of correcting those

errors in the program

5. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process

doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m + n. In this

setup, deadlock ____________

a. can never occur

6. A disk scheduling algorithm in an operating system causes the disk arm to move back and

forth across the disk surface in order to service all requests in its path. This is a

a. Scan

7. Those processes should be aborted on occurrence of a deadlock, the termination of which?

a. incurs minimum cost

 8. The strategy of making processes that are logically runnable to be temporarily suspended is

called

b. Preemptive scheduling

9. There are 10 different processes running on a workstation. Idle processes are waiting for an

input event in the input queue. Busy processes are scheduled with the Round-Robin time

sharing method. Which out of the following quantum times is the best value ?

c. tQ = 15ms

10. What is the solution to starvation?

a. the number of rollbacks must be included in the cost factor

11. The two steps of a process execution are

d. CPU & I/O Burst

12. In an absolute loading scheme, which loader function is accomplished by loader

a. Loading

13. To differentiate the many network services a system supports ______ are used.

d. Ports

14. With multiprogramming, _____ is used productively.

a. time

15. Round robin scheduling falls under the category of

c. Preemptive scheduling

16. A translator is best described as

c. a system software

17. The circular wait condition can be prevented by ____________.

c. defining a linear ordering of resource types

18. Which one of the following is the deadlock avoidance algorithm?

a. banker’s algorithm
 19. The most common security failure is

b. carelessness by users

20. A partitioned data set is most used for

b. a program or source library

21. A development strategy whereby the executive control modules of a system are coded and

tested first, is known as

b. Top-down development

22. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process

may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be

deadlock free is?

a. 2

23. For a Hold and wait condition to prevail ____________

a. A process must be holding at least one resource and waiting to acquire additional resources that are

being held by other processes

24. The number of resources requested by a process ____________

a. must not exceed the total number of resources available in the system

25. Which of the following software types is used to simplify using systems software?

c. timesharing

26. How does the software trigger an interrupt?

d. Executing a special operation called system call

27. What is the name given to all the programs inside the computer with makes it usable?

d. System software

28. The state transition initiated by the user process itself in an operating system is

b. block

29. Which of following is/are the advantage(s) of modular programming?

b. The program is much easier to change

30. In multilevel feedback scheduling algorithm

a. a process can move to a different classified ready queue

31. A task in a blocked state

c. is waiting for same temporarily unavailable resources

32. Which of the following filename extension suggests that the file is a backup copy of another

file?

d. BAK

33. A state is safe, if ____________

c. the system can allocate resources to each process in some order and still avoid a deadlock

34. By operating system, the resource management can be done via

b. both time and space division multiplexing

35. What is the purpose of 'touch' command?

b. It creates a new empty file

36. Which one of the following is not true?

d. kernel is made of various modules which can not be loaded in running operating system

37. A system has 12 magnetic tape drives and 3 processes P0, P1, and P2. Process P0 requires 10

tape drives, P1 requires 4 and P2 requires 9 tape drives.

Process
P0
P1
P2
Maximum needs (process-wise P0 through P2 top to bottom)
10
4
9
Currently allocated (process-wise)
 5
2
2
Which of the following sequence is a safe sequence?
d. P1, P0, P2

38. Which of the following program is not a utility?

c. Spooler

39. Which of the following statements is not true about the FORTRAN language?

a. A FORTRAN program, written for the IBM-PC, is totally different from a FORTRAN program written

for execution on the SUN machine

40. A compiler for a high-level language that runs on one machine and produces code for a

different machine is called is

d. cross compiler

41. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units

then, deadlock ____________

c. can never occur

42. The main function of the dispatcher (the portion of the process scheduler) is

a. assigning ready process to the CPU

43. The primary purpose of an operating system is to

d. Make computer easier to use

44. Which of the following capabilities is required for a system program to execute more than one

program at a time?

a. multitasking

45. If the wait for graph contains a cycle ____________

d. then a deadlock exists

46. The FCFS algorithm is particularly troublesome for ____________

c. multiprogramming systems

47. The working set theory of programming behaviour of processes running within an operating

system involves

c. the collection of pages that a process accesses

48. Information in a memory that is no longer valid or wanted is known as

b. garbage

49. A system program that combines the separately compiled modules of a program into a form

suitable for execution

c. linking loader

50. In which of the storage placement strategies a program is placed in the largest available hole

in the main memory?

a. worst fit

51. With round robin, scheduling algorithm in a time shared system

c. uses very large time slices converts it into First come First served scheduling algorithm

52. Preemptive Shortest Job First scheduling is sometimes called :

a. SRTN scheduling – Shortest Remaining Time Next

53. In the layered approach of Operating Systems __________

b. Highest Layer(N) is the User interface

54. The main function of the command interpreter is

b. to get and execute the next user-specified command

55. Which of the following addressing modes, facilitates access to an operand whose location is

defined relative to the beginning of the data structure in which it appears?

a. index

56. The FIFO algorithm

c. executes first the job that first entered the queue

 57. The most common systems security method is

c. passwords

58. Solaris is the name of a flavor of UNIX from

c. Sun Microsystems

59. A system with 5 processes P0 through P4 and three resource types A, B, C have A with 10

instances, B with 5 instances, and C with 7 instances. At time t0, the following snapshot has

been taken

Process
P0
P1
P2
P3
P4
Allocation (process-wise P0 through P4 top TO bottom)
A B C
0 1 0
2 0 0
3 0 2
2 1 1
0 0 2
MAX (process-wise P0 through P4 top TO bottom)
A B C
7 5 3
3 2 2
9 0 2
2 2 2
4 3 3
Available
A B C
3 3 2
The sequence <P1, P3, P4, P2, P0> leads the system to ____________
b. a safe state

60. The real difficulty with SJF in short term scheduling is

a. knowing the length of the next CPU request

61. What is the disadvantage of invoking the detection algorithm for every request?

b. considerable overhead in computation time

62. A hardware device that is capable of executing a sequence of instructions, is known as

a. Processor

63. The processes that are residing in main memory and are ready and waiting to execute are kept

on a list called

a. ready queue

64. Which, of the following checks, cannot be carried out on the input data to a system?

a. Syntax check

65. If the resources are always preempted from the same process __________ can occur.

d. starvation

66. With MS-DOS which command will divide the surface of the blank floppy disk into sectors

and assign a unique address to each one?

a. FORMAT command

67. If no cycle exists in the resource allocation graph ____________

a. then the system will be in a safe state

68. If you want to execute more than one program at a time, the systems software you are using

must be capable of

a. multitasking

69. The higher versions of the operating systems are so written that programs designed for earlier

versions can still be run. What is it called?

d. Upward compatibility
 70. Which one of the following can not be scheduled by the kernel?

b. user level thread

71. The interval from the time of submission of a process to the time of completion is termed as

c. turnaround time

72. The CPU, after receiving an interrupt from an I/O device

a. branches off to the interrupt service routine after completion of the current instruction

73. For an effective operating system, when to check for deadlock?

c. every time a resource request is made at fixed time intervals

74. The content of the matrix Need is ____________

c. Max – Allocation

75. All unsafe states are ____________

c. not deadlocks

76. The system calls in UNIX is written using which language

c. C

77. The resource allocation graph is not applicable to a resource allocation system ____________

b. with multiple instances of each resource type

78. Which of the following system program forgoes the production of object code to generate

absolute machine code and load it into the physical main storage location from which it will

be executed immediately upon completion of the assembly?

b. load-and-go assembler

79. Each request requires that the system consider the _____________ to decide whether the

current request can be satisfied or must wait to avoid a future possible deadlock.

d. resources currently available

80. The operating system of a computer serves as a software interface between the user and

c. hardware
 81. System programs such as Compilers are designed so that they are

d. reenterable

82. To _______ to a safe state, the system needs to keep more information about the states of

processes.

a. roll back the process

83. Which of the following is not applications software?

c. UNIX

84. Which of the following might be used to convert high-level language instructions into

machine language?

b. an interpreter

85. Which is a permanent database in the general model of compiler?

b. Terminal Table

86. To resolve the problem of data representation on different systems RPCs define ___________

c. machine-independent representation of data

87. Under multiprograming, turnaround time for short jobs is usually _____ and that for long jobs

is slightly _____.

c. shortened; lengthened

88. The principles of structured programming forbid the use of

b. GOTO

89. Cost factors for process termination include ____________

d. Amount of time a deadlocked process has thus far consumed during its execution

90. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.

b. first come, first served

91. The request and release of resources are ___________

a. system calls
 92. Which of the following is not true about the memory management?

b. virtual memory is used only in multi-user systems

93. Access time is the highest in the case of

a. magnetic disk

94. Which of the following statement is true.

a. Seek analysis is used for analysing control-unit busy problems.

95. Which of the following statements is false?

b. real time systems generally use non-preemptive CPU scheduling

96. The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

c. less efficient

97. The register or main memory location which contains the effective address of the operand is

known as

c. pointer

98. The most optimal scheduling algorithm is

c. SJF – Shortest Job First

99. Special software to create a job queue is called a

c. Spooler

100. Process are classified into different groups in

c. multilevel queue scheduling algorithm

101. Assembly code data base is associated with

d. assembly language version of the program which is created by the code generation phase and is input

to the assembly phase.

102. Resolution of externally defined symbols is performed by

d. Linker
 103. A process that is based on IPC mechanism which executes on different systems and

can communicate with other processes using message based communication, is called

________

b. Remote Procedure Call

104. The powerful text editor called PC-Write can be used by anybody by paying a small

fee. Such programs are called

b. Shareware

105. Which of the following terms refers to the degree to which data in a database system

are accurate and correct?

d. data integrity

106. The initial program that is run when the computer is powered up is called __________

c. bootstrap program

107. The computational technique used to compute the disk storage address of individual

records is called

c. hashing

108. Block caches or buffer caches are used

c. to improve disk performance

109. In an absolute loading scheme, which loader function is accomplished by assembler.

b. Reallocation

110. The total time to prepare a disk drive mechanism for a block of data to be read from it

is

a. latency plus seek time

111. Which of the following scheduling algorithms gives minimum average waiting time ?

d. SJF

112. In which addressing mode the operand is given explicitly in the instruction?
c. immediate mode

113. The errors that can be pointed out by the compiler are

a. Syntax errors

114. Which of the following algorithms tends to minimize the process flow time ?

b. Shortest Job First

115. A system is in the safe state if ____________.

a. the system can allocate resources to each process in some order and still avoid a deadlock

116. What scheduling algorithm allows processes that are logical runnable to be

temporarily suspended?

b. preemptive scheduling

117. What is the name of the operating system that reads and reacts in terms of actual time?

b. Real time system

118. When a computer is first turned on or restarted, a special type of absolute loader is

executed, called a

b. Bootstrap loader

119. A translator which reads an entire programme written in a high level language and

converts it into machine language code is:

d. compiler

120. Consider the following set of processes, the length of the CPU burst time given in

milliseconds :
 Processe Burst

s Time

P1 6

P2 8

P3 7

P4 3

Assuming the above process being scheduled with the SJF scheduling algorithm :

b. The waiting time for process P1 is 3ms

121. The two ways of aborting processes and eliminating deadlocks are ____________

b. Abort one process at a time until the deadlock cycle is eliminated

122. Which scheduling algorithm allocates the CPU first to the process that requests the

CPU first?

c. first-come, first-served scheduling

123. Relocation bits used by relocating loader are specified (generated) by

a. Linker

124. Object modules generated by assemblers that contain unresolved external references

are resolved for two or more object modules by a/an

d. linker

125. One way to ensure that the circular wait condition never holds is to ____________
b. impose a total ordering of all resource types and to determine whether one precedes another in the

ordering

126. The wait-for graph is a deadlock detection algorithm that is applicable when

____________

b. all resources have a single instance

127. In which addressing mode, the address of the location of the operand is given

explicitly as a part of the instruction.

c. absolute mode

128. In a magnetic disk, data is recorded in a set of concentric tracks which are subdivided

into

b. sectors

129. The portion of the process scheduler in an operating system that dispatches processes

is concerned with :

c. assigning ready processes to CPU

130. Which one of the following is not a real time operating system?

b. Palm OS

131. Which one of the following is a visual ( mathematical ) way to determine the deadlock

occurrence?

b. Resource allocation graph

132. A sequence of instructions, in a computer language, to get the desired result, is known

as
b. Program

133. Which facility dynamically adds probes to a running system, both in user processes

and in the kernel?

d. DTrace

134. Part of a program where the shared memory is accessed and which should be executed

invisibly, is called

b. critical section

135. A program that converts a high-level language program to a set of instructions that can

run on a computer is called a

a. Compiler

136. Backups should be done

c. as several incrementals, followed by an image copy

137. What is the name of the operating system which was originally designed by scientists

and engineers for use by scientists and engineers?

c. UNIX

138. Two basic types of operating systems are:

b. batch and interactive

139. If deadlocks occur frequently, the detection algorithm must be invoked ________

b. frequently

140. To access the services of operating system, the interface is provided by the
d. System calls

141. If we preempt a resource from a process, the process cannot continue with its normal

execution and it must be ____________

d. rolled back

142. The function(s) of the Syntax phase is(are)

b. to recognize the major constructs of the language and to call the appropriate action routines that will

generate the intermediate form or matrix for these constructs.

143. The disadvantage of a process being allocated all its resources before beginning its

execution is ____________

b. Low resource utilization

144. How does the Hardware trigger an interrupt?

c. Sending signals to CPU through a system bus

145. A deadlock avoidance algorithm dynamically examines the __________ to ensure that

a circular wait condition can never exist.

b. resource allocation state

146. Given a priori information about the ________ number of resources of each type that

maybe requested for each process, it is possible to construct an algorithm that ensures that the

system will never enter a deadlock state.

b. maximum

147. Remote Procedure Calls are used ____________

c. for communication between two processes on separate systems

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

c. manage resources

149. A relationship between processes such that each has some part (critical section) which

must not be executed while the critical section of another is being executed, is known as

a. mutual exclusion

150. A form of code that uses more than one process and processor, possibly of different

type, and that may on occasions have more than one process or processor active at the same

time, is known as

a. multi threading

151. What is the name given to the process of initializing a microcomputer with its

operating system?

b. Booting

152. Deadlock prevention is a set of methods ____________

c. to ensure that at least one of the necessary conditions cannot hold

153. In the following case(s) non – preemptive scheduling occurs :

d. When a process goes from the running state to the waiting state

154. In priority scheduling algorithm

c. CPU is allocated to the process with highest priority

155. The technique, for sharing the time of a computer among several jobs. Which switches

jobs so rapidly such that each job appears to have the computer to itself:

d. time sharing
 156. RPC (Remote Procedure Call) provides a(an) _____ on the client side, a separate one

for each remote procedure.

a. stub

157. Which of the following systems software does the job of merging the records from two

files into one?

b. Utility program

158. The practice of "bundling" refers to

a. giving away software with a computer purchase

159. Which of the following is not true about documentation?

c. Documentation increases the maintenance time and cost

160. Daisy chain is a device for

b. connecting a number of devices to a controller

161. DMA is used for __________

b. High speed devices(disks and communications network)

162. What is the name given to the organized collection of software that controls the overall

operation of a computer?

b. Operating system

163. For Mutual exclusion to prevail in the system ____________

b. at least one resource must be held in a non sharable mode

 164. What is the name of the technique in which the operating system of a computer

executes several programs concurrently by switching back and forth between them?

a. Multitasking

165. A public key encryption system

b. allows only the correct receiver to decode the data

166. A deadlock eventually cripples system throughput and will cause the CPU utilization

to ______

a. drop

167. In priority scheduling algorithm, when a process arrives at the ready queue, its priority

is compared with the priority of

d. currently running process

168. A relationship between processes such that each has some part (critical section) which

must not be executed while the critical section of another is being executed, is known as

c. mutual exclusion

169. A solution to the problem of indefinite blockage of low – priority processes is :

c. Aging

170. Which of the following are loaded into main memory when the computer is booted?

d. internal command instructions

171. A self-relocating program is one which

a. can itself performs the relocation of its address-sensitive portions.

172. The term "operating system" means

c. a set of programs which controls computer working

173. A non-relocatable program is one which

c. cannot be made to execute in any area of storage other than the one designated for it at the time of

its coding or translation.

174. By operating system, the resource management can be done via

b. both time and space division multiplexing

175. An I/O bound program will typically have:

a. many very short CPU bursts

176. Under virtual storage,

a. only the active pages of a program are stored in primary storage

177. Which is not true about an interpreter?

b. Interpreter generates an object program from the source program

178. To avoid deadlock, ____________

b. there must be a fixed number of resources to allocate

179. CPU scheduling is the basis of _____

c. multiprogramming operating systems

180. To ensure no preemption, if a process is holding some resources and requests another

resource that cannot be immediately allocated to it ____________

b. then all resources currently being held are preempted

181. Every time a request for allocation cannot be granted immediately, the detection

algorithm is invoked. This will help identify ____________

b. the set of processes that have been deadlocked

182. What is the name given to the values that are automatically provided by software to

reduce keystrokes and improve a computer user's productivity?

c. Default values

183. Software that measures, monitors, analyzes, and controls real-world events is called:

d. real-time software
 184. Which one is true about Multithreaded programs?

c. more prone to deadlocks

185. Which module gives control of the CPU to the process selected by the short-term

scheduler?

b. dispatcher

186. The remote method invocation __________

c. allows a thread to invoke a method on a remote object

187. Which of the following instruction steps, would be written within the diamond-shaped

box, of a flowchart?

c. IS A<10

188. A deadlock can be broken by ____________

b. abort one or more processes to break the circular wait

189. What is the name given to the software which can be legally compiled and often used

for free?

a. Public domain program

190. If the wait for graph contains a cycle ____________

d. then a deadlock exists

191. Which of the following is true for machine language?

b. The language which communicates with the computer using only the binary digits 1 and 0.

192. A process is selected from the ______ queue by the ________ scheduler, to be

executed.

c. ready, short term

193. A problem encountered in multitasking when a process is perpetually denied necessary

resources is called ____________

b. starvation
 194. While working with MS-DOS, which command will you use to transfer a specific file

from one disk to another?

a. COPY

195. The details of all external symbols and relocation formation (relocation list or map) is

provided to linker by

b. Translator

196. An edge from process Pi to Pj in a wait for graph indicates that ____________

a. Pi is waiting for Pj to release a resource that Pi needs

197. Which of the following is a measure to test how good or bad a modular design is

a. Module strength

198. Deadlock prevention is a set of methods ____________

d. to ensure that at least one of the necessary conditions cannot hold

199. Which of the following is a block device

c. disk

200. The process of transferring data intended for a peripheral device into a disk (or

intermediate store) so that it can be transferred to peripheral at a more convenient time or in

bulk, is known as

d. spooling

201. The SJF algorithm executes first the job

b. with the least processor needs

202. The part of machine level instruction, which tells the central processor what has to be

done, is

b. Operation code

203. If a process fails, most operating system write the error information to a ______

a. log file
 204. What is the name of the system which deals with the running of the actual computer

and not with the programming problems?

d. Systems program

205. An instruction in a programming language that is replaced by a sequence of

instructions prior to assembly or compiling is known as

d. macro

206. While running DOS on a PC, which command would be used to duplicate the entire

diskette?

d. DISKCOPY

207. The disadvantage of a process being allocated all its resources before beginning its

execution is _________

b. Low resource utilization

208. One of the disadvantages of the priority scheduling algorithm is that :

c. it can lead to some low priority process waiting indefinitely for the CPU

209. An algorithm is best described as

d. A step by step procedure for solving a problem

210. A system is in a safe state only if there exists a ____________

c. safe sequence

211. All the time a computer is switched on, its operating system software has to stay in

c. primary storage

212. Which of the following command is used to count number of lines in a file?

a. wc - I

213. Which of the following command is used to count number of lines in a file in Linux?

a. wc – I

214. Time quantum is defined in

 d. round robin scheduling algorithm

215. An SJF algorithm is simply a priority algorithm where the priority is :

b. the predicted next CPU burst

216. Scheduling is done in order to :

b. increase CPU utilization

217. Scheduling is done so as to :

a. decrease the turnaround time

218. Scheduling is done to :

b. increase the throughput

219. For non sharable resources like a printer, mutual exclusion ____________

b. must exist

220. For sharable resources, mutual exclusion ____________

c. is not required

221. In which addressing mode the effective address of the operand is the contents of a

register specified in the instruction and after accessing the operand, the contents of this

register is incremented to point to the next item in the list?

b. auto increment

222. Which addressing mode the contents of a register specified in the instruction are first

decremented, and then these contents are used as the effective address of the operands?

d. auto decrement

223. Which of the following is a phase of a compilation process?

c. Lexical analysis AND Code generation

224. The action of parsing the source program into the proper syntactic classes is known as

c. lexical analysis
 225. In a memory mapped input/output __________

d. the CPU writes one data byte to the data register and sets a bit in control register to show that a

byte is available

226. In an interrupt driven input/output __________

d. the CPU receives an interrupt when the device is ready for the next byte

227. In a programmed input/output (PIO) __________

d. the CPU uses polling to watch the control bit constantly, looping to see if a device is ready