B.Sc. DEGREE EXAMINATION, DECEMBER 2006
FIFTH SEMESTER
PART III – COMPUTER SCIENCE
OPERATING SYSTEMS
Time : 3 Hours Maximum: 100 Marks
Answer all questions
PART A – (20 x 1 = 20 Marks)
1. The assignment of CPU to first process on ready list is called __________.
a) Blocking b) Dispatching c) Running d) Interrupting
2. __________ operation can be implemented in the nucleus of OS to avoid busy waiting.
a) Deadlock b) Semaphores c) Interrupts d) Synchronization
3. Indefinite postponement is otherwise called __________
a) Deadlock b) Starvation c) Transition d) Resource allocation
4. If a graph can be reduced by all its processes then there is no __________
a) Interrupt b) Deadlock c) Pipelining d) None
5. Entire storage is dedicated to one job for a brief period then that job removed called __________
a) Swapped out b) Swapped in c) Roll in
d) Roll out
6. __________ converts virtual addresses to real addresses as process executes.
a) DAT b) VAT c) RAS d) DOS
7. __________ allows process read only access to a segment.
a) Mode 2 b) Mode 4 c) Mode 5 d)Mode 6
8. __________ bit in NUR page replacement is called dirty bit.
a) Reference b) Modified c) Unreferenced d) Unmodified
9. In __________ scheduling, processes are dispatched FIFO but limited amount of CPU time.
a) RR b) FIFO c) Deadline d) SJF
10. __________ technique enables several machine language instructions to be in various stages of execution.
a) Polling b) Pipelining c) Vector processing d) Multi processing
11. Time for the data to rotate from its current position to the position adjacent to read write head is __________
a) Latency b) Response c) Elapsed
d) Turn around
12. __________ is convenient for designer but headache for implementation.
a) ISAM b) Cache c) RAM d) Switching
13. In a file organization if the records are placed in physical order then it is __________
a) Direct b) Indexed c) Sequential d) Partitioned
14. Periodic compaction is otherwise called as __________
a) Garbage collection b) Access method c) File scan d) Fragmentation
15. __________ file mapping, instead of pointers, block numbers reused.
a) Block oriented b) Page oriented c) Access control d) Distributed
16. __________ sets of permission bits are allowed in UNIX.
a) 3 b) 4 c) 6 d) 8
17. Bus error description gives the type ___________ in UNIX signals.
a) SIGTRAP b) SIGKILL c) SIGBUS d) SIGCCD
18. A __________ is a program that processes a single input stream to produce single output stream.
a) Polling b) Filter c) Pipe d) Vector
19. There are __________ numbers of system calls that UNIX handles.
a) 4 b) 5 c) 3 d) 7
20. A __________ socket handles bidirectional dataflow.
a) Sequenced b) Datagram c)Message d) Blocking
PART B – (5 x 6 = 30 Marks)
21. a) Explain process state transition.
OR
b) Explain deadlock detection.
22. a) Discuss on fixed partition multiprogramming.
OR
b) Discuss on FIFO and LRU page replacement policies.
23. a) Write about scheduling levels and objectives.
OR
b) Discuss on the classification of sequential and parallel architecture.
24. a) Write about 1) CSCAN scheduling 2) Optical disks.
OR
b) Discuss on non contiguous allocation.
FIFTH SEMESTER
PART III – COMPUTER SCIENCE
OPERATING SYSTEMS
Time : 3 Hours Maximum: 100 Marks
Answer all questions
PART A – (20 x 1 = 20 Marks)
1. The assignment of CPU to first process on ready list is called __________.
a) Blocking b) Dispatching c) Running d) Interrupting
2. __________ operation can be implemented in the nucleus of OS to avoid busy waiting.
a) Deadlock b) Semaphores c) Interrupts d) Synchronization
3. Indefinite postponement is otherwise called __________
a) Deadlock b) Starvation c) Transition d) Resource allocation
4. If a graph can be reduced by all its processes then there is no __________
a) Interrupt b) Deadlock c) Pipelining d) None
5. Entire storage is dedicated to one job for a brief period then that job removed called __________
a) Swapped out b) Swapped in c) Roll in
d) Roll out
6. __________ converts virtual addresses to real addresses as process executes.
a) DAT b) VAT c) RAS d) DOS
7. __________ allows process read only access to a segment.
a) Mode 2 b) Mode 4 c) Mode 5 d)Mode 6
8. __________ bit in NUR page replacement is called dirty bit.
a) Reference b) Modified c) Unreferenced d) Unmodified
9. In __________ scheduling, processes are dispatched FIFO but limited amount of CPU time.
a) RR b) FIFO c) Deadline d) SJF
10. __________ technique enables several machine language instructions to be in various stages of execution.
a) Polling b) Pipelining c) Vector processing d) Multi processing
11. Time for the data to rotate from its current position to the position adjacent to read write head is __________
a) Latency b) Response c) Elapsed
d) Turn around
12. __________ is convenient for designer but headache for implementation.
a) ISAM b) Cache c) RAM d) Switching
13. In a file organization if the records are placed in physical order then it is __________
a) Direct b) Indexed c) Sequential d) Partitioned
14. Periodic compaction is otherwise called as __________
a) Garbage collection b) Access method c) File scan d) Fragmentation
15. __________ file mapping, instead of pointers, block numbers reused.
a) Block oriented b) Page oriented c) Access control d) Distributed
16. __________ sets of permission bits are allowed in UNIX.
a) 3 b) 4 c) 6 d) 8
17. Bus error description gives the type ___________ in UNIX signals.
a) SIGTRAP b) SIGKILL c) SIGBUS d) SIGCCD
18. A __________ is a program that processes a single input stream to produce single output stream.
a) Polling b) Filter c) Pipe d) Vector
19. There are __________ numbers of system calls that UNIX handles.
a) 4 b) 5 c) 3 d) 7
20. A __________ socket handles bidirectional dataflow.
a) Sequenced b) Datagram c)Message d) Blocking
PART B – (5 x 6 = 30 Marks)
21. a) Explain process state transition.
OR
b) Explain deadlock detection.
22. a) Discuss on fixed partition multiprogramming.
OR
b) Discuss on FIFO and LRU page replacement policies.
23. a) Write about scheduling levels and objectives.
OR
b) Discuss on the classification of sequential and parallel architecture.
24. a) Write about 1) CSCAN scheduling 2) Optical disks.
OR
b) Discuss on non contiguous allocation.