SNU
SISTER NIVEDITA
UNIVERSITY
SPRING, 2023
End Semester Assessment
Registration No 210100I50070
Name of the Student (in Block
Letter) 30URADEEP MVKHERJEE
Full Signature of the Invigilator
with Date
Program Name: [Link] COMPUTER SCIENCE AND ENGINEERING(ARTIFICIAL INTELLIGENCE
AND MACHINE LEARNING)
Subject Name: OPERATING SYSTEMS Subject Code: 1000103106
Subject Type: Theory Semester: IV
Time Allotted: 2 Hours Marks: 50
Group A
(Answer All: Each question carries 1 Mark)
1x10=10
i. What is the purpose of resource allocation graph?
"a) To represent deadlock b) To detect deadlock
c) Toavoid deadlock d) To prevent deadlock.
ii. CPU generates
a) Logical addresses b) Physical addresses
c) Relocatable addresses d) None of these
1
ii. If a process has 24K bytes logical address space and the page size 4096 bytes then
the number of pages of that process is
a) 12 " b) 6
c) 8 d) 16
iv. Dynamic partitioned memory allocation can lead to 1
a) externalfragmentation b) internal fragmentation
c) both (a) and (b) d) none of these
v. Banker's algorithm is used for 1
a) deadlock avoidance " b) context switching
c) deadlock recovery d) Deadlock prevention
vi. Moving a process from the main memory tothe disk is called 1
a) caching b) Swapping
c) termination d) Interruption
vii. Virtual memory is
a) an extremely large main memory b) an extremely large secondary
memory
c) an illusion of an extremely large d) a type of memory used in
memory supercomputers
vi. Threads have their own
a) Heap b) Address space
c) Global variables d) Stack
ix. The page fault frequency in virtual memory is reduced
a) when the page size is reduced b) processes are stored in virtual
memory
Page 1 of 3
SNU
SISTER NIVEDITA
RSILY
SPRING, 2023
End Semester Assessment
c) Due to locality of references in d) none of these
the process
X. Which of the following is not a
part of operating system?
a) Kernel
c) Application program b) Shell
d) Critical section
Group B
(Answer any Four: Each qucstion carries 5 Marks)
4x5-20
Mention the basic principles of Round Robin
Scheduling.
Specify the impact of time quantum on its performance.
2.5+2.5
What is a thread? Compare a thread and a
Why page sizes are always chosen as process.
powers
1+4
difference between logical and physical addresses? of 2? What is the 2+3
5. What is a virtual memory? How virtual
memory technique help us in 1+1+3
memory management?
Compare the best fit and first fit algorithms for partition
allocation. memory
6. Give details of how paging is implemented in hardware.
a Translation Look-aside-Buffer (TLB) is and give Explain what
2+3
detaits of its
working.
What is inter-process communication(IPC)? What are the fundamental 1+2+2
models used for IPC?
Briefly explain the benefits of IPC.
Group C
(Answer any Two: Each question carries 10 Marks)
2x10=20
8. Consider the following set of processes, with the lengths of the CPU-burst time 6+4
given in millisecond :
Process Burst Time Arrival Priority
Time
PI 10 0
P2 1
P3 2 3
P4 1 4
P 5 3
a. Draw Gantt charts illustrating the execution of these processes under non
pre-emptive priority scheduling (lower the number, higher the priority) and
round robin scheduling (time quantum = 1 millisecond) policies.
b. Compute the average turnaround time and the average waiting time.
Page 2 of3
SNU
SISTER NIVEDITA
UNIVERSITY
SPRING, 2023
End Semester Assessment
Consider thefollowing snapshot of asystem where r, (i= 1,2,3,4 ) denotes 5+5
resource type and P1, P2,.,.P5 denote processes.
Process Current Maximum Available
allocation allocation
PI 0 0 1 2 0 1 2 2 1 0 0
P2 2 0 0 0 2 7 5 0
P3 0 0 3 4 6 6 5 6
3 5 4 4 3 5 6
P4
0 3 3 2 0 6 5 2
P5
a. Isthis system currently in a safe state? Justify your answer.
b. Ifa request from P3 arrives for (0, 1, 0, 0 ), can that request be safely
granted immediately?
Assume that there are three frames in the memory available to a
process. (2x4)
10. a.
8, 7, 8, 7, +2
Given that the pages referenced by the process are 0, 9, 0, 1, 8, 1,
1,2, 8, 2, 7. How many page faults will occur using i) FIFO replacement
strategy ii) LRU replacement strategy?
b. What is thrashing?
and sufficient conditions for 5+5
11. a. What is a deadlock? Describe the necessary
the occurrence ofa deadlock.
b. Describe different deadlock prevention strategies?
Page 3 of 3
