Scribd
Upload
13 views2 pages

Operating Systems Exam Paper - CS351

This document is an examination paper for the T.Y. B.Sc. Computer Science course on Operating Systems - I, consisting of five questions with varying marks. It includes multiple-choice questions, short answer questions, and problem-solving tasks related to operating system concepts. The paper emphasizes key topics such as process management, memory management, and synchronization mechanisms.

Uploaded by

NISHANT DESALE
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

Operating Systems Exam Paper - CS351

This document is an examination paper for the T.Y. B.Sc. Computer Science course on Operating Systems - I, consisting of five questions with varying marks. It includes multiple-choice questions, short answer questions, and problem-solving tasks related to operating system concepts. The paper emphasizes key topics such as process management, memory management, and synchronization mechanisms.

Uploaded by

NISHANT DESALE
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Total No. of Questions : 5] SEAT No.

:
PC-1579 [Total No. of Pages : 2

[6328]-51
T.Y. [Link].
COMPUTER SCIENCE
CS - 351 : Operating Systems - I
(Revised 2019) (Semester - V) (New CBCS) (Paper - I)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Assume suitable data, if necessary.

Q1) Attempt any Eight of the following. [8 × 1 = 8]


a) What is batch operating system?
b) List any two advantages of multithreaded programming.
c) Define dispatch latency.
d) "Counting Semaphore can be implemented by using binary semaphore".
True/False. Justify.
e) Define logical address space.
f) Define spooling.
g) What is ready queue?
h) What will happen if all processes are I/O bound in system?
i) Define semaphore.
j) List various dynamic allocation memory management methods.

Q2) Attempt any four of the following. [4 × 2 = 8]


a) What is page table? What are its contents?
b) What is critical section problem?
c) What is pre - emptive and Non - preemptive scheduling?
d) Explain the functions performed by dispatcher.
e) Write the advantages of microkernel.
P.T.O.
Q3) Attempt any two of the following. [2 × 4 = 8]
a) Explain process control block with proper diagram.
b) Consider the following snapshot of a system.
Process Arrival Time CPU burst Time
p1 0 7
p2 1 2
p3 2 5
p4 3 4

Compute average trunaround time and average waiting time using RR


with quantum 3.
c) Differentiate between internal fragmentation and external fragmentation.

Q4) Attempt any Two of the following. [2 × 4 = 8]


a) Explain one - to - one and many - to - many multithreading models.
b) Explain dining philosopher problem.
c) Consider the page reference string 2,3,2,1,5,2,4,5,3,2,5,2. How many page
faults occur for the following page replacement algorithms, assuming 3
frames?
i) FIFO
ii) LRU

Q5) Attempt any One of the following. [1 × 3 = 3]


a) What is system call? Explain the system call for process and job control.
b) Explain swapping in detail.

♦♦♦

[6328]-51 2

You might also like