Download Model question papers & previous years question papers
Submit Previous Years University Question Papers
Posted Date: 11 Jan 2010 Posted By:: Abhijeet Gaikwad Member Level: Gold Points: 5 (Rs. 1)
2009 University of Pune B.E Computer Science and Engineering BE (Computer Engineering) - Operating Systems University Question paper
B.E . (Computer Engineering)
(2003 Course) (410442)
Time : 3 Hours Max. Marks : 100
Instructions to the candidates :
1) Answers to the two sections should be written in separate answer books.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.
4) Your answers will be valued as a whole.
5) Assume suitable data, if necessary.
SECTION – I
Q1) a) What is busy waiting with respect to process synchronization? Explain how semaphore
reduces the severity of this problem. Also define with examples
i) General semaphores.
ii) Binary semaphores
iii) Strong semaphores.
iv) Weak semaphores 
b) What is bounded buffer Producer/Consumer problem? Write a solution using monitors. 
Q2) a) Jurassic Park consists of dinosaur museum and a park for safari riding. There are m
passengers and n single passenger cars. Passengers wander around the museum for
while, then line up to take a ride in a safari car. When a car is available, it loads the
one passenger it can hold and rides around the park for a random amount of time. If the n
cars are all riding passengers around, then a passenger who wants to ride waits; if a car is
ready to load but there are no waiting passengers, then the car waits. Use semaphores
to synchronize the m passenger processes and the n car processes. 
b) What is basic requirement for execution of concurrent processes? Explain how
concurrency is achieved in uniprocessor system. What is distinction between competing
and cooperating processes? 
Q3) a) State and explain different methods used for implementing access matrix. Why access
matrix is required? 
b) Apply the deadlock detection algorithm to the following data and show the results.
Available = ( 2 1 0 0 )
2 0 0 1
1 0 1 0
2 1 0 0
0 0 1 0
2 0 0 1
0 1 2 0
Also state advantages and disadvantages of the algorithm. 
Q4) a) What is deadlock? Explain and compare various techniques to handle deadlock? 
b) Describe two approaches to intrusion detection. What does an audit record
Q5) a) Explain with neat diagram UNIX file system structure and its characteristics. 
b) Define system response time as the average time it takes to complete a system call.
Define system throughput as the number of processes the system can execute in a given
time period. Describe how the buffer cache can help response time. Does it necessarily
help system throughput. 
c) Explain with neat diagram structure of a buffer pool. 
Q6) a) Explain various UNIX kernel components, their responsibilities and their inter
relationship with each other. 
b) Describe with example various building block primitives of UNIX system. 
c) Write an algorithm for bwrite. 
SECTION – II
Q7) a) Write and explain algorithm for mount system call. Also state mount table entries. 
b) When opening a named pipe for reading a process sleeps in the open until another
process opens the pipe for writing. Why? 
c) Compare the access permissions a process must have for following operations and
i) Creating a new file requires write permission in a directory.
ii) Unlinking a file requires write permission in the directory, not on a file. 
Q8) a) Write and explain the algorithm to convert a pathname to an inode. 
b) Explain the structure of a regular file in UNIX. 
c) What are link files? What are the types of links? Compare between them. 
Q9) a) Explain the following process concepts with suitable example – 
II) User ids of a process.
b) What is context of a process explain in detail? 
Q10) a) What is kernel profiling explain in brief? 
b) Explain with example process scheduling. 
c) List out various kernel level data structure used in process subsystem with its fields and
inter relationship. 
Q11) a) Explain how stream provide greater modularity and flexibility for the I/O subsystem. 
b) Explain page stealer process in UNIX. 
c) Explain allocation of swap space in UNIX. 
Q12) a) How page faults are handled in UNIX? 
b) Why is it advantageous to schedule the child process before the parent after a fork call
if copy on write bits are set on shared pages? How can kernel force the child to run
c) Write a note on terminal drivers. 
Return to question paper search
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.