Community Sites
Create your own community website and start earning today !
It's Free !
Forum
Resources
Mentors
Projects
Entrance Exams
Question Papers
Colleges
Courses
Universities
Schools
Make Money
Communities
Members
Bookmarks
Polls
Fresher Jobs
Funny Photos
B.Tech Projects
New Member FAQ
My Profile
Sign In
Register
AdSense Revenue
Active Members
Today
Srinath
(203)
geethu
(184)
Anil
(142)
Last 7 Days
sunil
(2114)
Saagar
(1850)
satish
(1723)
more...
Awards & Gifts
Online Exams
Aptitude Questions
General Aptitude Tests
Medical Entrance
Engineering Entrance
Bank Tests
TOEFL & IELTS Questions
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.
operating system
Posted Date: 12 Feb 2008 Resource Type:
Articles/Knowledge Sharing
Category:
Education
Posted By:
sasi kala
Member Level:
Diamond
Rating:
Points
: 4
Sc. DEGREE EXAMINATION
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 intenal 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)
Responses
Author:
Jose Mathew
12 Feb 2008
Member Level:
Platinum
Points
: 2
Hi Sasi kala,
Welcome to indiastudychannel. You can post the university question papers in the question paper section.
ISC team
Feedbacks
Popular Tags
What are tags ?
Search Tags
Sign In
(No tags found.)
Post Feedback
This is a strictly moderated forum. Only approved messages will appear in the site. Please use 'Spell Check' in Google toolbar before you submit.
You must
Sign In
to post a response.
Next Resource:
College Text Books
Previous Resource:
Online Master's Degree Program Has Its Limitations!
Return to Discussion Resource Index
Post New Resource
Category:
Education
Post resources and
earn money
!
Related Resources
SAP --Business overview
Institutes that offer bio technology
Qualities of a successfull businessman.
graph theory1
Paribhasa of MBA
Watch TV Channels
Watch Asianet online
Kairali TV in Internet
Surya TV online
Amritha TV Channel
Contact Us
Editors
Privacy Policy
Terms Of Use
SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.