Prove that “Roney is naughty” using resolution algorithm.
S is the start state and G is the goal state. The heuristics of the states are:
h(S) = 12, h(A)=8, h(D)=9, h(B)=7, h(E)= 4, h(C)=5, h(F)=2, h(G)=0.
a) Linux Scheduling
b) Fragmentation
What are the physical address for the following logical addresses?
a. 0,430
b. 1,10
c. 1,11
d. 2,500
a. What will happen if process P3 requests 1 resource?
b. What will happen if process P4 requests 1 resource?
Share this link via
Or copy link