Corrections to Introduction, local page numbers page 6, line-3: should read λ(1 − λ)(d/dλ) 2 f + (c − (a + b + 1)λ)(d/dλ)f − abf = 0 Corrections to Chapter 2, local page numbers page 32, line 1 of Remarks 2.10.4: should begin 1) Here is a slightly variant... page 48, lines 2-3 of Corollary 2.13.3 should end/begin Then K = L χ(x−1) [1] satisfies K mid× D(inv K) = δ 1. Corrections to Chapter 8, l...

Page iii Title iv I Summary Introduction pp 1-21 Paper 1 Page v II Paper 1 pp 1-37 Introduction pp 1-5 Materials & Methods pp 6-9 Title page for Figures & Legends p 10 Figures & Legends pp 11-25 Results pp 26-30 Discussion pp 31-37 Paper 2 Page vi III Paper 2 pp 1-4

Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson and Shedler [5] constructed reference strings for which page replacement algorithm FIFO [10, 13, 36, 40] produces near twice more page faults in a larger memory than in a smaller one. They formulat...