This document is a question paper for a modern operating systems exam from January 2017. It contains 7 questions with multiple parts each. Students are instructed to answer all questions and are given 3 hours to complete the exam. The questions cover a range of topics in operating systems including multithreading models, file systems like NFS, batch and real-time systems, assemblers and compilers, system programs, virtual machines, process states, scheduling algorithms, memory management techniques like paging and segmentation, I/O management, security, and more.
Micro-Scholarship, What it is, How can it help me.pdf
[Question Paper] Modern Operating System (Revised Course) [January / 2017]
1. M o d e r n O p e r a t i n g S y s t e m
Q u e s t i o n P a p e r ( J a n u a r y – 2 0 1 7 ) [ R e v i s e d C o u r s e ]
1 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Time: 3 Hours Total Marks: 100
N.B.: (1) All Questions are Compulsory.
(2) Figure on right indicate maximum marks.
Q.1 Attempt Both The Question: (10 Marks)
(A) Explain Multithreading Models. (5)
(B) Discuss NFS in detail. (5)
Q.2 Attempt Any Three From The Following: (15 Marks)
(A) Explain the Single Batch and Multiple Batch Processing System. (5)
(B) Explain Assemblers and Compliers in detail. (5)
(C) Explain Real Time Operating System in detail. (5)
(D) Explain Distributed System in detail. (5)
Q.3 Attempt Any Three From The Following: (15 Marks)
(A) Explain System Programs and its types. (5)
(B) Explain various Operating System Services. (5)
(C) Define and explain Virtual Machine. (5)
(D) Explain different types of System Calls. (5)
Q.4 Attempt Any Three From The Following: (15 Marks)
(A) Discuss different Scheduling Algorithms. (5)
(B) Define and explain process with different Process States. (5)
(C) Explain Critical Section problem. (5)
(D) Give different benefits of threads. (5)
Q.5 Attempt Any Three From The Following: (15 Marks)
(A) Discuss in detail Page Replacement Algorithm. (5)
(B) What is Segmentation? Discuss in detail. (5)
(C) Explain paging in detail. (5)
(D) Explain Dynamic Partioning. (5)
2. M o d e r n O p e r a t i n g S y s t e m
Q u e s t i o n P a p e r ( J a n u a r y – 2 0 1 7 ) [ R e v i s e d C o u r s e ]
2 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Q.6 Attempt Any Three From The Following: (15 Marks)
(A) Explain necessary conditions required for feedback. (5)
(B) Explain Swap-Space Management. (5)
(C) Explain DISK Structure and Disk Management in brief. (5)
(D) Write a note on RAID and its types. (5)
Q.7 Attempt Any Three From The Following: (15 Marks)
(A) Explain application I/O Interface. (5)
(B) Write a note on Access Matrix. (5)
(C) Explain STREAMS. (5)
(D) What are different types of Security and Network Threats? (5)