Lecture 2

1.Which node lies on the shortest path from BBN to UTAH?

• MIT

• RAND

• SDC

Number the nodes in the shortest path from Stanford to Harvard

• SRI UTAH MIT BBN

• UCLA RAND SDC UTAH MIT

• UCLA RAND BBN

The deletion of which node would result in a graph with two connected components?

The deletion of which node would result in a graph with three connected components?

Consider the graph whose nodes are all the people in the world who are currently alive, and where there is an edge connecting two people if they were born on the same day. Is this graph connected?

• YES

• NO

Consider the graph whose nodes are all the people who were born between the years 1400 and 2013, and where there is an edge connecting people if they were ever alive at the same point in time. Is this graph connected?

• YES

• NO