Bharathiar University 2006 B.Sc Computer Science Operating Systems - Question Paper

B.Sc. DEGREE EXAMINATION, DECEMBER 2006
FIFTH SEMESTER
PART III – COMPUTER SCIENCE
OPERATING SYSTEMS
Time : three Hours Maximum: 100 Marks
ans all ques.
PART A – (20 x one = 20 Marks)
1. The assignment of CPU to 1st 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 decreased by all its processes then there is no __________
a) Interrupt b) Deadlock c) Pipelining d) None
5. Entire storage is dedicated to 1 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 learn 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 different 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 learn 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) six d) 8
17. Bus fault description provide the kind ___________ 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) three d) 7
20. A __________ socket handles bidirectional dataflow.
a) Sequenced b) Datagram c)Message d) Blocking
PART B – (5 x six = 30 Marks)
21. a) discuss process state transition.
OR
b) discuss deadlock detection.
22. a) explain on fixed partition multiprogramming.
OR
b) explain on FIFO and LRU page replacement policies.
23. a) Write about scheduling levels and objectives.
OR
b) explain on the classification of sequential and parallel architecture.
24. a) Write about 1) CSCAN scheduling 2) Optical disks.
OR
b) explain on non contiguous allocation.
25. a) Illustrate what will be the user’s view of MSDOS in any two concepts.
OR
b) Write about inter process communication and signals.

PART C – (5 x 10 = 50 Marks)
26. a) explain on the concept of semaphores.
OR
b) Write about deadlock applications.
27. a) Write about contiguous vs noncontiguous allocation along with storage management strategies.
OR
b) Write about demand paging and page size.
28. a) explain on priorities and deadline scheduling.
OR
b) Write about dataflow computers, multiprocessors in detail.
29. a) Write detail notes on FCFS, SSTF and N step scan scheduling.
OR
b) explain on file organization.
30. a) explain on the file system used by UNIX.
OR
b) Is MS-DOS advantageous than UNIX or not? explain.


_________________

Earning:   Approval pending.