Mit 822 2014-2015 With Answers All Multiple
Mit 822 2014-2015 With Answers All Multiple
Modularity
DEPARTMENT OF COMPUTER SCIENCES c. Process scheduling d. Synchronization
SECOND SEMESTER 2014/2015
POSTGRADUATE EXAMINATIONS e. None of the above
MIT 822 –OPERATING SYSTEMS
8. One is not a reason for introducing concurrent
Instruction: Shade the correct answers on the
processing
provided OMR sheet.
a. Information sharing b. Computation speed up
Do indicate your name and your Matriculation
number on the question paper and at the back of c. Modularity d. Convenience
the OMR sheet. Submit your question paper at the
e. None of the above
end of the examination.
Time Allowed: 75
Minutes 9. The hardware would not function normally in the
absence of
a. compiler b. assembler
c. operating system d. CD drive
1. One is true
a. A pre-emptive kernel allows a process in user mode e. All of the above
to be suspended
b. A pre-emptive kernel allows a process in kernel Given the table below, answer questions 10 -14
mode to be suspended Process Arrival Service Process size in Time
c. A pre-emptive kernel allows a process in both user Order priority KB Required
and kernel modes to be suspended in seconds
d. A pre-emptive kernel allows a process in user or A 2 3 3 4
kernel mode to be suspended B 1 1 2 2
e. None of the above C 3 2 7 3
2. A concept when a migrated process specifies the 10. Using FCFS scheduling discipline, process C will leave
processor to migrate to is called at the end of __ seconds
a. Hard migration b. Soft migration a. 7th b. 8th
c. Soft affinity d. Hard affinity c. 5 th
d. 4th
e. None of the above e. 9th
3. A concept when a process is allowed to run to 11. The earliest start time of process A using round robin
completion on only one processor is called with quantum 2 is
a. Migration b. Affinity a. 7 b. 2
c. Granularity d. Threading c. 5 d. 4
e. None of the above e. 9
4. One of these implements one-to-one multithreading 12. The turn-around time of process C using SRTF is
model a. 7 b. 2
a. Windows 98 b. Linux c. 5 d. 4
c. Windows NT d. Windows XP
e. 9
e. All of the above
5. A thread does not have the attribute
13. The turn-around time of process A using SJF is
a. Thread ID b. Program counter
a. 7 b. 2
c. Register set d. A stack
c. 5 d. 4
e. None of the above
e. 9
16. The marriage between computer industry and 24. One is a flavour of Linux
telecommunication industry is called
a. Data b. Information a. Debian b. Fedora
communication communication c. Red Hat d. OpenSuse
c. network d. Local Area network e. All of the above
e. 9
25. One is a Linux permission
17. The protocol driven a network must be able to resolve a. Execute b. Group
a. Signal differences b. Data format differences c. Directory d. Others
c. Errors d. Data sequencing e. All of the above
e. All of the above
26. One is a flavour of Linux
18. A device that ensure enforcement of rules as data a. Debian b. Fedora
passes through different path to destination is called c. Red Hat d. OpenSuse
a. Gateway b. Router e. All of the above
c. Bridge d. Brouter
e. None of the above 27. In rw-rw-r permission mode, the group is not given __
permission
a. Execute only b. Directory
19. A process reaches critical section when
a. A running process does not know what to do c. Write and Execute d. Read and Write
b. A running process makes an attempt to get hold of e. None of the above
shareable resource
c. A process gets to an instruction that requires the
28. In a functionally coupled processor environment
use of shared resource
a. There is only one RAM
d. Processes agree on how to used shareable resource
b. Each processor has its own RAM
e. All of the above
c. Deadlock is less pronounced
d. Processors are not starved
20. One of the various interactions in a concurrent e. None of the above
environment is that
a. Process is not aware of existence of other processes
b. Process is indirectly aware of other processes The degree of synchronization among processes in a
29. concurrent environment is called
c. Process is directly aware of other processes
d. Processes agree on how to used shareable resource a. Affinity b. Granularity
e. All of the above c. Monitor d. Segmentation
e. Semaphore
21. A relationship that can exist in a concurrent
environment is
30. A gang scheduling is different from dynamic scheme
a. Competition
in that
b. Cooperation by sharing
a. In gang, each processor selects a thread from a
c. Cooperation by communication
global queue
d. All of the above
b. In dynamic, each processor selects a thread from a
e. None of the above
global queue
c. In gang, set of processors attend to set of threads
22. One is not a problem in concurrent environment d. In dynamic, set of processors attend to set of threads
a. Less stress in managing resource e. None of the above
b. Starvation of processors
c. A reproducible result
In concurrent environment, ___ is migrated
d. Inconsistent data alteration
e. None of the above 31.
a. PCB b. Process ID
c. Process state d. Process priority
23. One is not a reason for deadlock
e. All of the above b. RAM
c. Cache
32. In operating system,------ resides in the RAM to d. All of the above
control all other programmes e. None of the above
a. Operating system b. Executive programs
c. Running d. Language programs 41. This determines the architectural size of a computer
programs system
e. All of the above a. Size of general purpose register
b. Size of the data bus
33. Running a user programme involves c. The word length of the computer
a. Initiating the language processor d. All of the above
b. Providing the data to be used e. None of the following
c. Initiating execution of the object program
d. Collection the result from memory 42. A memory can hold one of these
e. All of the above a. Data
b. Instruction
34. This is one of the system programs c. Address
d. All of the above
a. Operating system b. Language processor
e. None of the following
c. Utility software d. All of the above
e. None of d above 43. The fastest access memory is the
a. Register
35. One of the services provided by an utility program is b. Cache
a. File conversion b. File copy c. RAM
d. ROM
c. House keeping d. All of the above
e. Disk
operation
e. None of the above
44. Disk locations are identified by its
a. Address
36. One of the following options is not a generalised
b. Track
software
c. Sector
a. Payroll b. Correl draw
d. Cylinder
c. Page maker d. Instored
e. All of the above
e. Mozilla firefox
45. The main task of the memory module is to
37. Software subsystem provides one of these a. Bring processes into the main memory
a. Enhances the capability of hardware machine b. Coalesce memory fragments
b. Increases the speed of CPU c. Swap processes
c. Adds to the overhead of a computer system d. Address each memory cell
d. Renders the hardware system void of operation e. All of the above
e. All of the above
46. Frame is to memory cell as page is to __
38. A reason for formatting a memory is to a. A process
a. Give each cell an address b. A program
b. Divide into memory cells c. RAM
c. Detect bad memory cells d. Processor
d. All of the above e. Processor clock
e. None of the above
47. A type of fragment that cannot be coalesced is the
39. In terms of volatility, one is the most volatile a. External
a. Register b. Internal
b. RAM c. Segments
c. Disk d. Pages
d. ROM e. Frames
e. All of the above
48. No external fragment is a strength of one of these
40. Processor has direct access to memory techniques
a. Register a. Dynamic partitioning
b. Simple segmentation c. Cache
c. Simple paging d. Multitasking
d. Virtual memory segmentation e. All of the following
e. None of the memory
56. ______ bus determines the addressable unit of a
Given the sizes of memory segments as A= 10kb, B=5kb, C= 20kb and computer system
process sizes as D=7kb, E= 15kb and F= 5kb. Answer questions 42-44 a. Data
49. A best fit policy for the process D b. Address
a. C c. Control
b. B d. Word length
c. A e. All of the following
d. All of the above
e. None of the above 57. Computer communicates with the keyboard by
means of
50. The worst fit would have process D loaded into a. I/O bus
memory segment ______ b. Data bus
a. A c. Address bus
b. B d. Control bus
c. C e. None of the following
d. None of the above
e. All of the above 58. _______ program manages an I/O device
a. Kernel
51. The first fit policy would load process D into segment b. Shell
a. A c. Driver
b. B d. ROM
c. C e. EPROM
d. None of the above
e. All of the above 59. This is an ”add onˮ module to operating system
a. Driver
52. One of these is an example of machine readable b. ROM
devices c. Controllers
a. Keyboard d. MS word
b. Sensors e. All of the above
c. Modems
d. Scanner 60. The presence of _____ renders the operating system
e. Ethernet evolutionary
a. Drivers
53. In terms of data transfer rate, ______ is the smallest b. ROMs
a. Mouse c. controllers
b. Modem d. MS WORD
c. Keyboard e. All of the above
d. Scanner
e. Ethernet 61. The device name A: describes
a. Serial port A
54. A difference between interrupt-driven I/O and b. Diskette drive A
programmed I/O technique is that c. Logical drive A
a. The processor waits for I/O to complete in interrupt d. The hard disk drive
driven e. All of the above
b. The processor waits for I/O to complete in
programmed I/O
62. One of the following options is false
c. The processor attends to another process in
a. HIMEM.SYS manages MSDOS extended memory
programmed I/O
b. DRIVER.SYS loads external floppy drive program
d. All of the above
c. KEYBOARD.SYS permits the mouse to be used as
e. None of the above
standard input device
d. SMARTDRV.SYS adds a disk caching program to RAM
55. One of these technologies brought a multiple bus e. DISPLAY.SYS supports code-page switching on
architecture console devices
a. Multiprocessing
b. DMA
63. A quick tour into file system in windows 7 operating restriction on what users do
system is done by clicking ___ c. Operating system allows for change as needs and
a. File folder b. File explorer resources change
c. Start button d. Internet Explorer d. Extendible-extensible properties of operating system
e. All of the above
e. All of the above
71 This quality of operating system shows that it is 79. In a pre-emptive scheduling, a process in _____ state
adaptive moves to _____ state
a. Users are tailored to the environment a. Run, Run b. Run, Run suspended
b. Operating system does not impose unnecessary suspended
c. Blocked, Blocked d. Run, Blocked 87. One is not a part of the three state process model
suspended a. Block suspended b. Run
c. Ready d. Block
80. A time out in quantum-based scheduling will take a
e. None of the above
process from ____ state to ___ state
a. Run, Run b. Run, Blocked
suspended 88. A process in new state is retained in
c. Blocked, Blocked d. Run, Ready a. PCB b. Main memory
suspended c. Hard disk d. shell
e. Kernel
81. One of these memories is not handled by the
operating system memory management module
89. An unrecoverable error can lead a process to change
a. Cache b. Register from ___ state to___ state
c. Hard disk d. Main memory a. run, run b. run, blocked
e. None of the above suspended
c. ready, exit d. blocked, exit
82. At booting the RAM is divided into these partitions e. ready, blocked
except
a. User space b. Interrupt vector table 90. A situation that can lead to a damage of PCB is _____
space a. A bug in an executing process
c. File Allocation d. Processor rough work b. A design change in the structure of PCB
table space space c. A change in the state of the operating system
e. None of the above d. All of the above
e. None of the above
83 One of these is common with weighted round robin
algorithm
91. One of these OS modules does not modify the PCB
a. Timer is set to interrupt a running process
a. Resource allocation b. Interrupt hander
b. A process with burst time equals quantum exists
c. Memory manager d. Performance monitor
early
c. A running process can assume a ready state e. None of the above
d. Performance depends on selected quantum
e. All of the above 92. The scheduling module`s goal is to select appropriate
process from the processes in____ state
84. A process moves from a run state to a suspended a. Run b. Ready
state due to one of the following reasons c. blocked d. Suspended
a. An I/O operation is required
b. A blocked process is to be loaded into the memory e. All of the above
c. A new process needs to be swapped into memory
d. The process is the next to be executed One is not a reason for process migration
e. All of the above 93.
a. Load balancing b. Availability
85 A process moves from a ready state to a run state c. Communication d. Segmentation
due to one of the following reasons performance
a. It is selected by the scheduler e. None of the above
b. It has a higher priority than the running process
c. The process is the next to be executed 94. One is not a process state
d. None of the above
a. Run b. Ready suspended
e. All of the above
c. Terminate d. Ready