0% found this document useful (0 votes)
160 views3 pages

Model Os QP 2024

model QP

Uploaded by

Keerthi
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
0% found this document useful (0 votes)
160 views3 pages

Model Os QP 2024

model QP

Uploaded by

Keerthi
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/ 3

USN:

B.N.M. Institute of Technology


An Autonomous Institution under VTU
Model Question Paper
Fourth Semester BE, 2021-22 Scheme
Operating System – 22AML142
Duration: 3 Hour Max. Marks: 100

Note: 1. Answer one full question from each Module 1,2,3,4,5 (5Q x 20M=100 Marks)

Module 1
Cognitive
Q. No Questions Marks CO PO
Level
Explain in detail about abstract view of the
1 (a) components of a computer system with a neat 8 1 1,2,3,4,8 Understand
diagram
Explain the services of the operating system that Understand
1 (b) 6 1 1,2,3,4,8
are helpful for the user and the system.
Construct the Gantt chart and calculate average
waiting time and average turnaround time using
Round Robin algorithm with a time quantum=2.

Process Burst Time

P1 2
1 (c) 6 1 1,2,3,4,8 Apply
P2 1

P3 8

P4 4

P5 5

OR
Illustrate the different states of a process with a
2 (a) 6 1 1,2,3,4,8 Understand
transition diagram.
Identify briefly about types of system calls with
2 (b) 6 1 1,2,3,4,8 Apply
illustration.
2 (c) Consider the following set of processes, with the 8 1 1,2,3,4,8 Apply
length of the CPU burst time given in
milliseconds. The processes are assumed to have
arrived in the order P1, P2, P3, P4, P5, all at
time 0.

1
USN:

a. Draw four Gantt charts that illustrate the


execution of these processes using the following
scheduling algorithms: FCFS, SJF, non-pre-
emptive priority (a larger priority number
implies a higher priority), and RR (quantum =
2).
b. Compute the turnaround time of each process
for each of the scheduling algorithms in part a?
c. Compute the waiting time of each process for
each of these scheduling algorithms?
Module 2
Identify 3 requirements which satisfy critical Apply
3 (a) 4 2 1,2,3,4,8
section problem.
Construct Reader’s-Writers’ problem using Apply
3 (b) 8 2 1,2,3,4,8
semaphores.
What are monitors? outline dining Philosopher’s Apply
3 (c) 8 2 1,2,3,4,8
solution using monitor
OR
What is Inter Process Communication? Illustrate Understand
4 (a) 8 2 1,2,3,4,8
Message passing mechanisms
Identify deadlock characteristics and explain with Apply
4 (b) 4 2 1,2,3,4,8
examples.
Build the Bankers algorithm. Apply Bankers
algorithm for the following system.

Allocation Max Available


A B C A B C A B C
P0 0 2 0 0 0 4 2 0 2
4 (c) P1 2 0 0 2 0 2 8 2 1,2,3,4,8 Apply
P2 1 3 6 1 3 6
P3 5 3 2 7 4 2
P4 1 3 3 2 5 7
a) Write the content of the need matrix.
Check if the system is in safe state.
Module 3
5 (a) Illustrate concept of swapping with a neat diagram 8 3 1,2,3,4,8 Understand
5 (b) Consider the following page reference string 6 3 1,2,3,4,8 Apply
7,0,2,1,0,4,0,2,4,3,1,3,0,1,2,0,7,2,0,3 for a
memory with 3 frames. How many page faults

2
USN:

occurs for LRU and Optimal page replacement


algorithms? Which is efficient among both?

Demonstrate how virtual memory concept is Understand


5 (c) illustrated by operating System 6 3 1,2,3,4,8

OR
What is thrashing? Show how it can be Understand
6 (a) 6 3 1,2,3,4,8
controlled?
Demonstrate with a neat diagram SSD Understand
6 (b) 6 3 1,2,3,4,8
Architecture
What is Garbage Collection? Develop concept of Apply
6 (c) 8 3 1,2,3,4,8
Bad Block Management
Module 4
Illustrate the kernel and shell relationship in UNIX Understand
7 (a) 8 4 1,2,3,5,12
operating System with a neat diagram.
Explain the basic file categories in Unix operating
7 (b) 6 4 1,2,3,5,12 Understand
system?
Experiment with the following Apply
7 (c) 6 4 1,2,3,5,12
i) HOME variable ii) PATH variable
OR
Compare the differences between absolute and
8 (a) 8 4 1,2,3,5,12 Understand
relative pathnames with suitable example.
Illustrate the salient features of Unix Operating Understand
8 (b) 6 4 1,2,3,5,12
System.
Experiment with the following commands. Apply
8 (c) 6 4 1,2,3,5,12
i) man ii) pwd iii) od
Module 5
Which command is used for listing file attributes? Apply
9 (a) Apply the significance of each field in the 8 5 1,2,3,5,12
attributes?
What are file permissions? Utilize the use of Apply
9 (b) chmod to change file permissions using both 6 5 1,2,3,5,12
absolute and relative methods?
9 (c) Identify the three standard files in UNIX. 6 5 1,2,3,5,12 Apply
OR
10 (a) Make use of grep command with all its options. 8 5 1,2,3,5,12 Apply
Identify wild card characters? Explain shell wild Apply
10 (b) 6 5 1,2,3,5,12
card characters with example?
Apply if and While control statements in shell Apply
10 (c) 6 5 1,2,3,5,12
scripts with suitable program

You might also like