Does anyone know how to solve these?

Practice Questions.

Acquaintance data List of people: Anne (A), David (D), Heather (H), Isabelle (I), John (J), Kara (K), Matt (M), Natalia (N), Peter (P), and Rob (R).

Context : Matt knows David

Peter knows Isabelle

Anne knows Heather

Peter knows Natalia

John knows Natalia

Matt knows Isabelle

Peter knows Rob

Kara knows David

Matt knows Heather

Rob knows Isabelle

QUESTIONS:

Question 1: Build the acquaintance network using: - the first letter of each person name (e.g. A for Anne);

- the specific aforementioned context (i.e. 1, 2, 3, or 4) that has been assigned to you (see document entitled:

- it is assumed that if A knows B then B knows A.

Question 2: Give the degree for each node of the network.

Question 3: Build the degree distribution of your acquaintance network.

Question 4: Give the length of the shortest path between: - Anne and Peter - Heather and John - Matt and Natalia - David and Isabelle - Kara and Rob

REMINDER: Length of the shortest path

The length of the shortest path in a network from one node to another node is the minimal number of links you need to connect these two nodes.

For example, lets assume:

A knows B A knowns C A knows D C knows E

Then:

The length of the shortest path between A and E is 2

(i.e. path ACE). The length of the shortest path between B and E is 3 (BACE).