01-20-2016, 05:56 PM
Assignment No. 03
Semester: Fall 2015
CS604 –Operating System
Total Marks: 20
Due date:21-01-2016
Assignment Objective:
Implementation of Banker’s algorithm
To know algorithm working to check the safe and unsafe state
Allocation, available and maximum utilization of resources checking
Finding the safe sequence of process execution
Uploading instructions:
Your assignment must be in .doc format (Any other formats like scan images, PDF, bmp, etc will not be accepted).
Save your assignment with your ID (e.g. bc020200786.doc).
No assignment will be accepted through email.
Rules for Marking:
It should be clear that your assignment will not get any credit if:
The assignment is submitted after due date.
The submitted assignment does not open or file is corrupted.
Your assignment is copied from internet, handouts or from any other student
(Strict disciplinary action will be taken in this case).
Assignment
Question
You have to show the working of Banker’s algorithm in this assignment. Consider four processes P0, P1, P2, P3 and three resource types A, B, C. Resource types A has 9 instances, Resource type B has 6 instances and resource type C has 4 instances. Maximum and allocated resources are given according to the following table.
Process
Allocation
Max
Available
A
B
C
A
B
C
A
B
C
P0
1
1
1
8
4
2
P1
3
2
0
4
3
1
P2
2
0
0
5
0
2
P3
2
1
1
7
4
3
You have to give the following:
Give available resources in the table
Show execution of the Banker’s algorithm by giving the table step wise
Finally find the safe sequence of execution of processes
NOTE: Do not put any query on MDB about this assignment, if you have any query then email at cs604@vu.edu.pk.
No need to write theory. Just give tables.
Deadline: Your assignment must be uploaded/submitted on or before 21-01-2016
Semester: Fall 2015
CS604 –Operating System
Total Marks: 20
Due date:21-01-2016
Assignment Objective:
Implementation of Banker’s algorithm
To know algorithm working to check the safe and unsafe state
Allocation, available and maximum utilization of resources checking
Finding the safe sequence of process execution
Uploading instructions:
Your assignment must be in .doc format (Any other formats like scan images, PDF, bmp, etc will not be accepted).
Save your assignment with your ID (e.g. bc020200786.doc).
No assignment will be accepted through email.
Rules for Marking:
It should be clear that your assignment will not get any credit if:
The assignment is submitted after due date.
The submitted assignment does not open or file is corrupted.
Your assignment is copied from internet, handouts or from any other student
(Strict disciplinary action will be taken in this case).
Assignment
Question
You have to show the working of Banker’s algorithm in this assignment. Consider four processes P0, P1, P2, P3 and three resource types A, B, C. Resource types A has 9 instances, Resource type B has 6 instances and resource type C has 4 instances. Maximum and allocated resources are given according to the following table.
Process
Allocation
Max
Available
A
B
C
A
B
C
A
B
C
P0
1
1
1
8
4
2
P1
3
2
0
4
3
1
P2
2
0
0
5
0
2
P3
2
1
1
7
4
3
You have to give the following:
Give available resources in the table
Show execution of the Banker’s algorithm by giving the table step wise
Finally find the safe sequence of execution of processes
NOTE: Do not put any query on MDB about this assignment, if you have any query then email at cs604@vu.edu.pk.
No need to write theory. Just give tables.
Deadline: Your assignment must be uploaded/submitted on or before 21-01-2016
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]