UNIT-1 (Operating Systems)

BCA - I Semester
Subject: Operating Systems(BCA113B)
Unit-III Assignment
Date of Release:19/11/2022
Last Date of Submission: 29/11/2022
Part-A 20X1=20
1. A problem encountered in multitasking when a process is perpetually denied necessary
resources is called ____________
a) deadlock b) starvation c) inversion d) aging
2. Which one of the following is a visual (mathematical) way to determine the deadlock
occurrence?
a) resource allocation graph b) starvation graph c) inversion graph d) none of the
mentioned
3. A system is in the safe state if ____________
a) The system can allocate resources to each process in some order and still avoid a deadlock

b) There exist a safe sequence c) both a and b d) none of the mentioned

4. What is the drawback of banker’s algorithm?

a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned

5. If the wait for graph contains a cycle ____________

a) Then a deadlock does not exist b) then a deadlock exists

c) then the system is in a safe state d) Either deadlock exists or system is in a safe state

6. Memory management technique in which system stores and retrieves data from secondary
storage for use in main memory is called?

a) Fragmentation b) paging c) mapping d) none of the

mentioned

7. Operating System maintains the page table for ____________

a) each process b) each thread c) each instruction d) each address
8. Memory management technique in which system stores and retrieves data from secondary
storage for use in main memory is called?
a) Fragmentation b) paging c) mapping d) none of the mentioned

9. Program always deals with ____________

a) logical address b) absolute address c) physical address d) relative address

10.Which of the following factor considered the most in management of memory?

a. Efficient use of memory.
b. Speedy allocation of memory.
c. Speedy deallocation of memory.
d. All of the above.
11) Mapping of Pages from virtual to physical address is done by
a) memory management unitb) CPUc) PCId) none of the mentioned
12) In contiguous fixed allocation :
a) each file must occupy a set of contiguous blocks on the disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in one location
d) None of these
13) Which algorithm chooses the page that has been used for the longest period of time
whenever the page required to be replaced?
a) first in first out algorithm b) additional reference bit algorithm
c) least recently used algorithm d) counting based page replacement algorithm
14) When using counters to implement LRU, we replace the page with the :
a) smallest time value b) largest time value
c) greatest size d) None of the mentioned
15) The first fit, best fit and worst fit are strategies to select a ______.
a) process from a queue to put in memory b) processor to run the next process
c) free hole from a set of available holes d) All of these
16) In what kind of memory allocation scheme memory block assigned to process is bigger.
Some portion of memory is left unused, as it cannot be used by another process.
a) External Fragmentation b) Internal Fragmentation
c) Both a and b d) None
17) __________ is a technique in which process address space is broken into blocks of the same
size to be mapped into the primary memory.

A. Fragmentation B. Frames
C. Paging D. Address Translation
18) With paging there is no ________ fragmentation.

a) internal b) external c) any of the above d) none of the above

19) Following page replacement algorithms suffers from Belady’s anomaly?

a) FIFO b) LRU c) MRU d) None

20) In multiple instance RAG if contains circular wait than the system is in
a) deadlock b)not in deadlock c) May be in deadlock d) none
Part-B 5X2=10
Q.1 What are the different types of vertices in RAG. Explain with example.
Q.2 What are the different ways to recover from deadlock.
Q.3 Write short note on starvation.
Q.4 Discuss limitations of Banker’s algorithm.
Q.5 Differentiate between Starvation and Deadlock.
Part-C 5X6=30
Q.1 Show the use of multiple instance rag with a suitable example creating RAG table.  
Q.2 What are deadlocks? What are necessary conditions for occurrence of a deadlock?
Q.3 How can deadlock be avoided ,explain with the help of an example.
Q.4. What is need matrix? Explain with the help of an example.
Q.5. Explain deadlock prevention strategies with all the approaches.
Part-D 2X10=20
Q1. Explain Banker’s algorithm with it’s advantages and disadvantages.
Let us consider the following snapshot for understanding the banker's algorithm:
Maximum Instances of resources of XYZ ( 10,6,7)
Processes Allotted XYZ Max XYZ Available XYZ
A0 112 433 ?
A1 212 322
A2 401 902
A3 020 753
A4 112 112

1. calculate the content of the need matrix?

2. Check if the system is in a safe state?
3. Determine the availableinstances of each type of resource?
4. What will be the safe sequence.

Q. 2. Explain deadlock detection for a single instance RAG and Multi instance RAG with the
help of examples.