Which of the following programming techniques and structures are “good” for a demand paged environment (that is, tend to produce fewer page faults)? Which are not good? Explain your answers.
a. Stack
b. Sequential search
c. Binary search
d. Pure code (also called “reentrant code”)
e. Indirection (that is, accessing objects through pointers)

This problem confuses me. Doesn't it depend on the size of the structure being used? Here is what I guess:

a. Stack
Stack is good.
b. Sequential search
Sequential Search is good.
c. Binary search
Binary search is not good.
d. Pure code (also called “reentrant code”)
Pure code is not good.
e. Indirection (that is, accessing objects through pointers)
Indirection is not good.

But I'm not able to explain it properly. Can someone link me to material that explains everything to me (and not wikipedia--I went there and it didnt help much) or explain to me how all this works?