
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

2003 Course Operating Systems

3 pages, 36 questions, 0 questions with responses, 0 total responses,

	pune_eng	+Fave Message
	Profile Timeline Uploads Q & A

Home > pune_eng >

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Total No. of Questions : 12] [Total No. of Pages : 3 [3664] - 335 P 1365 B.E. (Computer Engineering) OPERATING SYSTEMS (2003 Course) (410442) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates: 1) Answer all questions from each section. 2) Answers to the two sections should be written in separate books. 3) Figures to the right indicate full marks. 4) Neat diagrams must be drawn wherever necessary. 5) Assume suitable data, if necessary. SECTION - I Q1) a) b) 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. [8] What is bounded buffer Producer/Consumer problem? Write a solution using monitors. [8] OR Q2) a) b) Jurassic Park consists of a dinosaur museum and a park for safari riding. There are m passengers and n single passenger cars. Passengers wander around the museum for a 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. [8] 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? [8] P.T.O. Q3) a) b) State and explain different methods used for implementing access matrix. Why access matrix is required? [8] Apply the deadlock detection algorithm to the following data and show the results. [8] Available = ( 2 1 0 0 ) 0010 2001 Request = 1 0 1 0 Allocation = 2 0 0 1 0120 2100 Also state advantages and disadvantages of the algorithm. OR Q4) a) b) Q5) a) b) c) What is deadlock? Explain and compare various techniques to handle deadlock? [8] Describe two approaches to intrusion detection. What does an audit record contains? [8] Explain with neat diagram UNIX file system structure and its characteristics. [6] 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. [6] Explain with neat diagram structure of a buffer pool. [6] OR Q6) a) b) c) Explain various UNIX kernel components, their responsibilities and their inter relationship with each other. [10] Describe with example various building block primitives of UNIX system. [4] Write an algorithm for bwrite. [4] SECTION - II Q7) a) b) Write and explain algorithm for mount system call. Also state the mount table entries. [10] When opening a named pipe for reading a process sleeps in the open until another process opens the pipe for writing. Why? [4] [3664] - 335 -2- c) Compare the access permissions a process must have for following operations and comment 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. [4] OR Q8) a) b) c) Write and explain the algorithm to convert a pathname to an inode. [8] Explain the structure of a regular file in UNIX. [4] What are the link files? What are the types of links? Compare between them. [6] Q9) a) Explain the following process concepts with suitable example i) Signals. ii) User ids of a process. What is context of a process explain in detail? b) [8] [8] OR Q10)a) b) c) What is kernel profiling explain in brief? [4] Explain with example process scheduling. [6] List out various kernel level data structure used in process subsystem with its fields and inter relationship. [6] Q11)a) Explain how stream provide greater modularity and flexibility for the I/O subsystem. [6] Explain page stealer process in UNIX. [4] Explain allocation of swap space in UNIX. [6] b) c) OR Q12)a) b) c) How page faults are handled in UNIX? [6] 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 first? [4] Write a note on terminal drivers. [6] [3664] - 335 -3-

Formatting page ...

Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers

pune_eng chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: