1

option A Let P(x)=All are multiple of 4 Q(X)= All are even numbers if a ∈ P(X) then a must ∈ Q(X)

2

Consider the virtual page reference string $\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$ on a demand paged virtual memory system running on a computer system that has main memory size of $3$ page frames which are initially empty. Let $\text{LRU}$, $\text{FIFO}$ and $\text{OPTIMAL}$ ... $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$ $\text{OPTIMAL} = \text{LRU}$ $\text{OPTIMAL} = \text{FIFO}$

3

Humm.. If call by value is robust, then call by value result must also be robust.

4

**Important Questions**

http://gateoverflow.in/questions/computer-networks?sort=featured

**More Questions**

Good problems on Sliding Window Protocols: http://web.mit.edu/6.02/www/s2011/handouts/tutprobs/transport.html

To see more, click for the full list of questions or popular tags.