Effectiveness of TLB This is a book question:


  Suppose that a machine has 48-bit virtual addresses and 32-bit
  physical addresses.
  
  Suppose this same system has a TLB (Translation Lookaside Buffer) with
  32 entries. Furthermore, suppose that a program contains instructions
  that fit into one page and it sequentially reads long integer elements
  from an array that spans thousands of pages. How effective will the
  TLB be for this case?


Answer: I think that we cannot know the effectiveness of the TLB because we do not know the number of instructions the program has. I hope I make sense.

source:
Modern Operating Systems
Question 15, chapter 3
ISBN-13: 978-0-13-359162-0
Assuming size of long is $32$ bits, each page frame in physical memory exactly contain $1$ long number, therefore in $TLB$ at particular instance of time $31$ long integers would be present. Hence, $1$ page fault in every $32$ memory accesses. Now, I am not sure what is criteria of effectiveness here. But $1$ per $32$ memory access seems pretty good.