My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: CONFIDENCE IS THE COMPANION OF SUCCESS Member Level: Diamond Posted Date: 17 Apr 2008
|
2007 Anna University B.Tech Information Technology Operating Systems Question paper
|
|
|
OPERATING SYSTEMS
Time : Three Hours Maximum : 100 marks
Answer ALL questions
PART A – (10 X 2 = 20 marks)
1. What is meant by graceful degradation?
2. What is the situation that gives raise to Process Termination?
3. What is meant by a Thread? Mention its advantage.
4. Specify the significance of priority-inheritance protocol.
5. What are different methods of dealing deadlock problem?
6. What is Thrashing? How can it be prevented?
7. Enumerate the important attributes of a file.
8. What is meant by internal and external fragmentation?
9. How linked allocation solves the problem of contiguous allocation?
10. What is the function of bootstrap loader?
PART B – (5 X 16 = 80 marks)
11. (a) (i) Write short notes on the following terminologies : (8)
1. Time sharing systems
2. Distributed systems
(ii) What is the use of PCB? Explain the information specified in PCB. (8)
12. (a) Discuss in detail the different CPU scheduling algorithms with examples. (16)
(Or)
(b) (i) Explain the difference between preemptive and non preemptive scheduling (8)
(ii) Suggest a solution that can solve critical section problem. (8)
13. (a) (i) Discuss in detail about the different methods available to recover from deadlock
after its detection. (8)
or
(b) (i) Explain the following allocation algorithms : (16)
(i) First- Fit (ii) Best-Fit and
(iii) Worst-Fit
14. (a) (i) Explain the procedure used for handling a page fault. (8)
(ii) Describe any two page-replacement algorithm. (8)
(or)
(b) (i) Summarize the different types of file, their extension and the usage of each
File type. (8)
(ii) Describe the most common schemes available for defining the logical structure
Of a directory. (8)
15. (a) Discuss in detail the following three methods of allocating disk space.
(i) Contiguous allocation (ii) Linked allocation
(iii) Indexed allocation
(or)
(b) (i) Summarize the process of interrupt driven I/O cycle with a neat flow diagram. (8)
(ii) Briefly explain the steps involved in Direct Memory Access data transfer. (8)
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|