Sunday 4 December 2011

previous question papers for OPERATING SYSTEMS


·         OCT/NOV-2011(C-00)
·         OCT/NOV-2011(C-05)
·         OCT/NOV-2011(C-09)
·         OCT/NOV-2012(C-09)

C05-CM-402
3456
BOARD DIPLOMA EXAMINATION, (C-09)
APRIL/MAY-2012
DCME IV SEMESTER EXAMINATION
OPERATING SYSTEMS
Time : 3 Hours]                                                               [Total Marks: 80
PART-A    10*3=30
Instructions: (1) Answer all questions and each question caries four marks. (2) Answers should be brief and straight to t the point and shall not exceed five simple sentences.
1.    What do you mean of multiprocessor systems?
2.    Write how the spooling is different from buffering?
3.    List two ways that we can break the second condition to prevent deadlock.
4.    Write short notes on semaphores.
5.    What is meant by shared memory in inter process communication
6.    What is a starvation problem with respect to CPU Scheduling
7.    List the different ways of implementing the page table
8.    What is the cause of thrashing? Briefly explain
9.    What are the advantages and disadvantages of the bit vector free space approach?
10. How to protect files on a single-user system?



PART-B                                              5*10=50
Instructions: (1) Answer any five questions and each question caries twelve marks. (2) The Answers should be comprehensive and criteria for valuation is the Content but not the length of the answer.

11. What are the services of operating system? Explain
12. Consider the following set of processes, with the length of the cpu burst time given in milliseconds:
Process          burst time      priority
P1                   10                    3
P2                   1                      1
P3                   2                      3
P4                   1                      4
P5                   5                      2
The processes are assumed to have arrived in the order P1,P2,P3,P4,P5, all at time 0. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-pre-emptive priority (a smaller priority number implies a higher priority), and RR (quantum=1) scheduling. Which of the above schedules in the minimal average waiting time (over all processes) /
13.  Explain the process state diagram
14. Explain the scheduling criteria
15. Write about FIFO and LRU page replacement algorithms, with approapriate examples.
16. (a) explain the difference between internal and external fragmentation.     (b) explain the difference between logical and physical addresses.
17.  (a) write about the SCAN disk scheduling. (b) write about the C-SCAN disk scheduling.
18. What are the file operations? Explain.