Question Paper: Operating System : Question Paper May 2015 - Information Technology Engineering (Semester 6) | Pune University (PU)
0

Operating System - May 2015

Information Technology Engineering (Semester 6)

TOTAL MARKS: 100
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks.


Answer any one question from Q1 and Q2

1 (a) Describe the evolution of Operating Systems.(5 marks) 1 (b) Explain fork and execve system calls. Also state their relationship.(5 marks)


Write features of the following (any three):

10 (a) NACH OS(5 marks) 10 (b) Ubuntu EDGE(5 marks) 10 (c) Embedded Linux(5 marks) 10 (d) Android OS(5 marks) 10 (e) Service Oriented OS(5 marks) 2 (a) Differentiate between kernel-level and user-level threads.(5 marks) 2 (b) Explain Traditional UNIX Scheduling with example.(5 marks)


Answer any one question from Q3 and Q4

3 (a) How can a programming language be used to provide mutual exclusion? Explain with example.(5 marks) 3 (b) What are different requirements for mutual exclusion?(5 marks) 4 (a) Write and explain the deadlock-free solution for a dining Philosophers Problem.(5 marks) 4 (b) Explain any two ways of creating unnamed pipes in Linux with example.(5 marks)


Answer any one question from Q5 and Q6

5 (a) What are the distinctions among logical, relative, and physical addresses?(6 marks) 5 (b) Why is the capability to relocate processes desirable? Explain in detail.(6 marks) 5 (c) Explain two-level page table organization for implementing virtual memory.(6 marks) 6 (a) Write a short note on Buddy system.(6 marks) 6 (b) For the following page reference string 5, 6, 7, 8, 5, 6, 9, 5, 6, 7, 8, 9, show and count the number of page faults that occur with three frames using FIFO, LRU and optimal page replacement methods.(12 marks)


Answer any one question from Q7 and Q8

7 (a) Define following terms.
i) Seek time
ii) Rotational Latency
iii) Transfer time
(6 marks)
7 (b) Assume the disk head is initially positioned over track 100.For the disk track request 27, 129, 110, 186, 147, 41, 10, 64, 120 how disk scheduling is done for FIFO Scan algorithms. Calculate average seek length and show the tracing of request.(6 marks) 7 (c) Explain different I/O buffering techniques.(4 marks) 8 (a) List and briefly define any two file allocation methods.(6 marks) 8 (b) What are the functions of a file management system?(6 marks) 8 (c) What are typical operations that may be performed on a directory?(4 marks)


Answer any one question from Q9 and Q10

9 (a) Write a pseudo - code for simple kernel module and explain procedure of inserting a new module in existing kernel with all necessary steps.(8 marks) 9 (b) With neatly labelled diagram explain architecture of embedded OS.(8 marks)

Please log in to add an answer.