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: Nithya Krishna Member Level: Gold Posted Date: 15 May 2008
|
2008 Anna University B.E Computer Science CS 1252-OPERATING SYSTEMS Question paper
|
|
|
B.E/B.Tech. DEGREE EXAMINATION, APRIL/MAY 2008
Fourth Semester
Computer Science and Engineering
CS 1252-OPERATING SYSTEMS
Answer all the questions.
PART A-(10X2=20 marks)
1.Specify the critical factor to be strictly followed in real time systems.
2.List out the three main advantages of multiprocessor system.
3.What is co-operating process?
4.What is bounded waiting in critical section?
5.What are the four necessary conditions a system should possess in order to be termed as deadlock?
6.What is segmentation?
7.Why should we use virtual memory?
8.What is meant by thrashing?
9.Name the entries that makes up a File Control Block(FCB).
10.State any two distinguishing features of UNIX and Windows.
PART B(5 X 16=80 marks)
11.(a).(i).Explain the facilities by the following operating systems
(1).Clustered system and
(2).Real-Time system
(ii).List out the services provided by operating system to programs and to the user of the program.
(Or)
11.(b).(i).Explain the process creation and process termination process on process.
(ii).Write short notes on co-operating processors and schedulers.
12.(a)Describe the following scheduling algorithms
(i).Shortest job first scheduling
(ii).Round robin scheduling
(iii).Real time scheduling
(iv).Priority scheduling
(Or)
12.(b).What is the important feature of critical section? State the dining philosophers problem and show how to allocate the several resources among several processors in a deadlock and starvation free manner.
13.(a).(i).How can deadlock be detected? Explain.
(ii).Write short notes on swapping.
(Or)
13.(b).Discuss the advantages of paging memory management and the conversion of logical address into physical address with necessary hardware.
14.(a).Discuss the following page replacement algorithms, giving a suitable page reference string (i).LRU (ii).FIFO and (iii).Optimal.
(Or)
14.(b).(i).State the various attributes of a file and their purpose. Discuss the various file operations.
(ii).Discuss about demand paging.
15.(a).Discuss in detail any three methods of implementing the file system.
(Or)
15.(b).Write short notes on:
(i).Disk structure
(ii).Indexed allocation
(iii).Shortest Seek Time First (SSTF) scheduling.
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
|