Assignment No. 03View more random threads:
- CS614 Data Warehousing Assignment No.4 Fall Semester 2013...
- cs302 assignments no 01 Solution spring October 2011
- CS615 Software Project Management assignment no 4 fall 7...
- cs604 assignment no 4 idea solution spring June 2011
- CS614 Data Warehousing VU Assignment No 4 Spring June 2012...
- Assignment No. 3 Semester: Spring 2015 Computer Network-...
- cs615 assignment no 3 spring 2011 idea solution
- CS410 Visual Programming Assignment No.3 Fall 2013
- CS402 Theory of Automata assignment no 1 spring fall...
- CS501 Advance Computer Architecture Assignment No.1...
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
Sponsored Links
There are currently 1 users browsing this thread. (0 members and 1 guests)