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
5) Which of the following is not an address register?
a) Index register
b) Segment pointer
c) Stack pointer
d) Data register.
Answer» d

6) Following is not the state of Five-State process model

a) Ready
b) Running
c) Not Running
d) New.
Answer» c

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

8) I/O tables are used

a) To assign I/O devices of computer
b) To manage I/O devices of computer system
c) A and B both true
d) A and B both false.
Answer» c
9) The operating system control tables maintain file table, because
a) These tables manage I/O devices and channels of the computer system.
b) These tables provide information about the existence of files, their location on secondary
memory and their current status.
c) These tables provide information to manage process.
d) None of these.
Answer» b

10) Processor in computer

a) Controls the operations of the computer/ processes data functions.
b) Stores data and program.
c) Moves data between computer and its external environment.
d) None of these.
Answer» a

11) Memory buffer register (MBR) contains

a) Data that is to be written into memory
b) A particular I/O device.
c) Exchange data between I/O module and the processor.
d) The instruction most recently fetched)
Answer» a

12) I/O modules move data

a) Between external environment and computer.
b) In the computer main memory.
c) In Processors
d) None of these.
Answer» a
13) I/O OBR (I/O Buffer register) is
a) Used for the exchange of data between an I/O module and the processor.
b) Specifies particular I/O device.
c) (a) and (b) both true.
d) (a) and (b) both false.
Answer» a

14) User-visible register

a) Enables machine language programmer to minimize main memory reference by optimizing
register use.
b) Enables assembly language programmer to minimize main memory reference by optimizing
register use.
c) a and b both true.
d) a and b both false.
Answer» c

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

28) I/O modules in computer

a) Controls the operation of the computer.
b) Stores data and program.
c) Move data between the computer and external environment.
d) Provides communication among processors and main memory.
Answer» c
29) Instruction register contains
a) The address of an instruction to be fetched)
b) The instructions most recently fetched)
c) The data to be written into memory.
d) The data to be read from memory.
Answer» b

30) The following

a) Start? Fetch next instruction? Execute Instruction? Halt, represents
b) Instruction cycle with interrupt
c) Instruction cycle without interrupt
d) Instruction cycle with two interrupts
Answer» c

31) Instruction processing consists of

a) Fetch cycle only
b) Execution cycle only
c) Fetch and Execution cycle both
d) None of these.
Answer» c

32) Operating System is

a) Software
b) Hardware
c) Software and Hardware both
d) None of these.
Answer» a
33) The concept used to support multi programming environment on a computer is
a) Virtual memory
b) Hierarchy of physical memory
c) Display of multiple windows
d) None the above.
Answer» c

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

46) With trap in process control

a) Operating system determines the error or exception condition that is fatal.
b) Operating system interrupted for maximum allowable time.
c) Are tables that manage information process
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
56) In micro kernel architecture following is false.
a) Intersection takes place only between adjacent layers.
b) Intersection takes place via micro kernel.
c) It supports portability.
d) It supports object-oriented operating system.
Answer» a

57) In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a; the output is.

a) a > b
b) a < b
c) a = b
d) None of these.
Answer» d

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

66) Match the following pairs

a) A => 3, B => 2, C=>1 A) Logical address (1) An actual location in
b) A => 2, B => 1, C => 3 main memory
B) Relative address (2) An address is expressed
c) A => 3, B => 1, C => 2 as a location relative to
d) A => 1, B => 2, C => 3 some known point
C) Physical address (3) A memory location
Answer» a independent of the current
assignment of data to
memory

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

A- Absolute loading 1) For loader, load module,

70) Match
either is an absolute main
a) A => 1, B => 2, C => 3 memory address or specific
address reference
b) A => 2, B => 3, C => 1 B- Re-locatable loading 2) For loader, load modules
c) A => 1, B => 3, C => 2 have no absolute address
C- Dynamic Run-Time loading 3) For loader, load modules
d) A => 3, B => 2, C => 1 have all memory reference in
Answer» a relative form

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

77) In multi-processor scheduling;

A: Gang scheduling,
B: Dynamic scheduling,
C: Dedicated processor management.
1- The number of threads in a process can be altered during the course of execution)
2- This provides implicit scheduling defined by the assignment of threads to processors,
3- It is applied to the simultaneous scheduling of threads that make up a single process.
a) A => 1, B => 2, C => 3
b) A => 2, B => 1, C => 3
c) A => 1, B => 3, C => 2
d) A => 3, B => 1, C => 1
Answer» d

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
79) In real time scheduling: A: Static table-driven approach, B: Static priority driven preemptive
approach, C: Dynamic planning-based approach; 1- A static analysis of feasible scheduler of
dispatching is done and implemented) 2- A static analysis of feasible schedules of dispatching is
done and assigns priorities to tasks) 3- Feasibility is determined at run time.
a) A => 1, B => 2, C => 3
b) A => 2, B => 3, C => 1
c) A => 3, B => 1, C => 2
d) None of these.
Answer» a

80) Match the following I/O devices:

a) A => 1, B => 3, C => 2
A- Keyboard 1- Human readable
b) A => 1, B => 2, C => 3 B- Disk and tape drives 2- Communication
c) A => 3, B => 2, C => 1 C- Modems 3-Machine readable

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

Answer» a

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

102) In disk storage devices, data are recorded on and later retrieved from disk via a conducting
coil named
a) Tail
b) Foot
c) Head
d) Hand)
Answer» c
103) In disk storage devices during read and write operation
a) Head is rotate while platter is stationary
b) Head is stationary while platter rotates
c) Head and platter are both stationary
d) None is true
Answer» b

104) In magnetic disk, density that is in bits per linear inch

a) Increases in moving from the outer most track to the inner most track.
b) Decreases in moving from the outer most track to the inner most track.
c) Remains same in moving from the outer most track to the inner most track.
d) Randomly distributed in moving from the outer most track to the inner most track.
Answer» a

105) Data from and to magnetic disk is transformed in

a) Continuation
b) Blocks
c) Block and Continuation both
d) None of these.
Answer» b

106) In a fixed head disk, the number of read/write head per track are
a) One
b) Two
c) Three
d) Four.
Answer» a
107) CD defines
a) Computer device
b) Computer disk
c) Compact disk
d) None of these
Answer» c

108) Match
A-Fixed-Head disk 1- One head per track and al head are
a) A => 1, B => 2 mounted on rigid arm that extends across all
b) A => 2, B => 1 tracks
B-Movable-Head disk 2- Only one head and head are mounted on
c) A => 1, B => 1 the arm, such that it can position the track.
d) A => 2, B => 2
Answer» a

109) The record is the collection of

a) Fields
b) Files
c) Data base
d) None of these.
Answer» a

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
[Link] 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
115) Match the following for file system architecture:
a) A => 1, B => 2, 3 A-Basic file system 1- Deals with blocks of data
b) A => 1, 2, B => 3 B-Logical I/O module 2- Deals with file records
c) A => 2, 3, B => 1 3- Provides general purpose
record I/O capacity
d) A => 1, 3, B => 2
Answer» a

116) Match the following access rights:

A-Specific user, 1-Individual user who are designated by user I,
B-User group, 2-A set of users who are individually defined,
C-All) 3-Every user has access to the system.
a) A => 1, B => 2, C => 3
b) A => 2, B => 1, C => 3
c) A => 1, B => 3, C => 2
d) A => 3, B => 2, C => 1
Answer» a

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
126) In three tier client/server architecture application software match the following.
a) A => 1, B => 2, C => 3
A- User machine 1- Client
b) A => 1, B => 3, C => 2
B- Middle-tier 2- Application server
c) A => 2, B => 1, C => 3 C- Backend server 3- Data servers
d) A => 3, B => 2, C => 1
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

129) In UNIX process management, the system process runs in

a) Kernel mode only
b) Kernel and user mode both
c) User mode only
d) None of these.
Answer» a
130) In UNIX process management, the user processes run in
a) Kernel mode only
b) Kernel and user mode both
c) User mode only
d) None of these.
Answer» b

131) In UNIX process management, the following is true

a) User process enters kernel mode by issuing a system call when interrupt occurs.
b) Kernel mode is executed in user process.
c) User process enters kernel mode without issuing a system call when interrupt occurs.
d) None of these.
Answer» a

132) The number of process states recognized by UNIX

a) Two
b) Nine
c) Eight
d) Seven.
Answer» b

133) In process management of UNIX system, which of the following process states are
running states in respect of whether the process is executing in user or kernel mode
a) Ready to run (in memory) state
b) Ready to run (in swapped(D) state
c) Preempted state
d) A and C are true
Answer» d
134) A task in a blocked state is
a) Executable
b) Waiting for some temporarily unavailable resource
c) Running
d) None of these
Answer» b

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

136) Priorities
a) are used to schedule processes
b) increase as a process remains in the processor
c) are attached to each page in the system
d) are assigned by the user.
Answer» a

137) Which structure prohibits the sharing of files and directories

a) tree structure
b) one level structure
c) two level structure
d) none of these
Answer» d
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

141) I/O redirection

a) implies changing the name of a file
b) can be employed to use an existing file as input file for a program
c) implies connection to programs through a pipe
d) none of the above
Answer» b
142) When an interrupt occurs, an operating system
a) ignores the interrupt
b) always changes state of interrupted process after processing the interrupt
c) always resumes execution of interrupted process after processing the interrupt
d) may change state of interrupted process to blocked and schedule another process
Answer» d

143) Thrashing
a) reduces page I/O
b) decreases the degree of multi- programming
c) implies excessive page I/O
d) improve the system performance
Answer» c

144) Dirty bit for a page in a page table

a) helps avoid unnecessary writes on a paging device
b) helps maintain LRU information
c) allows only read on a page
d) none of the above
Answer» a

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

149) The strategy of allowing process that are logically run able to be temporarily suspended is
called
a) preemptive scheduling
b) non preemptive scheduling
c) shortest job first
d) first come first served
Answer» a
150) Moving process from main memory to disk is called
a) Scheduling
b) Cache
c) Swapping
d) Spooling
Answer» c

151) The dispatcher

a) actually schedules the tasks into the processor
b) is always very small and simple
c) puts tasks in wait
d) None of these
Answer» a

152) Processor-bound tasks

a) use the processor more often
b) use more processor time
c) use less processor time
d) always take longer to execute
Answer» b

153) The following resources can cause deadlocks

a) Read only files
b) Shared programs
c) Printers
d) All of the above
Answer» c
154) The intensive jobs
a) use less processor time than most jobs
b) you are constrained by their I/O requirements
c) run more quickly than processor- intensive jobs
d) should all be executed at the same time
Answer» b

155) The FIFO algorithm

a) executes first the job that last entered the queue
b) executes first the job that first entered the queue
c) executes first the job with the least processor needs
d) executes first the job that has been in the queue the longest
Answer» b

156) Check pointing a job

a) allows it to be completed successfully
b) allows it to continue executing later
c) prepares it for finishing
d) occurs only when there is an error in it
Answer» b

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

160) Which is/are the most important features of Microsoft windows program?
a) Windows
b) Pull-down menus
c) Icons
d) All of the above
Answer» d

161) Multiprocessing models have

a) symmetric multiprocessing model
b) asymmetric multiprocessing model
c) both (A) and (B) above
d) None of these
Answer» c
162) 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

163) Multiprogramming systems

a) are easier to develop than single programming systems
b) execute each job faster
c) execute more jobs in the same time period
d) are used only one large mainframe computers
Answer» c

164) Virtual memory is

a) simple to implement
b) used on all major commercial operating systems
c) less efficient in utilization of memory
d) useful when fast I/O devices are not available
Answer» c

165) Memory management is

a) not used in modern operating systems
b) replaced with virtual memory on current systems
c) not used on multiprogramming systems
d) critical for even the simplest operating systems
Answer» b
166) Scheduling is
a) allowing job to use the processor
b) making proper use of processor
c) Both A and B
d) None of these
Answer» c

167) Following is true for Multiprocessing

a) It makes the operating system simpler
b) It allows multiple processes to run simultaneously
c) It allows the same computer to have multiple processors
d) None of these
Answer» c

168) A monitor program is a program that

a) interprets the interrupt calls
b) restores the status of the CPU after a function call
c) interprets the input from a keyboard and converts the input into its binary equivalent
d) checks the status of the I/O devices
Answer» c

169) The process scheduler in the processor management unit

a) gives all jobs to the job scheduler
b) selects a job to run
c) selects a process to run
d) co-ordinates the process synchronization
Answer» c
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

172) A critical section is a program segment

a) which should run in a certain specified amount of time
b) which avoids deadlocks
c) where shared resources are accessed
d) which must be enclosed by a pair of semaphore operations.
Answer» c

173) Which of the following is an example of a spooled device?

a) A line printer used to print the output of a number of jobs
b) A terminal used to enter input data to a running program
c) A secondary storage device in a virtual memory system
d) A graphic display device
Answer» a
174) A solution to the Dining Philosophers Problem which avoids deadlock is
a) ensure that all philosophers pick up the left fork before the right fork.
b) ensure that all philosophers pick up the right fork before the left fork.
c) ensure that one particular philosopher picks up the left fork before the right fork, and all other
philosophers pick up the right fork before the left fork.
d) none of the above
Answer» c

175) Locality of reference implies that the page reference being made by a process
a) will always be to the page used in the previous page reference
b) is likely to be to one of the pages used in the last few pages references
c) will always be to one of the pages existing in memory
d) will always lead to a page fault
Answer» b

176) The correct matching for the following pairs

a) A-2, B-4, C-1, D-3
b) A-1, B-2, C-3, D-4
c) A-2, B-1, C-4, D-3
d) None of these
Answer» a

177) Shared sub-directories and files are example of

a) cyclic graph directory
b) tree structured direction
c) one level directory
d) none of these
Answer» a
178) The lowest level of I/O control consists of
a) device drivers
b) interrupt handlers
c) both A and B above
d) none of the above
Answer» c

179) Which type of design problem in file system

a) how the file system should look to the user
b) algorithm and data structure must be created to map the logical file system onto the
secondary storage device
c) Both A and B above
d) none of the above
Answer» c

180) Of the following which is the methods for allocating disks

a) Contiguous
b) Linked
c) Indexed
d) All of the above
Answer» b

181) External fragmentation solved by which allocation?

a) contiguous allocation
b) linked allocation
c) index allocation
d) both B and C
Answer» d
182) Which O/I are best method for allocating?
a) Contiguous
b) Linked
c) Index
d) All of the above
Answer» b

183) The most efficient data set organization is

a) a sequential file
b) an ISAM file
c) variable depending upon the usage of the data set
d) a partitioned data set
Answer» c

184) A partitioned data set is most used for

a) storing program data
b) storing ISAM files
c) a program or source library
d) storing backup information
Answer» c

185) Fragmentation of the file system

a) can always be prevented
b) occurs only if the file system is used improperly
c) can be temporarily removed by compaction
d) is a characteristic of all file systems
Answer» c
186) File record length
a) should always be fixed
b) should always be variable
c) depends upon the size of the file
d) should be chosen to match the data character
Answer» c

187) Disaster recovery

a) is needed by every installation
b) is never needed
c) varies in degree between installations
d) requires off-site computer for immediate use
Answer» c

188) Wild-card specifies

a) provide an easy way of finding groups of related files
b) are only used when printing the contents of files
c) can be used when writing a file
d) allow several files to be read simultaneously
Answer» a

189) The allocation map

a) is used to store program data
b) specifies which blocks are used by which file
c) is updated by applications programs
d) allows programs to erase files
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

202) Thrashing can be avoided if

a) the pages, belonging to the working set of the programs are in main memory
b) the speed of CPU is increased
c) the speed of I/O processor is increased
d) all of the above
Answer» a

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
202) In virtual memory systems, dynamic address translation
a) is the hardware necessary to implement paging
b) stores pages at a specific location on disk
c) is useless when swapping is used
d) is the part of the operating system paging algorithm
Answer» a

203) Relocatable programs

a) cannot be used with fixed partitions
b) can be loaded almost anywhere in memory
c) do not need a linker
d) can be loaded only at one specific location
Answer» b

204) Fixed partitions

a) are very common in current operating systems
b) are very efficient in memory utilization
d) are very inefficient in memory utilization
c) are most used on large mainframe operating systems
Answer» c

205) Virtual system swapping

a) allocates all of memory to one program
b) pages working set pages in and out as a group
c) is never as efficient as normal paging
d) is used only on systems that are thrashing
Answer» d
206) The term paging refers to
a) boosting up the priority of a process in multilevel of queues without feedback
b) gradually increasing the priority of jobs that wait in the system for a long time to remedy
infinite blocking
c) keeping track of the time a page has been in memory for the purpose of LRU replacement
d) letting job reside in memory for a certain amount of time, so that the number of pages
required can be estimated accurately
Answer» b

207) With a segmentation, if there are 64 segments, and the maximum segment size is 512
words, the length of the logical address in bits is
a) 12
b) 14
c) 15
d) 16
Answer» c

208) High paging rate

a) may cause high I/O rate
b) keeps the systems running well
c) is a symptom of too much processor activity
d) always creates a slow system
Answer» a

209) The total time to prepare a disk drive mechanism for a block of data to be read from it is
a) seek time
b) Latency
c) latency plus seek time
d) transmission time
Answer» c
210) Following illustrates Associative Memory
a) The address of the data is supplied by the user
b) Same as the tracks associated with disk memory
c) No need for address; information is used as address
d) Data is accessed serially
Answer» c

211) A disk scheduling algorithm in an operating system causes the disk arm to seek back and
forth across the disk surface servicing all requests in its path, based on
a) First Come First Served
b) Shortest Seek Time First
c) Sean
d) None of these
Answer» c

212) Access to moving head disks requires three periods of delay before information is brought
into memory) The response that correctly lists the three-time delays for the physical access of
data in the order of the relative speed from the slowest to the fastest is
a) latency time, cache overhead time, seek time
b) transmission time, latency time, seek time
c) seek time, latency time, transmission time
d) cache overhead time, latency time, seek time
Answer» c

213) An unpaged cache associates disk domains with the address of the read and continues for a
specific length) The major disadvantage of unpaged cache is that
a) it allows cache domain to contain redundant data
b) it does not allow writes to be cached
c) its access time is greater than that of paged caching
d) read ahead cache domain blocks are necessarily fixed in size
Answer» a
214) UNIX recognizes following I/O devices
a) Disk and Tape drives
b) Terminals
c) Communication lines
d) All the above.
Answer» d

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

216) In a two-level paging scheme, if each page is mapped by a 4-byte (22 bytes) page table
entry, how many bytes are required to create a page table composed of 220-page table entries?
a) 222 bytes
b) 212 bytes
c) 216 bytes
d) None of these
Answer» a

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
229) The page table that is maintained by operating system
a) Shows frame location for each page of the process
b) Shows actual address in main memory
c) Referrer memory location to memory
d) None of these.
Answer» a
230) A situation where two or more processes coordinate their activities based on a condition is
referred as
a) Synchronization
b) Dead lock
c) Starvation
d) Par begin
Answer» a
[Link] system buffer cache, used in UNIX, following not true
a) It is a disk cache
b) It is not a disk cache
c) Data transfer between buffer cache and user process space always occurs using DMA)
d) I/O operations with disk are handled through buffer code.
Answer» b

232) In multi-processor scheduling, independent parallelism indicates

a) There is synchronization among processes at gross level.
b) There is no explicit synchronization among processes.
c) A parallel processing or multi-tasking is done within a single application.
d) None of these.
Answer» b

233) In uni-processor scheduling, the shortest process next policy is

[Link]-preemptive policy 2) Preemptive policy
3.A policy where the process with the shortest expected processing time is selected next.
4.A policy where the process with the shortest expected processing time is not selected)
a) 1 and 4 are true
b) 2 and 3 are true
c) 1 and 3 are true
d) 2 and 4 are true.
Answer» d
234) RAID (Redundant Array of Independent Disks) scheme consists of
a) Five levels from one to six.
b) Six levels, from zero to five.
c) Seven levels, from zero to six.
d) None of these.
Answer» c

235) In disk scheduling when SCAN (Look) policy is applied and when last track reached in
one direction
a) The service direction is reversed and scan proceeds in opposite direction.
b) The arm returns to the opposite end of the disk and scan begins again.
c) A and B both true.
d) None of these.
Answer» a

236) In Dynamic partition of main memory in memory management, the sized of process and
memory partition is
a) of exactly same size
b) of different size.
c) Both A and B true
d) None is true
Answer» a

237) Par begin (P1)

a) Suspends main program, execute procedure P1 and after execution resume main program.
b) Procedure P1 is delayed infinitely due to other procedure are given preference.
c) Procedure P1 is not considered for execution.
d) None of these.
Answer» a
238) In round robin (time slicing) policy applied on uni processor scheduling
a) When interrupt occurs, the currently running process is placed in ready queue, and next ready
job is selected in First come First serve basis.
b) When interrupt occurs, the currently running process is placed in ready queue and next ready
job is selected in random order.
c) No interruption is entertained)
d) None of these.
Answer» a

239) The transfer time in disk scheduling is

a) Proportional to rotation speed)
b) Inversely proportional to rotation speed)
c) Equal to rotation speed)
d) None of these.
Answer» a
240) In aperiodic (real time) tasks
a) The dead line for start is mandatory, but for finish it is not.
b) The dead line for finish is mandatory, but for start it is not.
c) The dead line for finish and start is mandatory.
d) The dead line for finish and start is not mandatory.
Answer» c

241) Match the following in RAID scheme:

a) A - 1, 3 and B - 2 A-Parallel access array 1-All member disks participate in the
b) A - 1, and B - 2, 3 execution of every I/O request
c) A - 2 and B - 1, 3 B-Independent access array 2-Each member disk participates
d) A - 1, 2 and B - 3 separately in the execution of every
Answer» a I/O request
3-Here spindles of the individual
drives are synchronized so that each
disk head is in the same position on
each disk at any given time

242) The RAID scheme indicates

a) Random access of information data)
b) Random array of independent disks.
c) Redundant array of independent disks.
d) Redundant access of information data)
Answer» d

243) Which of the following is not human readable I/O device?

a) Video display terminals
b) Key board
c) Printers
d) Disk drives
Answer» d

244) In multiprocessor scheduling;

a) A - 1, B - 2, C - 3
b) A - 2, B - 3, C - 1
c) A - 3, B - 2, C - 1
d) A - 1, B - 3, C - 2
Answer» a
245) In disk storage devices the width of head is:
a) Same of the track
b) More than of the track
c) Less than of the track
d) None is true.
Answer» a

246) In disk scheduling, SCAN algorithm states

a) The arm is required to move in one direction only.
b) The arm can be moved in any direction.
c) The arm is fixed)
d) None of these.
Answer» a

247) In last- in-first- out, disk scheduling policy

a) Recently received request is entertained at the last.
b) Recently received request is entertained first.
c) Requests are selected at random
d) None of these.
Answer» b

248) In uni-processor scheduling, if non preemptive policy is applied then

a) Once a process is in running state, it continues to execute until it terminates or block itself.
b) Currently running process can be interrupted and moved to ready state by the operating
system.
c) The clock interrupt is generated at periodic intervals.
d) None of these.
Answer» a

249) In RAID (Redundant Array of Independent Disks) scheme, which of the following RAID
level does not include redundancy to improve performance?
a) RAID level 0
b) RAID level 1
c) RAID level 2
d) RAID level 4
Answer» a

250) The operations of the processor are supervised by

a) Control and Status register
b) Data register.
c) Address register.
d) None of these.
Answer» a
251) Execution 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
d) all of the above
Answer» c

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

253) Allocate the first hole that is big enough is called

a) first fit
b) best fit
c) worst fit
d) all of the above
Answer» a

254) The access time in disk scheduling is

a) The time taken to position the head at the track.
b) The time taken to reach the beginning of the sector of the track.
c) The sum of seek time and rotational delay.
d) None of these.
Answer» c

255) The following RAID level employer parallel access technique and single redundant disk
a) RAID level 0
b) RAID level 1
c) RAID level 2
d) RAID level 3
Answer» d

256) In disk scheduling, the seek time is

a) The time taken to position the head at the track.
b) The time taken to reach the beginning of sector once the track is selected)
c) A and B both.
d) None of these.
Answer» a
257) Given three switch processes, when they occur match them
(1) Clock Interrupt, (2) I/O Interrupt, (3) Memory fault
A- The processor encounters a virtual memory address reference for a word that is not in the
main memory)
B- The operating system determines whether the currently running process has been executed
for the maximum allowable time slice)
C- The operating system determines the I/O action that occurs.
a) 1-A, 2-B, 3-C
b) 1-B, 2-C, 3-A
c) 1-B, 2-A, 3-C
d) 1-C, 2-B, 3-A)
Answer» b

258) In the given operating system match the correct (i) Thread (ii) Process (A) The unit of
resource ownership) (B) The unit of dispatching.
a) (i) A and (ii) B
b) (i) B and (ii) A
c) (i) A, B
d) (ii) A, B)
Answer» c

259) In I/O management when buffering is allowed then: Statement A: Input transfer is
performed before request is made) Statement B: Output transfer is performed after request is
made) Statement A and B are both true
a) Statement A and B are both false
b) Statement A is true but Statement B is false
c) Statement B is true but statement A is false.
d) None of these.
Answer» d

260) Process is
a) a program in high level language kept on disk
b) contents of main memory
c) a program in execution
d) a job in secondary memory
Answer» c

261) In uni-processor management processor through put

a) Is a measure of how much work is being performed
b) Is the percentage of time that the processor is busy
c) Is a time interval between the submission of a process and its completion
d) None of these
Answer» a
262) Complex scheduling algorithms
a) use more resources than they gain
b) recover more resources than they use
c) always use many resources
d) are most appropriate for very large computers
Answer» d

263) When preemptive policy is applied to uniprocessor scheduling then

a) Once a process is in running state, it continues to execute until it terminates or block itself.
b) Currently running process can be interrupted and moved to ready state by the operating
system.
c) The processes are assigned priorities.
d) None of these.
Answer» b

264) The demand paging and pre paging of virtual memory management are
A - Fetch, B -Demand paging, C -Prepaging;
1-Determines when a page should be bought into main memory)
2- A page is bought into main memory only when a reference is made to a location on that page.
3-Pages other than the one demanded by a page fault are bought in.
a) A - 1, B - 2, C - 3
b) A - 3, B - 2, C - 1
c) A - 2, B - 3, C - 1
d) A - 3, B - 1, C - 2
Answer» a

265) The UNIX scheduling gives

a) Highest preference to real time processes
b) Highest preference to kernel mode processes
c) Highest preference to user mode processes
d) Highest preference to shared processes.
Answer» a

266) In shortest service time first policy, applied on disk scheduling, the disk request is selected
a) That requires the least movement of disk arm from its current position.
b) That requires the maximum movement of disk arm from its current position.
c) That is recently received)
d) On random.
Answer» a
267) Which of the RAID level does not employ independent access technique?
a) RAID 6
b) RAID 5
c) RAID 4
d) RAID 3
Answer» d
268) The normalized turnaround time is
a) Ratio of turnaround time to service time
b) Ratio of turnaround time to waiting time
c) Ratio of service time to waiting time
d) Ratio of waiting time to service time.
Answer» a

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

270) In disk scheduling, the shortest service time first policy selects the disk request that
a) In cure the maximum seek time
b) In cure the minimum seek time
c) Is received first
d) Is received at last.
Answer» b

271) The time table of railway, and airline which defines arrival and departure can be
considered as
a) Hard real time scheduling
b) Soft real time scheduling
c) None real time scheduling.
d) None of these.
Answer» a

272) In uni-processor scheduling, shortest remaining time policy is

a) A policy where scheduler chooses the process that has the shortest expected remaining
processing time.
b) A policy where scheduler discards the process that has the shortest expected remaining
process time.
c) A policy where process with shortest expected processing time is selected next.
d) None of these.
Answer» a
273) The C-SCAN, in disk scheduling states
a) The arm movement is uni directional
b) The arm movement is bidirectional
c) The are is to be state fixed
d) None of these.
Answer» c

274) The RAID (Redundant Array of Independent Disks) level one requires
a) Same disk space of the logical disk that it supports.
b) Twice disk space of the logical disk that it supports.
c) Thrice disk space of the logical disk that it supports.
d) Half disk space of the logical disk that it supports.
Answer» b

275) In dynamic loading

a) for better memory utilization use dynamic loading
b) it does not require special support from the operating system
c) disadvantage is unused routine is never loaded
d) all of the above
Answer» d

276) In RAID scheme, which of the RAID level does not use parity calculation in redundancy
achievement
a) RAID 4
b) RAID 3
c) RAID 2
d) RAID 1
Answer» d

277) In the simple paging in memory management were

a) Process can be loaded into a partition of equal or greater size.
b) Process is loaded into a partition of exactly same size.
c) Process is divided into a number of equal size pages of same length as of frames.
d) None of these.
Answer» c

278) The Vector and array processors fall into

a) Single Instruction Single Data (SIS(D) stream
b) Single Instruction Multiple Data (SIM(D) stream.
c) Multiple Instruction Single Data (MIS(D) stream.
d) Multiple Instruction Multiple Data (MIM(D) system.
Answer» b
279) In uni-processor scheduling :(A) Turnaround time, B) Response time),
1: A time interval between the submission of a process and its completion.
2: For interactive process, it is a time from the submission of a request until the response begins
to received)
3: It includes actual execution time plus time spent waiting for resources.
a) A - 1, 2, B - 3
b) A - 1, 3, B - 2
c) A - 2, B - 1, 2
d) A - 2, B - 1, 3
Answer» b

280) The direct memory access (DM(A) module

a) Controls the data exchange between main memory and I/O module.
b) The processor issues I/O command, execute subsequent instructions and interrupt I/O
module.
c) The processor issues I/O commands to an I/O module.
d) None of these.
Answer» a

281) Dijkstra's banker's algorithm in an operating-system solves the problem of

a) deadlock avoidance
b) deadlock recovery
c) mutual exclusion
d) context switching
Answer» a

282) On magnetic disks, the data on the platter is organized in a concentric set of rings called
a) Sectors
b) Gaps
c) Rings
d) Tracks
Answer» d

283) In memory management Free page list is: A- A list of page frames available for reading in
pages) B- A list where the replaced page is assigned without modification) C-A list where the
replaced page is assigned with modification.
a) A, B, C are true
b) A and B are true
c) A and C are true
d) B and C are true.
Answer» b
 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