Consider two well-formed formulas in propositional logic
$$F1:P \Rightarrow \neg P$$
$$F2:\left( {P \Rightarrow \neg P} \right) \vee \left( {\neg P \Rightarrow } \right)$$

Which of the following statements is correct?

The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called

Which of the following statements is false?

Consider a virtual memory system with $$FIFO$$ page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will