Consider a page reference string for a process with a working set of m frames, initially all empty. the page reference string is of length p with n distinct page numbers in it.
for any page replacement algorithm, what is an upper bound on the number of page faults?

The “rule of 72” is used to approximate the time required for prices to double due to inflation. if the inflation rate is r%, then the rule of 72 estimates that prices will double in 72/r years. for instance, at an inflation rate of 6%, prices double in about 72/6 or 12 years. write a program to test the accuracy of this rule. for each interest rate from 1% to 20%, the program should display the rounded value of 72/r and the actual number of years required for prices to double at an r% inflation rate. (assume prices increase at the end of each year.)

Is an attack that relies on guessing the isns of tcp packets

Which option completes the explanation for conflict of interest in an organization