1. A platform for other software to run on is called ________________.

a) Operating system
b) system software
c) Application software
d) All.
Ans:a

2. Semaphore is a/an _____________to solve the critical section problem.

a)Hardware for a system
b)Special program for a system
c) Integer variable
d) None
Ans:c

3. A system is in the safe state if___________.

a)The system can allocate resources to each process in some order and
still avoid a deadlock
b) There exit a safe sequence
c) all of the mentioned
d)none of the mentioned
Ans:a

4. The critical wait condition can be prevented by__________________.

a)defining a linear ordering of resource types
b)Using thread
c)Using pipes
d) All of the mentioned
Ans: a

5. A memory buffer used to accommodate a speed differential is called

____________
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Ans:b

6. A memory buffer used to accommodate a speed differential is called

____________
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Ans:c
7. Run time mapping from virtual to physical address is done by ____________
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
Ans:a

8. Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned
Ans:b

9. The address of a page table in memory is pointed by ____________

a) stack pointer
b) page table base register
c) page register
d) program counter
Ans:b

10. Program always deals with ____________.

a) logical address
b) absolute address
c) physical address
d) relative address
Ans:a

11. What is the operating system?

a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt
vector)
d) none of the mentioned
Ans:c

12. In contiguous memory allocation ____________

a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
Ans:a
13. The relocation register helps in ____________
a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned
Ans:c
14. With relocation and limit registers, each logical address must be _______ the
limit register.
a) less than
b) equal to
c) greater than
d) none of the mentioned
Ans:a

15. The operating system and the other processes are protected from being
modified by an already running process because ____________
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the
relocation and limit registers
Ans:d

16. Transient operating system code is code that ____________

a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space
Ans:b

17. Using transient code, _______ the size of the operating system during program
execution.
a) increases
b) decreases
c) changes
d) maintains
Ans:c

18. When memory is divided into several fixed sized partitions, each partition may
contain ________
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
Ans:a
19. Logical memory is broken into blocks of the same size called _________
a) frames
b) pages
c) backing store
d) none of the mentioned
Ans:b

20. Every address generated by the CPU is divided into two parts. They are
____________
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
Ans:b

21. The __________ is used as an index into the page table.

a) frame bit
b) page number
c) page offset
d) frame offset
Ans:b

22. The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
Ans:c

23. With paging there is no ________ fragmentation.

a) internal
b) external
c) either type of
d) none of the mentioned
Ans:b

24. The operating system maintains a ______ table that keeps track of how many
frames have been allocated, how many are there, and how many are available.
a) page
b) mapping
c) frame
d) memory
Ans:c
25. Paging increases the ______ time.
a) waiting
b) execution
c) context – switch
d) all of the mentioned
Ans:c

26. Smaller page tables are implemented as a set of _______

a) queues
b) stacks
c) counters
d) registers
Ans:d

27. The page table registers should be built with _______

a) very low speed logic
b) very high speed logic
c) a large memory space
d) none of the mentioned
Ans:b

28. For larger page tables, they are kept in main memory and a __________ points
to the page table.
a) page table base register
b) page table base pointer
c) page table register pointer
d) page table base
Ans:a

29. For every process there is a __________

a) page table
b) copy of page table
c) pointer to page table
d) all of the mentioned
Ans:a

30. Time taken in memory access through PTBR is ____________

a) extended by a factor of 3
b) extended by a factor of 2
c) slowed by a factor of 3
d) slowed by a factor of 2
Ans:d
31. In paging the user provides only ________ which is partitioned by the
hardware into ________ and ______
a) one address, page number, offset
b) one offset, page number, address
c) page number, offset, address
d) none of the mentioned
Ans:a

32. Each entry in a segment table has a ____________

a) segment base
b) segment peak
c) segment value
d) none of the mentioned
Ans:a

33. The segment base contains the ____________

a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned
Ans:b

34. The segment limit contains the ____________

a) starting logical address of the process
b) starting physical address of the segment in memory
c) segment length
d) none of the mentioned
Ans:c

35. The offset ‘d’ of the logical address must be ____________

a) greater than segment limit
b) between 0 and segment limit
c) between 0 and the segment number
d) greater than the segment number
Ans:b

36. If the offset is legal ____________

a) it is used as a physical memory address itself
b) it is subtracted from the segment base to produce the physical memory
address
c) it is added to the segment base to produce the physical memory address
d) none of the mentioned
Ans:a
37. When the entries in the segment tables of two different processes point to the
same physical location ____________
a) the segments are invalid
b) the processes get blocked
c) segments are shared
d) all of the mentioned
Ans:c

38. The protection bit is 0/1 based on ____________

a) write only
b) read only
c) read – write
d) none of the mentioned
Ans:c

39. If there are 32 segments, each of size 1Kb, then the logical address should have
____________
a) 13 bits
b) 14 bits
c) 15 bits
d) 16 bits
Ans:a

40. Consider a computer with 8 Mbytes of main memory and a 128K cache. The
cache block size is 4 K. It uses a direct mapping scheme for cache
management. How many different main memory blocks can map onto a given
physical cache block?
a) 2048
b) 256
c) 64
d) 8
Ans:c

41. A multilevel page table is preferred in comparison to a single level page table
for translating virtual address to physical address because ____________
a) it reduces the memory access time to read or write a memory location
b) it helps to reduce the size of page table needed to implement the virtual
address space of a process
c) it is required by the translation lookaside buffer
d) it helps to reduce the number of page faults in page replacement
algorithms
Ans:b
42. A ____ a set of wires and a rigidly defined protocol that specifies a set of
messages that can be sent on the wires.
a) port
b) node
c) bus
d) none of the mentioned
Ans:c

43. When device A has a cable that plugs into device B, and device B has a cable
that plugs into device C and device C plugs into a port on the computer, this
arrangement is called a _________
a) port
b) daisy chain
c) bus
d) cable
Ans:b

44. The _________ present a uniform device-access interface to the I/O subsystem,
much as system calls provide a standard interface between the application and
the operating system.
a) Devices
b) Buses
c) Device drivers
d) I/O systems
Ans:c

45. A ________ is a collection of electronics that can operate a port, a bus, or a

device.
a) controller
b) driver
c) host
d) bus
Ans:a

46. The ______ register is written by the host to send output.

a) status
b) control
c) data in
d) data out
Ans:d
47. The hardware mechanism that allows a device to notify the CPU is called
_______
a) polling
b) interrupt
c) driver
d) controlling
Ans:b

48. The _________ determines the cause of the interrupt, performs the necessary
processing and executes a return from the interrupt instruction to return the
CPU to the execution state prior to the interrupt.
a) interrupt request line
b) device driver
c) interrupt handler
d) all of the mentioned
Ans:c

49. The __________ is used by device controllers to request service.

a) nonmaskable interrupt
b) blocked interrupt
c) maskable interrupt
d) none of the mentioned
Ans:c

50. The interrupt vector contains ____________

a) the interrupts
b) the memory addresses of specialized interrupt handlers
c) the identifiers of interrupts
d) the device addresses
Ans:b

51. Division by zero, accessing a protected or non existent memory address, or

attempting to execute a privileged instruction from user mode are all
categorized as ________
a) errors
b) exceptions
c) interrupt handlers
d) all of the mentioned
Ans:b

52. For large data transfers, _________ is used.

a) dma
b) programmed I/O
c) controller register
d) none of the mentioned
Ans:a
53. A character stream device transfers ____________
a) bytes one by one
b) block of bytes as a unit
c) with unpredictable response times
d) none of the mentioned
Ans:a

54. A block device transfers ____________

a) bytes one by one
b) block of bytes as a unit
c) with unpredictable response times
d) none of the mentioned
Ans:b

55. What is a dedicated device?

a) opposite to a sharable device
b) same as a sharable device
c) can be used concurrently by several processes
d) none of the mentioned
Ans:a

56. A keyboard is an example of a device that is accessed through a __________

interface.
a) block stream
b) set of blocks
c) character stream
d) none of the mentioned
Ans:c

57. In polling ____________

a) busy – wait cycles wait for I/O from device
b) interrupt handler receives interrupts
c) interrupt-request line is triggered by I/O device
d) all of the mentioned
Ans:a

58. A non blocking system call _________________

a) halts the execution of the application for an extended time
b) does not halt the execution of the application
c) does not block the interrupts
d) none of the mentioned
Ans:b
59. An asynchronous call ____________
a) returns immediately, without waiting for the I/O to complete
b) does not return immediately and waits for the I/O to complete
c) consumes a lot of time
d) is too slow
Ans:a

60. When a page fault occurs before an executing instruction is complete if

____________
a) the instruction must be restarted
b) the instruction must be ignored
c) the instruction must be completed ignoring the page fault
d) none of the mentioned
Ans:a

61. Consider a machine in which all memory reference instructions have only one
memory address, for them we need at least _____ frame(s).
a) one
b) two
c) three
d) none of the mentioned
Ans:b

62. The algorithm in which we allocate memory to each process according to its
size is known as ____________
a) proportional allocation algorithm
b) equal allocation algorithm
c) split allocation algorithm
d) none of the mentioned
Ans:a

63. With either equal or proportional algorithm, a high priority process is treated
___________ a low priority process.
a) greater than
b) same as
c) lesser than
d) none of the mentioned
Ans:b

64. _________ replacement allows a process to select a replacement frame from

the set of all frames, even if the frame is currently allocated to some other
process.
a) Local
b) Universal
c) Global
d) Public Ans:c
65. _________ replacement allows each process to only select from its own set of
allocated frames.
a) Local
b) Universal
c) Global
d) Public
Ans:a

66. One problem with the global replacement algorithm is that ____________
a) it is very expensive
b) many frames can be allocated to a process
c) only a few frames can be allocated to a process
d) a process cannot control its own page – fault rate
Ans:d

67. ________ replacement generally results in greater system throughput.

a) Local
b) Global
c) Universal
d) Public
Ans:b

68. Thrashing _______ the CPU utilization.

a) increases
b) keeps constant
c) decreases
d) none of the mentioned
Ans:c

69. What is a locality?

a) a set of pages that are actively used together
b) a space in memory
c) an area near a set of processes
d) none of the mentioned
Ans:a

70. When a subroutine is called ____________

a) it defines a new locality
b) it is in the same locality from where it was called
c) it does not define a new locality
d) none of the mentioned
Ans:a
71. A program is generally composed of several different localities, which _____
overlap.
a) may
b) must
c) do not
d) must not
Ans:a

72. To create a file ____________

a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in
directory
d) none of the mentioned
Ans:c

73. By using the specific system call, we can ____________

a) open the file
b) read the file
c) write into the file
d) all of the mentioned
Ans:d

74. File type can be represented by ____________

a) file name
b) file extension
c) file identifier
d) none of the mentioned
Ans:b

75. Which file is a sequence of bytes organized into blocks understandable by the
system’s linker?
a) object file
b) source file
c) executable file
d) text file
Ans:a

76. A file control block contains the information about ____________

a) file ownership
b) file permissions
c) location of file contents
d) all of the mentioned
Ans:d
77. Which table contains the information about each mounted volume?
a) mount table
b) system-wide open-file table
c) per-process open-file table
d) all of the mentioned
Ans:d

78. To create a new file application program calls ____________

a) basic file system
b) logical file system
c) file-organisation module
d) none of the mentioned
Ans:b

79. What will happens when a process closes the file?

a) per-process table entry is not removed
b) system wide entry’s open count is decremented
c) all of the mentioned
d) none of the mentioned
Ans:b

80. What is raw disk?

a) disk without file system
b) empty disk
c) disk lacking logical file system
d) disk having file system
Ans:a

81. The data structure used for file directory is called ____________
a) mount table
b) hash table
c) file table
d) process table
Ans:b

82. In which type of allocation method each file occupy a set of contiguous block
on the disk?
a) contiguous allocation
b) dynamic-storage allocation
c) linked allocation
d) indexed allocation
Ans:a
83. If the block of free-space list is free then bit will ____________
a) 1
b) 0
c) any of 0 or 1
d) none of the mentioned
Ans:a

84. File attributes consist of ____________

a) name
b) type
c) identifier
d) all of the mentioned
Ans:d

85. The information about all files is kept in ____________

a) swap space
b) operating system
c) seperate directory structure
d) none of the mentioned
Ans:c

86. A file is a/an _______ data type.

a) abstract
b) primitive
c) public
d) private
Ans:a

87. The operating system keeps a small table containing information about all open
files called ____________
a) system table
b) open-file table
c) file table
d) directory table
Ans:b

88. The open file table has a/an _______ associated with each file.
a) file content
b) file permission
c) open count
d) close count
Ans:c
89. Which of the following are the two parts of the file name?
a) name & identifier
b) identifier & type
c) extension & name
d) type & extension
Ans:c

90. The directory can be viewed as a _________ that translates file names into
their directory entries.
a) symbol table
b) partition
c) swap space
d) cache
Ans:a

91. What will happen in the single level directory?

a) All files are contained in different directories all at the same level
b) All files are contained in the same directory
c) Depends on the operating system
d) None of the mentioned
Ans:b

92. When a user job starts in a two level directory system, or a user logs in
_____________
a) the users user file directory is searched
b) the system’s master file directory is not searched
c) the master file directory is indexed by user name or account number, and
each entry points to the UFD for that user
d) all of the mentioned
Ans:c

93. When a user refers to a particular file?

a) system MFD is searched
b) his own UFD is not searched
c) both MFD and UFD are searched
d) every directory is searched
Ans:c

94. The current directory contains, most of the files that are _____________
a) of current interest to the user
b) stored currently in the system
c) not used in the system
d) not of current interest to the system
Ans:a
 95. Which of the following are the types of Path names?
a) absolute & relative
b) local & global
c) global & relative
d) relative & local
Ans:a

96. In contiguous allocation _____________

a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned
Ans:a

97. n linked allocation _____________

a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) none of the mentioned

98. Caching is ________ spooling.

a) same as
b) not the same as
c) all of the mentioned
d) none of the mentioned
Ans:b

99. Caching ____________

a) holds a copy of the data
b) is fast memory
c) holds the only copy of the data
d) holds output for a device
Ans:a

100. The kernel data structures include ____________

a) process table
b) open file table
c) close file table
d) all of the mentioned
Ans:b

101. Windows NT uses a __________ implementation for I/O.

a) message – passing
b) draft – passing
c) secondary memory
d) cache Ans:a
102. A ________ is a full duplex connection between a device driver and a user
level process.
a) Bus
b) I/O operation
c) Stream
d) Flow
Ans:c

103. I/O is a _________ in system performance.

a) major factor
b) minor factor
c) does not matter
d) none of the mentioned
Ans:a

104. Hard real time operating system has ______________ jitter than a soft real
time operating system.
a) less
b) more
c) equal
d) none of the mentioned
Ans:a

105. For real time operating systems, interrupt latency should be ____________
a) minimal
b) maximum
c) zero
d) dependent on the scheduling
Ans:a

106. In rate monotonic scheduling ____________

a) shorter duration job has higher priority
b) longer duration job has higher priority
c) priority does not depend on the duration of the job
d) none of the mentioned
Ans:a

107. In which scheduling certain amount of CPU time is allocated to each process?
a) earliest deadline first scheduling
b) proportional share scheduling
c) equal share scheduling
d) none of the mentioned
Ans:b
108. The problem of priority inversion can be solved by ____________
a) priority inheritance protocol
b) priority inversion protocol
c) both priority inheritance and inversion protocol
d) none of the mentioned
Ans:a

109. Time duration required for scheduling dispatcher to stop one process and start
another is known as ____________
a) process latency
b) dispatch latency
c) execution latency
d) interrupt latency
Ans:b

110. Time required to synchronous switch from the context of one thread to the
context of another thread is called?
a) threads fly-back time
b) jitter
c) context switch time
d) none of the mentioned
Ans:c

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

a) RTLinux
b) VxWorks
c) Windows CE
d) All of the mentioned
Ans:d

112. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of
80 and a CPU burst of 35. The total CPU utilization is ____________
a) 0.90
b) 0.74
c) 0.94
d) 0.80
Ans:c

113. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of
80 and a CPU burst of 35., the priorities of P1 and P2 are?
a) remain the same throughout
b) keep varying from time to time
c) may or may not be change
d) none of the mentioned
Ans:b
114. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of
80 and a CPU burst of 35., can the two processes be scheduled using the EDF
algorithm without missing their respective deadlines?
a) Yes
b) No
c) Maybe
d) None of the mentioned
Ans:a

115. Using EDF algorithm practically, it is impossible to achieve 100 percent

utilization due to __________
a) the cost of context switching
b) interrupt handling
c) power consumption
d) all of the mentioned
Ans:a

116. If there are a total of T = 100 shares to be divided among three processes, A, B
and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20
shares.B will have ______ percent of the total processor time.
a) 20
b) 15
c) 50
d) none of the mentioned
Ans:b

117. If there are a total of T = 100 shares to be divided among three

processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is
assigned 20 shares.C will have ______ percent of the total processor time.
a) 20
b) 15
c) 50
d) none of the mentioned
Ans:a

118. In which type of streaming multimedia file is delivered to the client, but
not shared?
a) real-time streaming
b) progressive download
c) compression
d) none of the mentioned
Ans:c
119. Which one of the following is the characteristic of a multimedia system?
a) high storage
b) high data rates
c) both high storage and high data rates
d) none of the mentioned
Ans:c

120. The delay that occur during the playback of a stream is called
___________
a) stream delay
b) playback delay
c) jitter
d) event delay
Ans:c

121. Which algorithm can be optimized to meet the timing deadlines and rate
requirements of continuous media?
a) Earliest-Deadline-First scheduling
b) SCAN-EDF scheduling
c) Both Earliest-Deadline-First scheduling & SCAN-EDF scheduling
d) None of the mentioned
Ans:c

122. Real time streaming protocol is used ___________

a) to control streaming media servers
b) for establishing and controlling media sessions between endpoints
c) to provide real time control of playback of media files from the server
d) all of the mentioned
Ans:d

123. In teardown state of real time streaming protocol is ___________

a) the server resources for client
b) server delivers the stream to client
c) server suspends delivery of stream
d) server breaks down the connection
Ans:d

124. CineBlitz multimedia server supports ___________

a) real time clients
b) non-real time clients
c) both real time & non-real time clients
d) none of the mentioned
Ans:c
 125. Multimedia system require hard real time scheduling ___________
a) to ensure critical tasks will be serviced within timing deadlines
b) to deliver the media file to the client
c) to minimize the delay
d) for security
Ans:a

126. The priority of a process will ______________ if the scheduler assigns

it a static priority.
a) change
b) remain unchanged
c) depends on the operating system
d) none of the mentioned
Ans:b

127. As disks have relatively low transfer rates and relatively high latency
rates, disk schedulers must reduce latency times to ___________
a) ensure high bandwidth
b) ensure low bandwidth
c) make sure data is transferred
d) reduce data transfer speeds
Ans:a

128. Servicing requests strictly according to deadline using EDF may result
in ___________
a) lower seek times
b) lower bandwidth
c) higher seek time
d) higher bandwidth
Ans:c

129. The hybrid algorithm that combines EDF with SCAN algorithm is
known as ___________
a) EDS
b) SDF
c) SCAN-EDF
d) None of the mentioned
Ans:c

130. Unicasting delivers the content to ___________

a) a single client
b) all clients, regardless whether they want the content or not
c) a group of receivers who indicate they wish to receive the content
d) none of the mentioned
Ans:a
131. Broadcasting delivers the content to ___________
a) a single client
b) all clients, regardless whether they want the content or not
c) a group of receivers who indicate they wish to receive the content
d) none of the mentioned
Ans:b

132. Multicasting delivers the content to ___________

a) a single client
b) all clients, regardless whether they want the content or not
c) a group of receivers who indicate they wish to receive the content
d) none of the mentioned
Ans:c

133. RTSP stands for ___________

a) Real Time Streaming Policy
b) Real Time Streaming Protocol
c) Real Time Systems Protocol
d) Read Time Streaming Policy
Ans:b

134. In the SETUP state ___________

a) the server is setup
b) the client is setup
c) the server allocates resources for the client session
d) the client sends requests to the server
Ans:c

135. In the TEARDOWN state ___________

a) the server breaks down the connection and releases the resources
allocated for the session
b) the client breaks down the connection and releases the resources
allocated for the session
c) the system crashes
d) none of the mentioned
Ans:a

136. RTP stands for ___________

a) real time protocol
b) real time transmission control protocol
c) real time transmission protocol
d) real time transport protocol
Ans:d
137. The layer between the hardware and the user program
is_________________.
a) operating environment
b) system environment
c) operating system
d) None .
Ans:c

**************************