Scribd
Upload
5K views2 pages

OS (BEC405C) Vtu QP

Uploaded by

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

OS (BEC405C) Vtu QP

Uploaded by

Shweta Gadgay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

22xxxxXX

Model Question Paper-2/2 with effect from 2022-23 (CBCS Scheme)


USN

Fourth Semester B.E. Degree Examination


Operating System
TIME: 03 Hours Max. Marks: 100

Note: 01. Answer any FIVE full questions, choosing at least ONE question from each MODULE.

*Bloom’s
Module -1 Taxonomy Marks
Level
Q.01 a Mention and explain the operations of Operating system L2 4M
b Identify various resource allocation techniques used for resources L3 8M
allocation and explain.
c Describe the working principle of time sharing O.S. and define response L3 8M
time and efficiency.
OR
Q.02 a What is an Operating system and explain its Goals? L2 4M
b Classify Real time operating system and explain each type in detail.. L3 6M
c Identify and describe the various architectural supports required and L3 10M
techniques used for improving the performance in multiprogramming
O.S.
Module-2
Q. 03 a What are the various components of process environment? L2 4M
b Explain in detail the O.S view of processes. L3 6M

c Analyze the performance of Operating system for the set of processes L4 10M
given in below table using FCFS & SRN non-preemptive scheduling
policy.
Process P1 P2 P3 P4 P5
Arrival time 0 2 3 5 9
Service time 3 3 2 5 3
OR
Q.04 a What is Thread and mention its advantages. L2 4M
b Identify the different types of threads and explain with neat diagram. L3 6M
c Analyze the performance of Operating system for the set of processes L4 10M
given in below table by applying RR & LCN preemptive scheduling
policy.
Process P1 P2 P3 P4 P5
Arrival time 0 2 3 5 9
Service time 3 3 2 5 3
Module-3
Q. 05 a Compare contiguous and noncontiguous memory allocation and explain L3 10M
in brief how to implement noncontiguous memory allocation.
b With diagrams analyze following terms in memory management L4 10M
i) Internal Fragmentation ii)External Fragmentation iii)Paging
iv)Segmentation
OR
Q. 06 a With neat diagram explain the demand paging preliminaries. L3 8M

Page 01 of 02
22xxxxXX
b Determine the number of page faults for the following page reference L4 12M
string using FIFO and LRU policies.
String:5,4,3,2,1,4,3,5,4,3,2,1,5 and time reference
String:t1,t2,t3,t4,t5,t6,t7,t8,t9,t10,t11,t12,t13 number of page frames is 3.
Module-4
Q. 07 a Compare i) sequential and direct file organization. L2 10M
ii) linked and indexed disk space allocation.
b Explain the fundamental file organization and Input Output control L3 10M
system in detail.
OR
Q. 08 a Explain file types, attributes and file operations performed by file system. L2 10M
b Identify and explain various types of directory structures with necessary L3 10M
diagram.
Module-5
Q. 09 b Describe how to implement message passing using a mailbox with L3 10M
necessary diagram. Also mention the advantages of using Mailboxes.
c Apply the deadlock detection algorithm for detecting the deadlock and L3 10M
explain with example.
OR
Q. 10 a Define deadlock and Identify the various approaches used to prevent L3 10M
deadlock.
c Identify various issues of message passing and Explain the different fields L3 10M
of Interprocess message control box.

Page 02 of 02

You might also like