Professional Documents
Culture Documents
2. (a) Define process. Draw the process state diagram and explain.
(b) Explain the criteria for evaluation of CPU Scheduling algorithms.
3. (a) Give an instance where the producer and consumer routines may not function correctly
when executed concurrently.
(b) What are the different types of storage media? Explain.
6. (a) File system is the most visible aspect of an Operating system. Discuss.
(b) A file is an abstract data type. Discuss.
?????
Code No: R7311506 2
III B.Tech I Semester(R07) Regular & Supplementary Examinations, November 2010
OPERATING SYSTEMS
(Common to Computer Science & Systems Engineering, Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE questions
All questions carry equal marks
?????
2. (a) Explain various states and transitions between states with the help of a diagram.
(b) Explain the following scheduling algorithms with examples:
i. First-come, First served
ii. Shortest-job first
4. (a) With a neat diagram explain hardware address protection with base and limit registers.
(b) What is the problem with page table? How is it solved using inverted page table? Explain.
5. What is a deadlock? How deadlocks are detected? How to recover from deadlocks?
8. What is protection? What is security? What is the relation between them? Briefly explain
both protection and security.
?????
Code No: R7311506 3
III B.Tech I Semester(R07) Regular & Supplementary Examinations, November 2010
OPERATING SYSTEMS
(Common to Computer Science & Systems Engineering, Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE questions
All questions carry equal marks
?????
2. (a) What are the different states a process can be in? Explain process state diagram in detail.
(b) State the criteria for evaluating CPU scheduling algorithms. Also state whether the criteria
is to be optimized for minimal or maximum value.
3. (a) What is the need for process synchronization and coordination? Explain with an example.
(b) Explain the concept of check-points to reduce the overhead of log-based recovery.
5. (a) What is a deadlock? Explain it with an analogy. What are the problems with deadlocks?
(b) What is a resource? What are the different types of resources? How ‘type of the resource’
influences deadlock?
7. What are the disk scheduling algorithms that schedule the order of disk I/O’s? Explain them.
?????
Code No: R7311506 4
III B.Tech I Semester(R07) Regular & Supplementary Examinations, November 2010
OPERATING SYSTEMS
(Common to Computer Science & Systems Engineering, Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE questions
All questions carry equal marks
?????
1. (a) Define operating system. Explain the role of an operating system in the computer system.
(b) Explain the structure of the following operating systems:
i. Solaris.
ii. UNIX.
2. (a) What is the purpose of PCB? Explain various pieces of information contained in PCB.
(b) What is meant by ‘convoy effect’ in the context of FCFS scheduling algorithm? Explain
with an example.
4. (a) At what steps the binding of instructions and data to memory addresses are done? Explain.
(b) What are the sequences of steps caused by page fault?
6. (a) What are the various operations that can be performed on the file? Explain.
(b) What are the various pieces of information associated with an open file? Discuss.
7. Compare different disk scheduling algorithms giving their pros and cons.
?????