Wednesday 19 December 2012

OPERATING SYSTEM DCME-IV OCT/NOV 2011(C-05)


C05-CM-403
458
BOARD DIPLOMA EXAMINATION, (C-05)
OCTOBER/NOVEMBER-2011
DCME-IV SEMESTER EXAMINATION
OPERATING SYSTEMS
TIME: 3 HOURS]                                                      [TOTAL MARKS:100
PART A
Instructions: (1) Answer all questions and each question carries four marks.(2) Answer should be brief and straight to the point and shall not exceed five simple sentences.
1.    Explain briefly about timesharing.
2.    List any siz operating system services
3.    What is the purpose of multi-threading model? List any two models.
4.    What is the difference between preemptive and non-preemptive scheduling?
5.    Explain the wait and signal operations on a semaphore S
6.    What is address binding? Explain about compile time binding?
7.    Explain the concept of demand paging.
8.    When does a page-fault occur?
9.    Explain linked-list free space management technique.
10. Explain briefly about sequential file access method.
PART-B                     5*12=60
INSTRUCTIONS: (1) Answer any five questions and each equestion carries twelve marks. (2) The answer should be comprehensive and the criteria for valuation is the content but not the length of the answer.
11. (a) expand “SPOOL”. Explain the concept of spooling with approapriate sketch. (b) define a system call. Explain any two types of system calls.
12. (a) explain the five states of a process. (b) explain any five pieces of information stored in PCB.
13. (a) Explain ready queue and I/O queue with appropriate sketch of queuing diagram. (b) discuss about message system in interprocess communication
14. (a) Define a deadlock state.(b) Explain the following two options used for recovery from a deadlock state. (i) process termination(ii) resource preemption.
15. (a) explain paging with appropriate diagrams. Give one example (b) Explain briefly the concept of virtual memory.
16. (a) Write the procedure for handling a page-fault. (b) Explain the cause for thrashing.
17. (a) explain linked and indexed file allocation methods. (b) Explain SSTF disk scheduling algorithm.
18. (a) explain in detail about the structure of tree structured directory. (b) explain any four basic file operations.
Home                   



No comments:

Post a Comment