1. Would you consider a URL such as "http://www.acme.org/index.html" to be location independent? What about "http://www.acme.nl/index.html" ?

2. How is a mounting point looked up in most UNIX Systems ?

3. Consider DNS. To refer to a node N in a sub-domain implemented as different zone than the current domain, a name server for that zone needs to be specified. Is it always necessary to include a resource record for that server's address, or is it sometimes sufficient to provide only its domain name ?

4. Is an identifier allowed to contain information on the entity it refers to?

5. Give an example of how the closure mechanism for a URL could work.

6. Explain the difference between a hard link and a soft link in UNIX Systems.

7. High-level name servers in DNS, that is, name servers implementing nodes in the DNS name space that are close to the root, generally do not support recursive name resolution. Can we expect much performance improvement if they did ?

8. Explain how DNS can be used to implement a home-based approach to locating mobile hosts.

9. Suppose that it is known that a specific mobile entity will almost never move outside domain D, and if it does, it can be expected to return soon. How can this information be used to speed up the lookup operation in a hierarchical location service ?

10. In a hierarchical location service with a depth of k, how many location records need to be updated at most when a mobile entity changes its location ?

11. Consider an entity moving from location A to B, while passing several intermediate location where it will reside for only a relatively short time. Changing an address in a hierarchical location service may still take a relatively long time to complete, and should therefore be avoided when visiting an intermediate location. How can the entity be located at an intermediate location ?

12. Make clear that weighted reference counting is more efficient than simple reference counting. Assume communication is reliable.

13. Is it possible in generation reference counting that an object is collected as garbage while there are still references, but which belong to a generation the object does not known of?

14. Is it possible in generation reference counting that an entry G[i] becomes less than 0?

15. In reference listing, if no response is received after sending a ping message to process P, the process is removed from the object's reference list. Is it always correct to remove the process?

16. Describe a very simple way to decide that the stabilization step in the tracing-based garbage collector of Lang et al. has been reached.