MENU
OPERATING SYSTEMS
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 - 2018)
SEMESTER - VI
Subject Code 17CS64
IA Marks 40
Number of Lecture Hours/Week 4
Exam Marks 60
17CS64 - OPERATING SYSTEMS
Important Questions - MODULE - 3
These Questions are being framed for helping the students in the "FINAL Exams" Only (Remember for Internals the Question Paper is set by your respective teachers). Questions may be repeated, just to show students how VTU can frame Questions.
- ADMIN
17CS64 - OPERATING SYSTEMS
Question Bank - MODULE - 3
1. System consists of five jobs (J1, J2, J3, J4, J5) and three resources (R1, R2, R3). Resource type R1 has 10 instances, resource type R2 has 5 instances and R3 has7 instances. The following snapshot of the system has been taken.
|
Jobs |
Allocation |
Maximum |
Available |
||||||
|
J1 |
R1 |
R2 |
R3 |
R1 |
R2 |
R3 |
R1 |
R2 |
R3 |
|
0 |
1 |
0 |
7 |
5 |
3 |
3 |
3 |
2 |
|
|
J2 |
2 |
0 |
0 |
3 |
2 |
2 |
|||
|
J3 |
3 |
0 |
2 |
9 |
0 |
2 |
|||
|
J4 |
2 |
1 |
1 |
2 |
2 |
2 |
|||
|
J5 |
0 |
0 |
2 |
4 |
3 |
3 |
|||
Find need matrix and calculate the safe sequence by using Banker's algorithm. Mention the above system is safe or not safe. (06 Marks) (Dec.2019/Jan.2020)
2. What is dead lock? What are necessary conditions an operating system must satisfy for a deadlock to occur? (05 Marks) (Dec.2019/Jan.2020)
3. What is a Resource Allocation Graph (RAG)? Explain hay RAG is very useful is describing deadly embrace by considering own example. (05 Marks) (Dec.2019/Jan.2020)
4. What are Translation Load Aside Buffer (TLB)? Explain TLB in detail with a simple paging system with a neat diagram. (06 Marks) (Dec.2019/Jan.2020)
5. Given the memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K apply first fit, best fit and worst fit algorithms to place 212K, 417K, 112K and 426K. (05 Marks) (Dec.2019/Jan.2020)
6. Describe both internal and external fragmentation problems encountered in a contiguous memory allocation scheme. (05 Marks) (Dec.2019/Jan.2020)
7. Determine whether the following system is in safe state by using Banker's algorithm.
|
Process |
Allocation |
Maximum |
Available |
||||||
|
P1 |
A |
B |
C |
A |
B |
C |
A |
B |
C |
|
0 |
1 |
0 |
7 |
5 |
3 |
3 |
3 |
2 |
|
|
P2 |
2 |
0 |
0 |
3 |
2 |
2 |
|||
|
P3 |
3 |
0 |
2 |
9 |
0 |
2 |
|||
|
P4 |
2 |
1 |
1 |
2 |
2 |
2 |
|||
|
P5 |
0 |
0 |
2 |
4 |
3 |
3 |
|||
If a request for P1 arrives for (1 0 2), can the request be granted immediately? (09 Marks) (June/July.2019)
8. Discuss the various approaches used for deadlock recovery. (07 Marks) (June/July.2019)
9. Illustrate with example, the internal and external fragmentation problem encountered in continuous memory allocation. (07 Marks) (June/July.2019)
10. Explain the structure of page table. (09 Marks) (June/July.2019)
11. Define deadlock. Write short notes on 4 necessary conditions that arise deadlocks. (06 Marks) (Dec.2018/Jan.2019)
12. Assume that there are 5 processes PO through P4 and 4 types of resources. At time T0 we have the following state:
|
Process |
Allocation |
Maximum |
Available |
|||||||||
|
P0 |
A |
B |
C |
D |
A |
B |
C |
D |
A |
B |
C |
D |
|
0 |
0 |
1 |
2 |
0 |
0 |
1 |
2 |
1 |
5 |
2 |
0 |
|
|
P1 |
1 |
0 |
0 |
0 |
1 |
7 |
5 |
0 |
||||
|
P2 |
1 |
3 |
5 |
4 |
2 |
3 |
5 |
6 |
||||
|
P3 |
0 |
6 |
3 |
2 |
0 |
6 |
5 |
2 |
||||
|
P4 |
0 |
0 |
1 |
4 |
0 |
6 |
5 |
6 |
||||
|
P5 |
0 |
0 |
2 |
4 |
3 |
3 |
||||||
Apply Banker's algorithm to answer the following:
i) What is the content of need matrix?
ii) Is the system in a safe state?
ii) If a request from a process P1(0, 4, 2, 0) arrives, can it be granted? (10 Marks) (Dec.2018/Jan.2019)
13. Write short notes on:
i. External and internal fragmentation
ii. Dynamic loading and linking. (04 Marks) (Dec.2018/Jan.2019)
14. Analyse the problem in simple paging technique and show how TLB is used to solve the problem. (08 Marks) (Dec.2018/Jan.2019)
15. Given the memory partitions of 200k, 700k 500k, 300k. 100k. 400k. Apply first fit and best fit to place 315k, 427k, 250k, 550k. (04 Marks) (Dec.2018/Jan.2019)
16. Consider the following snapshot of a system
|
Process |
Allocation |
Maximum |
Available |
||||||
|
P0 |
A |
B |
C |
A |
B |
C |
A |
B |
C |
|
0 |
0 |
2 |
0 |
0 |
4 |
1 |
0 |
2 |
|
|
P1 |
1 |
0 |
0 |
2 |
0 |
1 |
|||
|
P2 |
1 |
3 |
5 |
1 |
3 |
7 |
|||
|
P3 |
6 |
3 |
2 |
8 |
4 |
2 |
|||
|
P4 |
1 |
4 |
3 |
1 |
5 |
7 |
|||
Find the need matrix and calculate safe sequence using Banker's algorithm. Mention the above system is safe or not safe. (08 Marks) (June/July 2018)
17. What are the necessary conditions for deadlock? Explain different methods to recover from deadlock. (08 Marks) (June/July 2018)
18. What is paging? Explain paging hardware with translation look-aside buffer. (06 Marks) (June/July 2018)
19. Explain the structure of page table with respect to hierarchical paging. (06 Marks) (June/July 2018)
20. Given the 5 memory partitions 100 KB, 500 KB, 200 KB, 300 KB and 600 KB, how each of the first fit, best fit and worst fit algorithms place processes of 212 KB, 417 KB, 112KB and 426KB size. Which algorithm makes efficient use of memory? (04 Marks) (June/July 2018)
21. Explain Resource-Request algorithm. (06 Marks) (Dec.2017/Jan.2018)
22. What is a Deadlock? Briefly explain the methods for handling dead locks. (06 Marks) (Dec.2017/Jan.2018)
23. Consider a system with five processes Po through P4 and three resources A. B, C Resources A has ten instances, resources type B has five instance and resource type C has seven instances. Suppose that at time. To the following snapshot of the system has been taken.
|
Process |
Allocation |
Maximum |
Available |
||||||
|
P0 |
A |
B |
C |
A |
B |
C |
A |
B |
C |
|
0 |
1 |
0 |
7 |
5 |
3 |
3 |
3 |
2 |
|
|
P1 |
2 |
0 |
0 |
3 |
2 |
2 |
|||
|
P2 |
3 |
0 |
2 |
9 |
0 |
2 |
|||
|
P3 |
2 |
1 |
1 |
2 |
2 |
2 |
|||
|
P4 |
0 |
0 |
2 |
4 |
3 |
3 |
|||
i. Is the system in a safe state?
ii. If a request from P arrives for (1, 0, 2) can the request be granted immediately. (08 Marks) (Dec.2017/Jan.2018)
24. Give the difference between (i) Internal and external fragmentation (ii) Paging and segmentation. (06-Marks) (Dec.2017/Jan.2018)
25. What is deadlock? Explain the necessary conditions for its occurrence. (06 Marks) (June/July.2017)
26. System consists of five jobs (J1, J2, J3, J4, J5) and three resources (R1. R2, R3), Resource type R1 has 10 instances, resource type R2 has 5 instances and R3 has 7 instances. The following snapshot of the system has been taken:
|
Jobs |
Allocation |
Maximum |
Available |
||||||
|
J1 |
R1 |
R2 |
R3 |
R1 |
R2 |
R3 |
R1 |
R2 |
R3 |
|
0 |
1 |
0 |
7 |
5 |
3 |
3 |
3 |
2 |
|
|
J2 |
2 |
0 |
0 |
3 |
2 |
2 |
|||
|
J3 |
3 |
0 |
2 |
9 |
0 |
2 |
|||
|
J4 |
2 |
1 |
1 |
2 |
2 |
2 |
|||
|
J5 |
0 |
0 |
2 |
4 |
3 |
3 |
|||
(08 Marks) (June/July.2017)
27. Describe RAG:
i) With deadlock
ii) With a cycle but no deadlock. (06 Marks) (June/July.2017)
28. Explain internal and external Fragmentation with examples. (06 Marks) (June/July.2017)
29. Explain with a diagram, how TLB is used to solve the problem of simple paging scheme. (08 Marks) (June/July.2017)
30. Define deadlock. What are the necessary conditions for deadlock to occur? Indicate how many of these should occur for dead lock to happen? (10 Marks) (Dec.2016/Jan.2017)
31. State and explain banker's algorithm for deadlock avoidance. (10 Marks) (Dec.2016/Jan.2017)
32. What is the principle behind paging? Explain its operation, clearly indicating how the logical addresses are converted to physical addresses. (10 Marks) (Dec.2016/Jan.2017)
-ADMIN
ANSWER SCRIP FOR THESE QUESTIONS WILL BE UPLOADED "AS SOON AS POSSIBLE"
Visit: https://hemanthrajhemu.github.io/AnswerScript/
For immediate Notification Join the Telegram Channel
-ADMIN
T = Text book
QB = Question Bank
AS = Amswer Script
-ADMIN