1) The main memory of the computer

a) Controls the operations of computer.

b) Performs data processing functions.

c) Stores data and programs.

d) None of these.

Answer» c

2) Program counter (P(C) contains

a) Address of an instruction to be fetched

b) Instructions most recently fetched

c) Data to be written into memory

d) Data to be read from memory

Answer» a

3) MAR (memory address register)

a) Contains data to be written into memory.

b) Contains data to be read from memory.

c) Specifies location in memory for next read/or writer.

d) Contains address of next instruction to be fetched)

Answer» c

4) IR (Instruction register)

a) Contains the address of an instruction to be fetched)

b) Contains the instruction most recently fetched

c) Specifies memory addresses.

d) None of these.

Answer» b

7) Memory table is used

a) To allocate main memory to processes

b) To allocate secondary memory to processes

c) To manage virtual memory

d) A, B and C are true.

Answer» d

15) User-Visible register Which of the following do not support GUI (Graphical User Interface)

a) DOS

b) WINDOWS

c) Linux

d) None of these.

Answer» a

16) The MS-DOS an operating system supports

a) Single user process and multiple threads

b) Multiple user process and single thread

c) Single user process and single thread

d) Multiple user processes and multiple threads.

Answer» c

17) The UNIX, an operating system supports

a) Multiple user processes and single thread per process.

b) Multiple user processes and multiple threads per process.

c) Single user process and single thread per process.

d) Single user process and multiple threads per process.

Answer» c

18) The Java run time environment is an example of

a) Single user process with multiple threads

b) Multiple user processes with single thread per process.

c) Multiple user processes with multiple threads per process.

d) None of these.

Answer» a

19) The Windows 2000, operating system supports

a) Multiple user processes with single thread per process.

b) Multiple processes with multiple thread per process.

c) Single process with single thread

Answer» b

20) In the pure User Level Threads (ULT)

(i) Thread management is done by application, (ii) Thread management is done by kernel,

(iii) Kernel is not aware of the existence of thread,

a) i, iii are true

b) i, ii and iii are true

c) All are false

d) None of these are true

Answer» a

21) The Window 2000 (W2K) and Linux are the example of

a) User Level Thread (ULT)

b) Kernel Level Thread (KLT)

c) A and B both

d) None of these.

Answer» b

22) The following is not an advantage of User Level Threads (ULT).

a) Thread switching does not requires kernel mode privileges because all of the thread

management are within the user address space of a single process.

b) Here scheduling can be application specific)

c) ULT can be run an any operating system.

d) When ULT executes a system call, not only that thread blocked, but all of the threads within

the process are blocked)

Answer» d

23) The Linux operating system supports

a) Single thread per process and single process.

b) Multiple thread per process and single process.

c) Single thread per process and multiple processes.

d) Multiple thread per process and multiple processes.

Answer» d
24) In semaphore the process blocked by wait operation is unblocked if

a) Semaphore value becomes non- negative

b) Semaphore value becomes non- positive

c) Semaphore value is negative

d) Semaphore value is positive.

Answer» b

25) In cluster

a) Computers communicate with each other’s via fixed paths or via some network facilities

b) Computer communicates with each other’s via a shared memory.

c) Both (A) and (B)

d) None of these.

Answer» a

26) The cluster is a case of

a) Distributed memory

b) Shared memory

c) Master/slave architecture

d) Symmetric multi-processor.

Answer» a

27) The master/slave architecture is an example of

a) Distributed memory processing

b) Shared memory processing

c) Symmetric multi-processing

d) None of these.

Answer» b

32) Operating System is

a) Software

b) Hardware

c) Software and Hardware both

d) None of these.
Answer» a

34) Which combination of the following features will suffice to characterize an OS as a multi

programmed OS?

(i) More than one program may be loaded into main memory at the same time for execution.

(ii) If a program waits for certain events such as I/O, another program is immediately scheduled

for execution.

(iii) If the execution of a program terminates, another program is immediately scheduled for

execution.

a) (i) only

b) (ii) and (iii)

c) (i) and (iii)

d) (i), (ii) and (iii).

Answer» d

35) Turnaround time is defined as

a) Delay between job submission and job completion

b) A waiting time

c) Both (a) and (b) above

d) None of these

Answer» a

36) The only state transition initiated by the user process itself in an operating system is

a) Block

b) Timer run out

c) Dispatch

d) Wake up

Answer» a

37) Window 98 is a

a) Single user system

b) Multi user system

c) Single tasking system

d) None of these.

Answer» a

38) OS/390 is a

a) Single user system

b) Multi user system

c) Single tasking system

d) None of these.

Answer» b

39) Thread is

a) Dispatch able unit of work

b) Can be interrupted

c) A and B both true

d) A and B both false.

Answer» c

40) Multithreading allows

a) To run threads concurrently

b) To run threads independently

c) a is true, b is false

d) a and b both true.

Answer» d

41) For multithreading

a) Tasks to be performed can be independent

b) Task to be performed is essentially serialized)

c) Tasks cannot be divided into number of threads.

d) None is true.

Answer» a

42) The principal function of a process is

a) To execute machine instructions residing in main memory.

b) To execute assembly instructions residing outside main memory.

c) A and B both true.

d) A and B both false.

Answer» a

43) The trace of the process is

a) A set of instructions that execute process

b) A listing of sequence of instructions that execute process

c) A track of network

d) None of these.

Answer» b

44) The two state process models have the following states

a) Running and Not Running

b) Running and Ready

c) Ready and Blocked

d) New and Ready.

Answer» a

45) The process control blocks are referred for

a) Process control

b) I/O devices

c) Memory allocation

d) None of these.

Answer» a

47) Process control block is also referred as

a) Fast control block

b) Process descriptor

c) Task descriptor

d) a, b, c are all true.

Answer» d

48) The operating system control tables maintain process tables, because

a) These tables manage I/O devices

b) These tables manage files

c) These tables manage memory

d) None of these.

Answer» d

49) Windows XP is

a) Uni-programming processes

b) Multi programming processes

c) Hardware

d) None of these.

Answer» b

50) The OS/2 is the operating system that support

a) Single thread per process

b) Multiple thread per process

c) Single process

d) None of these.

Answer» b

51) In shared memory multi-processor

a) Computer communicate to each other by fixed paths

b) Computer communicates to each other via a shared memory.

c) Each processing element is a self-contained computer.

d) None of these.

Answer» b

52) The following is not true for master/slave architecture

a) A failure of master brings down the whole system

b) Operating system kernel runs on master processor only.

c) Operating system kernel can run on any processor either master or slave.

d) All scheduling and process management is done on master processor.

Answer» c

53) In monolithic operating system

a) Virtually any procedure can call any other procedure.

b) Virtually specific procedure can call any other procedure.

c) Virtually specific procedure can call specific procedure.

d) None of these.

Answer» a

54) In Layered operating system following statement is false

a) Most or all the layers execute in kernel mode.

b) Interaction only takes place between adjacent layers.

c) Functions are organized hierarchically.

d) None of these.

Answer» d

55) When operating system always run on a particular processor and that particular processor

do all scheduling and process management then this is an example of

a) Master/slave architecture

b) Symmetric multiprocessor

c) Cluster

d) None of these.

Answer» a

58) A Semaphore is initialized to

a) Negative integer value

b) Positive integer value

c) non-negative integer value

d) non-positive integer value.

Answer» c

59) The wait operation

a) Decrements the semaphore value

b) Increments the semaphore value

c) Fixes the semaphore value

d) None of these.
Answer» a

60) In semaphore, the process executing the wait is blocked if

a) The semaphore value becomes negative

b) The semaphore value become positive

c) The semaphore value becomes non-positive

d) The semaphore value becomes non- negative.

Answer» a

61) In semaphore when the order of processes that are waiting to be removed from the queue is

first in first out (FIFO) then it is called

a) Weak semaphore

b) Strong semaphore

c) Binary semaphore

d) None of these.

Answer» b

62) The compaction is the technique in memory management that is used to over come

a) Internal fragmentation

b) External fragmentation

c) Both (A) and (B)

d) None of these.

Answer» b

63) Physical address (absolute address) in memory partitioning is

a) Actual location in main memory

b) A reference to memory location independent of current assignment

c) A logical address

d) None of these.

Answer» a

64) The frame

a) Can hold exactly one page of data

b) Can hold more than one page of data

c) Can hole two pages of data

d) None of these.

Answer» a

65) In real time computing

a) The result of computation does not depend on the time at which computation is done.

b) The result of computation also depends on the time at which computation is done.

c) The results are independent of the time consider

Answer» a

67) The Least Recently Used (LRU) policy

a) Replaces the page in memory that has not been referenced for the least time.

b) Replaces the page in memory that has not been referenced for the longest time.

c) Replaces the page in memory in round robin fashion.

d) None of these.

Answer» b

68) Physical address in memory management is

a) Actual location in main memory

b) Memory location independent of current assignment of data to memory.

c) Memory location dependent to some known point.

d) None of these.

Answer» a

69) Relative address in memory management is

a) Independent of some known point

b) Dependent to some known point

c) Actual location in the main memory

d) None of these.

Answer» b

71) For Load-time dynamic linking

a) Load module (application module) to be loaded is read into memory.

b) Some of the linking is postponed until execution time.

c) External references to target modules remain in the loaded program.

d) None of these.

Answer» a

72) In thread scheduling, load sharing is referred to

a) Simultaneous scheduling of threads that make up a single process.

b) Implicit scheduling defined by the assignment of threads to processors.

c) A global queue of ready thread is maintained and each processor, when idle, selects a thread

from queue.

d) None of these.

Answer» c

73) The real time task

a) The tasks that reacts to events that take place in outside world)

b) The tasks that do not reacts to the outside world events.

c) The tasks are independent of the time when it occurs.

d) None of these.

Answer» a

74) Hard real-time tasks are

a) A real time task that does not require dead line constraints.

b) A real time task that requires dead line constraints.

c) A task independent to time when it occurs.

d) None of these.

Answer» b

75) The deterministic operating system

a) Where operations are performed with in pre-determined time interval.

b) Where operations can be performed without pre-determined time interval.

c) The operating time cannot be determined

d) None of these.

Answer» a

76) In Responsive real time operating system

a) The interruption is acknowledged and operating system response to interrupt.

b) Once the operation starts no interrupt is acknowledged)

c) The operation completes in fixed inter of time.

d) None of these.

Answer» a

78) In soft real time tasks

a) The dead line is always mandatory.

b) The dead line is desirable but not mandatory.

c) The results are independent of the time, when it took place.

d) None of these.

Answer» b

81) Arrange the following I/O device in increasing data rate Hard disk, Floppy disk, Key board

a) Key board, Floppy disk, Hard disk

b) Floppy disk, Key board, Hard disk

c) Key board, Hard disk, Floppy disk

d) Hard disk, Floppy disk, Key board)

Answer» a

82) Resident set of process is

a) Portion of a process that is actually in main memory at any time.

b) Portion of a process that is actually in virtually memory at any time.

c) A and b both true.

d) None of these.

Answer» a

83) Main memory is referred as

a) Virtual memory

b) Real memory

c) A and B both

d) None of these.

Answer» b
84) Memory that is located on the disk either Hard or floppy is referred as

a) Virtual memory

b) Real memory

c) Main memory

d) None of these.

Answer» a

85) The principle of locality states

a) The program and data references within a process tend to cluster.

b) The program and data references within a process do not tend to cluster.

c) A process actually referred in virtual memory.

d) None of these.

Answer» a

86) In memory management: A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It

determines when a modified page should be written out to secondary memory) 2- It determines

when a page should be bought into main memory) 3- It determines where in real memory a

process piece is to be reside.

a) A => 1, B => 2, C => 3

b) A => 2, B => 1, C => 3

c) A => 2, B => 1, C => 3

d) A => 3, B => 1, C => 2

Answer» c

87) In memory management when demand cleaning policy is applied

a) A modified page is written before their page frames are needed to so that pages can be written

out in batches.

b) A page is written out to secondary memory only when it has been selected for replacement.

c) A and B both true.

d) None of these.

Answer» b

88) When pre cleaning policy is applied in memory management

a) A page is written out to secondary memory only when it has been selected for replacement.

b) Modified pages are written before their page frames are needed so that can be written out in

batches.

c) A and B both true.

d) None of these.

Answer» b

89) In virtual memory management, when local control policy is applied

a) It determines the number of processes that are to be resident in main memory.

b) It determines the number of processes that are to be resident in virtual memory.

c) It determines when a modified page should be written out to secondary memory.

d) None of these.

Answer» a

90) In defining page table structure in virtual memory, A page number portion of a virtual

address is mapped into a hash table using simple hash function, where hash table contains a

pointer to the inverted page table, which contains page table entries, this approach is referred as

a) One page table per process structure.

b) Two level page table structure.

c) Inverted page table structure.

d) None of these.

Answer» c

91) A fetch policy for virtual memory determines

a) When a page should be bought into main memory.

b) Where in real memory a process piece is to be reside.

c) The selection of a page in memory that is to replace

d) The page in memory that is not been referenced for long time.

Answer» a

92) When process is swapped out of main memory and put in a suspended state

a) All of its resident pages are moved out.

b) All of the pages that were previously in main memory are returned to main memory.
c) Pages other than the one demanded by a page fault are bought in main memory.

d) None of these.

Answer» a

93) Statement A: The placement policy determines where in real memory a process piece is to

reside

Statement B: The fetch policy determines when a page should be bought into main memory.

a) A and B both true

b) A and B both false

c) A is true, B is false

d) A is false, B is true

Answer» a

94) When a frame in main memory is locked

a) The page currently stored in that frame can be replaced)

b) The page currently stored in that frame cannot be replaced)

c) Pages currently in frame can be removed in round-robin style.

d) None of these.

Answer» b

95) Statement A: In memory management, the replacement policy deals with the selection of

pages in memory to be replaced by arrived new page) Statement B: In memory management,

the policy the fetch policy determines when a page should be bought into main memory.

a) A and B both false

b) A and B both true

c) A is true, B is false

d) A is false, B is true

Answer» b

96) In memory management where replacement is allowed in First-in-First-out (FIFO) fashion

a) The page frames are allocated to a process as circular buffer and pages are removed in

random order.

b) The page frames are allocated to a process as circular buffer and pages are removed in round
robin order.

c) Replaces the pages that are least refer

d) Replaces the pages that are most referred)

Answer» b

97) By principle of locality, in least recently used policy, in memory management

a) The page replaced in memory is least likely to be referenced in the near future.

b) The page replaced in memory is most likely to be referenced in the near future.

c) The pages replaced in memory in round-robin fashion.

d) None of these.

Answer» a

98) In First-In-First-out (FIFO) replacement policy used in memory management, the page

frames to allocated to a process as circular buffer and

a) The most recent page is removed at first

b) The most recent page is removed at the last

c) The most recent page is removed any time

d) None of these

Answer» b

99) Cache memory is

a) Bigger and slower than main memory

b) Bigger and faster that main memory

c) Smaller and slower than main memory

d) Smaller and faster than main memory

Answer» d 100) By principle of locality, cache memory

a) Increases average memory access time.

b) Reduces average memory access time

c) Does not affect the average memory access time

d) None of these

Answer» b

101) Following is not true for disk cache

a) It is a buffer in main memory for disk sector

b) It contains the copy of some of the sector on the disk

c) It is bigger is size than main memory

d) It is smaller is size than main memory

Answer» c

110) In File system architecture which is the correct arrangement from lower level to higher.

a) Device drives, basic file system, basic I/ O supervisor, logical I/O.

b) Basic file system, basic I/O, logical I/O, device drives.

c) Basic I/O, basic file system, logical I/O, device drives.

d) None of these.

Answer» a

111)In file management system the following communicate directly with perishing I/O devices.

a) Device drives

b) Basic file system

c) Basic I/O supervisor

d) Logical I/O.

Answer» a

112) For file management, in file operations device drivers are

a) Disk drivers

b) Tape drivers

c) A and B both

d) None of these.

Answer» c

113) In file management, the primary interface of computer system with external environment is

done through

a) Device drivers

b) Basic file system

c) Basic I/O supervisor

d) Logical I/O.
Answer» b

114) In file management, users and applications access records via

a) Physical I/O

b) Basic I/O supervisor

c) Logical I/O

d) None of these.

Answer» c

117) In file management, the pile

a) The collection of data in order which they arrive.

b) A fixed format used for records.

c) Records keep with some key sequence.

d) None of these.

Answer» a

118) In file management, in the following record blocking method, the optional use of space is

made, without unused space left

a) Fixed blocking

b) Variable-length spanned blocking

c) Variable-length un-spanned blocking

d) None of these.

Answer» b

119) In secondary storage management, “If allocation of file is made on an individual block

basis and each block contains a pointer to the next block in the chain” then it is referred as

a) Contiguous allocation

b) Chained allocation

c) Indexed allocation

d) None of these.

Answer» b

120) In secondary storage management, bit table, for each block on disk a vector contains

a) One bit each block

b) Two bit each block

c) Three bit each block

d) Four bit each block.

Answer» a

121) In bit table used for Free space management in secondary storage

a) Bit zero corresponds to free block

b) Bit one corresponds to free block

c) Bit zero corresponds to block in use

d) None of these

Answer» a

122) The amount of memory (in bytes) required for a block bitmap is

a) Disk size × 8

b) Disk size/ (8 × file system block size)

c) File system block size/disk size

d) None of these.

Answer» b

123) In 16 G byte disk with 512-bit block, the bit table requires

a) 1 M bytes

b) 2 M bytes

c) 3 M bytes

d) 4 M bytes.

Answer» d

124) Application Programming Interface is

a) A set of function and call programs that allows clients and servers to intercommunicate.

b) A database, where information access is limited to the selection of rows that satisfy all search

criteria)

c) A computer usually a high-powered work station.

d) None of these.

Answer» a
125) If in a computer networking environment when all the processing is done on single

computer can be referred as

a) Host based processing

b) Server based processing

c) Client based processing

d) None of these.

Answer» a

127) UNIX was developed by

a) Bell Labs for PDP-7 in 1970

b) Microsoft for IBM computers

c) Macintosh

d) None of these.

Answer» a

128) UNIX is a

a) Operating system

b) Hardware

c) Programming language

d) None of these.

Answer» a

135) Semaphores

a) are used to do I/O

b) Synchronize critical resources to prevent contention

c) synchronize critical resources to prevent deadlock.

d) allow processes to communicate with one another.

Answer» c

138) With round-robin CPU scheduling in a time-shared system

a) using very large time slices degenerates into First-Come First Served Algorithm

b) using extremely small time slices improves performance

c) using very small time slices degenerate into Last-In-First-Out algorithm

d) using medium sized time slices leads to Shortest Request Time First algorithm.

Answer» a

139) The portion of the process scheduler in an operating system that dispatches processes is

concerned with

a) activating suspended I/O-bound processes

b) temporarily suspending processes when CPU load is too great

c) assigning ready processes to the CPU

d) all of the above

Answer» c

140) Following is the correct definition of a valid process transition within an operating system

a) wake up: ready => running

b) dispatch: ready => running

c) block: ready => blocked

d) timer run out: ready => blocked

Answer» b

145) A disk scheduling algorithm in an operating system causes the disk arm to seek back and

forth access the disc surface servicing all request in its path, this is a

a) first come first served

b) shortest seek time first

c) scan

d) None of these

Answer» c

146) An attached processor

a) is used one only a few computers

b) causes all processor to function equally

c) is more difficult to implement than a co- processor

d) is used only for limited, specific functions

Answer» d

147) Situations where two or more processes are reading or writing some shared data and the
final result depends on who runs precisely which are called

a) race condition

b) critical sections

c) mutual exclusions

d) message passing

Answer» a

148) Producer consumer problem can be solved using

a) Semaphores

b) Event counters

c) Monitors

d) All of the above

Answer» d

157) Windows is an

a) operating system

b) operating environment

c) user interface

d) programming platform

Answer» c

158) Following is/are operating system used in computers

a) MS-DOS

b) OS/2

c) UNIX

d) All of the above

Answer» d

159) The following operating system writes through catches?

a) UNIX

b) DOS

c) ULTRIX

d) XENIX
Answer» b

170) Round robin is a

a) kind of magnetic drum

b) process scheduling policy

c) process synchronization policy

d) memory allocation policy

Answer» b

171) Which is the correct definition of a valid process transition in an operating system?

a) Wake up: ready? running

b) Dispatch: ready? running

c) Block: ready? running

d) Timer runout: ready? blocked

Answer» b

190) The activity of a file

a) is a low percentage of number of records that are added to or deleted from a file

b) is a measure of the percentage of existing records updated during a run

c) refers to how closely the files fit into the allocated space

d) is a measure of the number of records added or deleted from a file compassed with the

original number of records

Answer» a

191) The volatility of a file refers to

a) The number of records added or deleted from a file composed to the original number of

records in that file

b) Efficiency with which non-sequential files are processed

c) The extent where the records of the file "are contiguous and in proximity to others

d) Percentage of records that has changed" in a given time period

Answer» a

192) Which types of file organization are supported by magnetic tape?

a) random files
b) contiguous sequential file

c) indexed sequential file

d) all of the above

Answer» b

193) Address Binding is defined as

a) Compiler will typically bind these symbolic addresses to relocatable addressees

b) Each binding is a mapping from one address space to another

c) The linkage editor or loader win in turn bind these relocatable addresses to absolute addresses

d) All of the above

Answer» d

194) Compile time

a) where the process will reside in memory, then absolute code can be generated

b) where the process will reside in memory, then the compiler must generate relocatable code

c) if the process can be moved during its execution from one memory segment to another, the

binding must be delayed until run time

d) all of the above

Answer» a

195) Load time

a) where the process will reside in memory, then absolute code can be generated

b) where the process will reside in memory, then the compiler must generate relocatable

memory

c) if the process can be moved during its execution from one memory segment to another, then

binding must be delayed until run time

d) all of the above

Answer» b

196) Fragmentation of the file system

a) occurs only if the file system is used improperly

b) can always be prevented

c) can be temporarily removed by compaction

d) is the characteristic of all files system

Answer» c

197) Stub

a) is included in the image for each library routine reference

b) is small piece of code that indicates how to locate the appropriate memory resident library

routine

c) how to load the library if the routine is not already present

d) all of the above

Answer» d

198) Local replacement

a) allows a process to select a replacement frame from the set of all frames

b) requires that each process selects from only its own set of allocated frames

c) both (A) and (B) above

d) none of the above

Answer» b

199) Thrashing

a) the high paging activity

b) is spending more time in paging than executing

c) both A and B above

d) none of the above

Answer» c

201) The memory allocation scheme subject to external fragmentation is

a) segmentation

b) swapping

c) pure demand paging

d) multiple contiguous fixed partitions

Answer» a

215) In a two-level scheme for the page table, assuming byte-level addressing and a 4-KByte

(212 bytes) page size, how many pages are there in a 4-GByte (232 bytes) virtual address
space?

a) 210 pages

b) 220 pages

c) 230 pages

d) 240 pages

Answer» b

217) The memory management, y one clock policy is applied then the page first loaded into a frame

in memory its use bit is set to

a) Zero

b) One

c) Two

d) Three

Answer» b)

218) A policy in memory management is referred to as the "clock policy" because one can

visualize the page frames as laid out in a:

a) Straight line

b) Rectangle

c) Circle

d) Square

Answer» c

219) The mail box and ports are examples of

a) Indirect process communication

b) Direct process communication

c) Both A and B true

d) None is true

Answer» a

220) The disk and tape devices are referred as

a) Block oriented I/O devices

b) Stream oriented I/O devices

c) Logical I/O devices

d) None of these

Answer» a

221) Following is not the stream oriented I/O device

a) Printer

b) Mouse

c) Communication modules

d) Disk/tape

Answer» d

222) In which of the following RAID scheme, redundancy is achieved by the simple expedient

of duplicating all the data?

a) RAID level 0

b) RAID level 1

c) RAID level 2

d) RAID level 3

Answer» b

223) Which of the following RAID levels uses independent access technique and distributes the

parity strips across all disks?

a) Two

b) Three

c) Four

d) Five

Answer» d

224) The amount of memory (in bytes) required for a block bitmap is

a) Disk size × 8

b) Disk size / (8 × file system block size)

c) File system block size / disk size

d) None of these.

Answer» b
225) In 16 G byte disk with 512-bit block, the bit table requires

a) 1 M bytes

b) 2 M bytes

c) 3 M bytes

d) 4 M bytes

Answer» d

226) The number of process states recognized by UNIX is

a) Two

b) Nine

c) Eight

d) Seven

Answer» b

227) A set of resources allocations such that the system can allocate resources to each process

is some order, and still avoid a dead lock is called

a) unsafe state

b) safe state

c) Starvation

d) Greedy allocation

Answer» b

228) Banker’s algorithm for resource allocation deals with

a) deadlock prevention

b) deadlock avoidance

c) deadlock recovery

d) mutual exclusion

Answer» b

252) If normalized turnaround time of different process are given) Then Highest response ratio

next policy in uniprocessor scheduling policy selects.

a) The ready process with lowest normalized turnaround time.

b) The ready process with highest normalized turnaround time.

c) The process with shortest expected processing time.

d) The process with highest expected processing time.

Answer» b

269) In uni-processor scheduling, a priorities enforcement is

a) When processes are assigned priorities and scheduling policy favor higher priority processes.

b) The scheduling keeps resources of system busy.

c) Here currently running process can be interrupted and moved to ready state by the operating

system.

d) None of these.

Answer» a

Midterm
1) Suspicious Content Which one of the following is not true?

a) kernel remains in memory during the entire computer session

b) kernel is made of various modules which cannot be loaded in running operating system

c) kernel is the first part of the operating system to load into memory during booting

d) kernel is the program that constitutes the central core of the operating system

Answer: b

2) .................) used when source CPU type different from target type.

a) Interpretation

b) Virtualization

c) Hosting

d) Emulation

Answer: d

3) .................) maintains a table indexed according to numbers number is associated with each

system call

a) API

b) System-call interface

c) OS interface
d) Application Binary Interface

Answer: b

4) Which of the following is a microkernel system?

a) Linux

b) Unix

c) Mach

d) Windows

Answer: c

5) Program is active entity stored on disk; process is passive.

a) True

b) False

Answer: b

6) Ready queue => set of all processes residing in source code, ready and waiting to execute.

a) True

b) False

Answer: b

7) A concurrent system can perform more than one task simultaneously.

a) True

b) False

Answer: a

8) Many-to-Many Model Allows the operating system to create a sufficient number of kernel

threads.

a) True

b) False

Answer: a