Scribd
Upload
19 views3 pages

Cs2214402 - Operating Systems

This document outlines the model examination for the Fourth Semester B.E in Computer Science and Engineering at Mahendra Institute of Technology for the course CS2214402 - Operating Systems. It includes details about the exam structure, with Part A consisting of short answer questions and Part B featuring detailed problem-solving and discussion questions. Part C focuses on advanced concepts such as the banker's algorithm and page faults, with specific tasks and scenarios provided for students to analyze.

Uploaded by

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

Cs2214402 - Operating Systems

This document outlines the model examination for the Fourth Semester B.E in Computer Science and Engineering at Mahendra Institute of Technology for the course CS2214402 - Operating Systems. It includes details about the exam structure, with Part A consisting of short answer questions and Part B featuring detailed problem-solving and discussion questions. Part C focuses on advanced concepts such as the banker's algorithm and page faults, with specific tasks and scenarios provided for students to analyze.

Uploaded by

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

Register Number

MAHENDRA INSTITUTE OF TECHNOLOGY


(AUTONOMOUS)
Model Examinations – April/May 2025

Fourth Semester
B.E – Computer Science And Engineering
CS2214402 - OPERATING SYSTEMS
(Regulations 2022)
Duration: 3 Hours Maximum Marks: 100
Answer ALL Questions
Part A – (10 X 2 = 20 Marks)
Q. No. Question M CO# KL
1. What is meant by System Call? 2 CO1 K1
2. What are the main advantages of multiprocessor systems? 2 CO1 K1
3. State the four necessary conditions for deadlock situation to 2 CO2 K2
arise.
4. Distinguish between CPU bounded and I/O bounded processes. 2 CO2 K2
5. What is virtual memory? Mention its advantages. 2 CO3 K1
6. Classify the segmentation and paging. 2 CO3 K2
7. List out the types of directory structure. 2 CO4 K2
8. What type of file accessing method can be used for batch and 2 CO4 K1
payroll applications?
9. Define rotational latency. 2 CO5 K1
10. List out the components and features of the Linux system. 2 CO5 K2
Part B – (5 X 13 =65 Marks)
11 a) Explain the various Structure of an Operating System. 13 CO1 K2
(Or)
11 b) Describe system calls and types of system calls in detail 13 CO1 K2
with neat sketch.

12 a) Solve the below problem by using FCFS, preemptive and 13 CO2 K2


non preemptive versions of Shortest-Job-First and Round
Robin (time slice = 2) scheduling algorithms with Gantt
Chart for the four processes given. Compare their average
turn around and waiting time.
PROCESS ARRIVAL TIME BURST TIME
P1 0 10

Page 1 of 3
P2 1 6
P3 2 12
P4 3 15
(Or)
12 b) Discuss in detail the critical section problem and also write 13 CO2 K2
the algorithm for Peterson’s & Dekker’s solution, Dining
philosopher problem using with semaphores.

13 a) Consider the following page reference string: 1, 2, 3, 4, 5, 13 CO3 K2


3,4,1,6,7,8,7, 8, 9, 7, 8, 9, 5, 4, 4, 5, 3 How many page
faults would occur for the following replacement
algorithms, assuming four frames? Remembering all frames
are initially empty. (15) (a) LRU replacement (b) FIFO
replacement (c) Optimal replacement.
(Or)
13 b) Given memory partitions of 500 KB, 100 KB, 300 KB, 200 13 CO3 K2
KB and 600 KB in order, how would each of the first-fit,
best-fit, and worst-fit algorithms place processes of size
418 KB, 202 KB, 506 KB,11 2 KB, and 95 KB (in order)?
Which the algorithms make the most efficient use of
memory?

14 a) Summarize the concept of free space management with 13 CO4 K2


example.
(Or)
14 b) Explain about RAID in detail. 13 CO4 K2

15 a) Discuss about the steps involved in the installation of the 13 CO5 K2


Linux multi-function server.
(Or)
15 b) Write short notes on Linux Kernel and Virtualization with 13 CO5 K2
neat sketch.
Part C – (1 X 15 =15 Marks)
16 a) Let us consider the following snapshot for understanding 15 CO2 K3
the banker's algorithm:

i. Calculate the content of the need matrix.


ii. Check if the system is in a safe state.
iii. Determine the total sum of each type of resource.
(Or)
16 b) When do page faults occur? Consider the reference string: 15 CO3 K3
1,2,3,4,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults
and page fault rate occur for the FIFO, LRU and optimal
replacement algorithms, assuming one, two, three, four
page frames?

Page 2 of 3
Name and Signature of the HoD
subject teacher/Course coordinator

Page 3 of 3

You might also like