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 Date: 04 Mar 2008 Posted By: Girish Patil Member Level: Platinum
|
2007 CBSE Dr. Bhim Rao Ambedkar University(Agra University) B.E Computer Science Operating Systems Question paper
H-303
THIRD YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2006
OPERATING SYSTEMS 1
Total Marks: 100
Time: 10.00p.m. To 1.00p.m.
Instructions: 1) Q.5 from section-1 and Q.10 from section-2 are compulsory.
2) Solve any two questions from Q.2, Q.3, and Q.4
3) Solve any two questions from Q.6, Q.7, and Q.8
4) Figures to right indicates full marks
SECTION-1
Q.1.
a) What IS CLUSTERED SYSTEM? Explain in detail. [Marks 8]
b) Explain real time systems? Explain in detail. [Marks 8]
Q.2
a) What are the major categories of System calls? Explain. [Marks 8]
b) What are major operating System services? Explain in detail. [Marks 8]
Q.3
a) Give process state diagram. Describe PCB. [Marks 8]
b) What are different scheduling queues? Draw figures. [Marks 8]
Q.4
a) Explain following operation on process in detail. [Marks 8]
a) Process creation
b) Process Termination
c) What is the need of co-operation between processes? Explain process co-opeation in detail[Marks 8]
Q.5 Write a short notes on (any three): [Marks 18]
a) Critical region
b) Priority scheduling algorithm
c) Readers-Writers problem
d) Monitors
e) Multilevel feedback queues scheduling
SECTION-2
Q. 6)
a) Explain deadlock prevention methods. [Marks 8]
b) How deadlocks can be avoided? Give algorithm. [Marks 8]
Q.7)
a) Describe swapping procedure in detail. [Marks 8]
b) Explain the terms[Marks 8]
a) Memory protection
b) Allocation
c) Fragmentation
Q.8)
a) What is demand paging? Give the procedure for handling page fault. [Marks 8]
c) Explain optimal page replacement algorithm. [Marks 8]
Q.9)
a) Expalin the segmentation with paging. [Marks 8]
b) Give the allocation of frames to process. [Marks 8]
Q.10) Write a short notes on (any three): [Marks 18]
a) Fragmentation
b) Performa Nance demand paging
c) Resource allocation graph
d) I/O hardware
e) Memory protection
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.
|
Advertise Here
|