Easwari Engineering College (Autonomous)

Department of Computer Science and Engineering

CONTINUOUS ASSESSMENT TEST – 1

Regulations R 2023

Second Year / Fourth Semester

231CSC403T – Operating Systems

CO1: Analyze various scheduling algorithms and process synchronization.

CO2: Explain deadlock prevention and avoidance algorithms.
CO3: Compare and contrast various memory management schemes.
CO4: Explain the functionality of file systems, I/O systems, and Virtualization.
CO5: Compare iOS and Android Operating Systems.

Unit – I Introduction

CO’s Bloom’s
Q. No Questions
Level
Part - A
1. How does an interrupt differ from a trap? CO1 K1
2. Why API’s need to be used rather than system call? CO1 K1
3. Distinguish between batch systems and time sharing systems. CO1 K2
4. Difference between symmetric and asymmetric multiprocessing. CO1 K2
5. What is the purpose of system programs/system calls? CO1 K1
Can traps be generated intentionally by a user program? If so, for CO1
6. K2
what purpose?
7. What are the five major categories of System Calls? CO1 K1
What are the five major activities of an operating system with regard CO1
8. K1
to process management?
9. Is OS a resource Manager? If so justify your answer. CO1 K2
10. Write the differences of batch systems and time sharing systems. CO1 K1
11. Do timesharing differ from multiprogramming? If so, How? CO1 K2
12. What is SYSGEN and system boot? CO1 K1
13. How would you build clustered systems? CO1 K1
14. What is dual mode operation and what is the need of it? CO1 K2
15. List out the various operating system components. CO1 K1

CO’s Bloom’s
Q. No Questions
Level
Part – B
I) Explain the various types of system calls with an example for
each. (8)
1. CO1 K5
II) Discuss the functionality of system boot with respect to an
Operating System. (5)
Illustrate how the operating system has been evolved from serial
2. CO1 K3
processing to multiprogramming system.
 (I) Explain the various structure of an operating system. (8) CO1
3. (II) Describe system calls and system programs in detail with neat K3
sketch. (5)
(I) State the operating system structure. (4) CO1
(II) Describe the operating system operations in detail. Justify the
4. K2
reason why the lack of a hardware supported dual mode can cause
serious shortcoming in an operating system? (9)
Explain the different architecture of OS starting from simple CO1
structure, layered structure, micro kernels, modules and hybrid
5. K2
systems, with suitable examples OS structure, including Google’s
Android.
Distinguish between the dual mode and multi-mode operation in CO1
6. K2
operating systems.
Give the advantages of peer-to-peer systems over client-server CO1
7. K2
systems?
8. Explain the three main purposes of an operating system in detail. CO1 K2

CO’s Bloom’s
Q. No Questions
Level
Part - C
1. Evaluate in detail the services of an operating system. CO1 K3
Summarize about four resources that will be allocated by operating CO1
2. K3
system to users and processes.

UNIT II - Process Management

CO’s Bloom’s
Q. No Questions
Level
Part - A
1. Name and draw five different process states with proper definition. CO2 K1
2. Define the term process. CO2 K1
3. Is the context switching an overhead? Justify your answer. CO2 K2
4. Distinguish between CPU bounded and I/O bounded processes. CO2 K1
5. List the CPU scheduling algorithms. CO2 K2
6. Differentiate short term and long term scheduler. CO2 K2
7. Analyse the critical section problem. CO2 K2
8. Show the use of monitors in process synchronization. CO2 K1
9. Give the use of resource - allocation graph. CO2 K1
10. List out the data fields associated with Process Control Blocks. CO2 K2
“Priority inversion is a condition that occurs in real time systems CO2
where a low priority process is starved because higher priority
11. K2
processes have gained hold of the CPU” – Comment on this
statement.
12. What is meant by 'starvation' in operating system? CO2 K1
“If there is a cycle in the resource allocation graph, it may or may not CO2
13. K2
be in deadlock state“. Comment on this statement.
14. List out the methods used to recover from the deadlock. CO2 K2
15. Is it possible to have deadlock with one process? Justify. CO2 K2

CO’s Bloom’s
Q. No Questions
Level
Part - B
(I) Define scheduling .Explain SJF scheduling algorithms. (8) CO2
1. (II) Compute the average waiting time for the processes using non - K3
pre-emptive SJF scheduling algorithm. (5)
Describe the differences among short- term, medium-term and long - CO2
2. K3
term scheduling with suitable example.
What is a process? Discuss components of process and various states CO2
3. K3
of a process with the help of a process state transition diagram.
Discuss how the following pairs of scheduling criteria conflict in CO2
certain settings.
I) CPU utilization and response time.
4. K3
II) Average turnaround time and maximum waiting time.
III) I/O device utilization and CPU utilization.

I) Discuss the actions taken by a kernel to context-switch between CO2

5. processes. (7) K3
II) Describe PCB. Explain process state transition diagram. (6)
Consider the following set of processes with the length of the CPU CO2
- burst time in given ms:

Process Arrival Burst time

time
P1 0 7
P2 2 4
6. P3 4 1 K3
P4 5 4
P5 3 4

Draw four Gantt charts illustrating the execution of these processes

using FCFS, SJF, priority and RR(quantum=2)scheduling. Also
calculate waiting time and turnaround time for each scheduling
algorithms.
7 Explain Deadlock detection with suitable example. CO2 K2
Consider the snapshot of a system CO2

Max Allocation Available

ABCD ABCD ABCD
P0 2001 42 12 3321
P1 3121 52 52
8 K3
P2 2103 23 16
P3 1312 14 24
P4 1432 36 65
Answer the following Using Banker’s algorithm,
Illustrate that the system is in safe state by demonstrating an order in
which the processes may complete?
 If a request from process P1 arrives for (1, 1, 0, 0) can the request be
granted immediately?
If the request from p4 arrives for (0,0,2,0) can the request be granted
immediately?

CO’s Bloom’s
Q. No Questions
Level
Part - C
Consider the following system snapshot using data structures in the CO2
Banker’s algorithm with resources A, B, C and D and process P0 to
P4:

1. K3

Using Banker’s algorithm, answer the following questions:

(i)How many resources of type A, B, C and D are there?
(ii)What are the contents of the need matrix?
Is the system in a safe state? Why?
(iii) If a request from process P4 arrives for additional resources of
(1, 0, 0, 1)
(iv) Can the banker’s algorithm grant the request immediately? Show
the new system state and other criteria.
Consider the following set of processes with the length of the CPU- CO2
burst time in ms: all 5 processes arrive at time 0 in the order given.
Process Burst Time
P1 10
P2 29
P3 03
2. K3
P4 07
P5 12
Draw four Gantt charts illustrating the execution of these processes
using FCFS, SJF, priority and RR (quantum=05) scheduling.
Also calculate average waiting time and turnaround time for each
scheduling algorithms.

UNIT III - MEMORY MANAGEMENT

CO’s Bloom’s
Q. No Questions
Level
Part - A
1. Name any two differences between logical and physical addresses. CO3 K1
2. Differentiate paging and segmentation. CO3 K1
3. What is the purpose of paging the page tables? CO3 K1
4. What is a working set model? CO3 K1
 In memory management consider the program named as Stack1 CO3
which size is 100 KB. This program is loaded in the main memory
5. K3
from 2100 to 2200 KB. Show the contents of the page map table for
the given scenario.
6. When is page replacement algorithm needed? CO3 K1
Will optimal page replacement algorithm suffer from Belady’s CO3
7. K3
anomaly? Justify your answer.
8. State the effect of Thrashing in an operating system. CO3 K1

CO’s Bloom’s
Q.No Questions
Level
Part – B
(I) When do page faults occur? (3) CO3
(II) Consider the reference string:1,2,3,4,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.
1. How many page faults and page fault rate occur for the FIFO, LRU K3
and optimal replacement algorithms, assuming three and four page
frames? (10)
Given memory partitions of 500 KB, 100 KB, 300 KB, 200 KB and CO3
600 KB in order, how would each of the first-fit, best-fit, and worst-
2. fit algorithms place processes of size 418 KB, 202 KB, 506 KB,11 2 K3
KB, and 95 KB (in order)? Which the algorithms make the most
efficient use of memory?
With a neat sketch, explain how logical address is translated into CO3
3. K3
physical address using Paging mechanism.
Discuss the given memory management techniques with diagrams. CO3
4. (i) Paging and Segmentation (7) K2
(ii) Translation Look-aside Buffer.(6)

CO’s Bloom’s
Q.No Questions
Level
Part - C
Consider the following page reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, CO3
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?
1. Remembering all frames are initially empty. K5
LRU replacement
FIFO replacement
Optimal replacement.
Differentiate internal and external fragmentation? CO3
Suppose that we have memory of 1000 KB with partitions of size 150
2. KB , 200 KB, 250 KB, 100 KB AND 300 KB. Where the processes A K5
and B of size 175 KB and 125 KB will be loaded, if we used Best fit
and Worst fit?