narayanapot

Pre-Final Year Student at IIIT Gwalior.

Alma Mater:

M.Tech in Computer Science and Engineering
ABV Indian Institute of Information Technology & Management, Gwalior
Sunday, 1 January 2012 to Sunday, 1 January 2017

Experience:

Project Trainee
Tech Mahindra
Wednesday, 1 January 2014
Intern
Techtud
Friday, 1 January 2016
Research Intern
IBM Research Labs
Friday, 1 January 2016
Techtud Editor
Video lecture
1 year 3 weeks ago

A Video from YouTube (Channel: Tushar Roy) explains 0/1 Kanpsack Problem.

morelessWatch Now
Techtud Editor
Video lecture
1 year 3 weeks ago

A Video from YouTube (Channel: CSBreakdown) explains Matrix Chain Multiplication

morelessWatch Now
Techtud Editor
Video lecture
1 year 3 weeks ago

A Video from YouTube (Channel: CSBreakdown) explains Huffman Codes

morelessWatch Now
Techtud Editor
Video lecture
1 year 3 weeks ago

A Video from YouTube (Channel: Tushar Roy) explains Single Source Shortest Path.

morelessWatch Now
Techtud Editor
Video lecture
1 year 3 weeks ago

A Video from YouTube (Channel: tony esquivel) explains Minimum Cost Spanning Tress.

morelessWatch Now
Ravindra Babu Ravula
Himanshu Kaushik
Vivek Vikram Singh
Pritam Prasun
Pritam Prasun
Vivek Vikram Singh
Rajesh Kumar Pandey
Parth Shah
Vinita Sangwan
partha
Sumit Verma
Keval Kubavat
biranchi
Shivesh Kumar Roy
Monika
AMIT CHAUDHARY
Arijit Nandi
Palanisamy M

Pages

23 Mar 2016 - 10:10pm

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

more less
22 Mar 2016 - 11:12pm

LIFO = 31

OPTIMAL = 30

DIFFERENCE = 31-30 = 1

more less