Question: Question 1 (10 points): What is an interprocess communication?

Answer:

Question 2 (10 points): a) What is a remote procedure call in distributed computing? b) What are client and server stubs? c) Show an example.

Answer:

a)

b)

c)

Question 3 (10 points):

a) What is the distributed hash table system with the Chord system?

b) Explain how key 26 from node 1 and key 12 from node 28 are resolved in the following Chord system.

Answer:

a)

b)

Question 4 (10 points):

a) What is the Domain Name System? What are Generic Top Level Domains and Second Level Domains.

Answer:

a service that translates computer names into Internet Protocol, or IP, addresses, and vice versa.

b) How does Domain Name System work when we call a domain like google.com?

Answer:

Question 5 (10 points):

In terms of naming graphs, there are basically two different ways to implement an alias:

- hard links

- symbolic links

a) What is an alias is another name for the same entity?

Answer:

b) What are hard links?

Answer:

c) What are symbolic links

Answer:

d) Explain how the symbolic links approach is realized in the following naming graph.

Answer:

Question 6 ( 10 points):

How does Global Positioning System calculate coordinates of a receiver on Earth?

Answer:

Transcribed Image Text:

Knapsack Problem: you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values B=(b1,b2, ..., bn) and associated weights W=(w1, w2, ..., wn). Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, note that you can only select your items once. 1. a) Reformulate this as a 2D bottom-up dynamic programming problem as follows. Define K_{ij} as the highest possible value sum considering items 1 through i and total weight capacity j (i Knapsack Problem: you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values B=(b1,b2, ..., bn) and associated weights W=(w1, w2, ..., wn). Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, note that you can only select your items once. 1. a) Reformulate this as a 2D bottom-up dynamic programming problem as follows. Define K_{ij} as the highest possible value sum considering items 1 through i and total weight capacity j (i