0
435views
Operating System Question Paper - Jun 18 - Information Technology (Semester 5) - Pune University (PU)
1 Answer
0
2views

Operating System - Jun 18

Information Technology (Semester 5)

Total marks: 70

Total time: 2 Hours 30 min

INSTRUCTIONS

(1) Attempts questions Q.1 or Q.2, Q.3 or Q.4 , Q.5 or Q,6 and Q.7 or Q.8 .

(2) Neat diagrams must be drawn whenever necessary.

(3) Assume suitable data , if necessary.

1.a. Explain the significance of following shell commands

i. in

ii. wc

iii. umask

iv. cut

v. grep

(5 marks) 00

1.b. Explain different types of schedulers in operating system.
(5 marks) 00

OR

2.a. Draw and explain process state diagram
(5 marks) 00

2.b. Explain the following functions with reference to 'C'

i. pthread_create()

ii. pthread_join()

(5 marks) 00

3.a. Enlist and explain different IPC mechanisms.
(5 marks) 00

3.b. Explain monitors in brief.
(5 marks) 00

OR

4.a. Write a semaphore solution for readers-writers problem
(5 marks) 00

4.b. Explain with an appropriate example, how resource allocation graph determines a deadlock.
(5 marks) 00

5.a. For the following reference string

5,6,7,8,5,6,9,5,6,7,8,9,6,7,4,9,8

Count the number of page faults that occur with 3 frames using FIFO, Optimal and LRU page replacement methods. Discuss the result

(12 marks) 00

5.b. Explain different ways to remove external fragmentation.
(6 marks) 00

OR

6.a. Free memory holes of sizes 15K, 10K, 5K, 25K, 30K, 40K are available. The processes of size 12K, 2K, 25K, 20K are to be allocated. How processes are placed using first fit, best fit and worst fit partitioning algorithm. Calculate internal and external fragmentation.
(10 marks) 00

6.b. Explain the address translation mechanism in paging and segmentation with proper example.
(8 marks) 00

7.a. A disk drive has 200 cylinders, numbered 0-199, The drive is currently serving the request at cylinder 63. The queue of pending requests in FIFO order is 27, 129, 110, 186, 147, 41, 10, 64, 120. Starting from the current head position what is the total distance that disk arm moves to satisfy all the pending requests for the following disk scheduling algorithms.

i. FCFS

ii. C-SCAN

III. C-LOOK

IV. SSTF.

(12 marks) 00

7.b. Explain I/O buffering mechanism.
(4 marks) 00

OR

8.a. Write a short note on the following:

i. Directory Structure

ii. File Sharing.

(8 marks) 00

8.b. Explain free space management technique.
(8 marks) 00

9.a. Explain in detail Linux Booting process.
(8 marks) 00

9.b. List and explain different inter-process communication mechanisms in Linux operating sytem.
(8 marks) 00

OR

Write short note on following:

10.a Memory management in Linux.
(4 marks) 00

10.b. Linux file system.
(4 marks) 00

10.c. Linux IPC mechanisms.
(4 marks) 00

10.d. Process management in Linux.
(5 marks) 00

Please log in to add an answer.