Professional Documents
Culture Documents
CO DL
1.
a) Suppose you have a resource allocation graph with cycle. How can you 1 CO1 C2
think that deadlock will be occured here or not?
b) Which is better between deadlock recovery and deadlock avoidance 1 CO1 C2
techniques and why?
c) Consider a system with five processes P0 through P4 and three resource 3 CO4 C5
types A, B, C. Resource type A has 10 instances, resource B has 5
instances and resource C has 7 instances. Suppose that at time T0, the
following snapshot of the system has been taken:
Job/Process Allocation Max Available
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 022 433
Suppose the process P2 is requesting (2,0,0). Will the request be
satisfied? If yes, then write the sequence.
d) Do you think that Safety algorithm is very essential with resource 1 CO3 C3
allocation algorithm----why?
2.
a) To decrease the miss rate of finding pages what are the essential tasks 1 CO4 C5
needed?
b) What are the main benefits of using two level page table structure over 1 CO4 C5
one level?
c) Do you think compaction technique is efficient to manage memory ---- 2 CO1 C2
how?
d) Suppose you would like to use the proper space of memory allocation--- 2 CO1 C2
how?
3.
a) You have not proper space in your main memory. How can you manage 2 CO1 C2
the memory ----explain?
b) How lazy swapper relates demand paging? 1 CO1 C2
c) Which is better between LRU and Optimal page replacement algorithm- 3 CO4 C5
-----explain?
4.
5.
a) Suppose you want to assign a copied privileges to an object. How can 2 CO1 C2
operating system keep track of it in respect of domain?
b) What type of malware is very dangerous and how? 2 CO1 C2
c) How hardware firewall can work? 1 CO1 C2
d) Which is the best security technique and how can it work? 1 CO4 C5
END