Member Since 1 year 4 months
A Video from YouTube (Channel: Tushar Roy) explains 0/1 Kanpsack Problem.
A Video from YouTube (Channel: CSBreakdown) explains Matrix Chain Multiplication
A Video from YouTube (Channel: CSBreakdown) explains Huffman Codes
A Video from YouTube (Channel: Tushar Roy) explains Single Source Shortest Path.
A Video from YouTube (Channel: tony esquivel) explains Minimum Cost Spanning Tress.
Page Fault Rate Pf = 0.6,
Dirty Page Probability, Dp = 0.5
Page Fault Service Time, Ps = 200 ms
Time taken to Replace Dirty Page, Td = 150 ms
Memory Access time, Ma = 100 ms
Effective memory Access Time is given as:
EMAT = Pf(Pd(Td) + (1-Pd)(Ts)) + [1-Pf](Ma)
= 0.6[0.5(200) + 0.5(150)] + [1-0.6](100) ms
= 0.3(350) + 0.4(100) ms
= 105 + 40 ms = 145ms
LIFO = 31
OPTIMAL = 30
DIFFERENCE = 31-30 = 1
Here is a chance to join biggest community of technical Students, Tutors with FREE learning resources and so much more.
It takes less then 60 seconds.