Social Networks - NPTEL JANUARY 2022

Assignment 2

1. Consider the ingredient network where a node represents an ingredient and an edge exists between two nodes
if there is a dish where both the ingredients are used. Which of the following statements is true for the nodes
of the same community in such a network?

(a) ingredients that are often used together

(b) ingredients that are never used together
(c) ingredients that are rarely used together
(d) none of the above

CORRECT ANSWER: (a)

2. For the Synonymy network, the path from Love to Hatred is because

(a) Both are synonymous

(b) both the words are connected by anonymous words
(c) of degradation of synonymity along the path
(d) mistake in edges connecting them

CORRECT ANSWER: (c)

3. Identify the network that is a Directed graph.

(a) Friendship network

(b) Email network
(c) Road network
(d) Co-authorship network

CORRECT ANSWER: (b)

4. Which of the following statements is True for GML format of networks?
Statement I: Labels and attributes can be added
Statement II: Weights cannot be added

(a) Only I
(b) Only II
(c) Both I and II
(d) Neither I nor II

CORRECT ANSWER: (a)

5. The degree distribution of most real world datasets follows

(a) Law of large numbers

(b) Power law
(c) Universal law of Approximation
(d) Benford’s law

CORRECT ANSWER: (b)

6. Given a complete graph with 99 nodes, what is the average clustering coefficient?

1
 NPTEL - JAN 2023

(a) 0
(b) 1
(c) 0.5
(d) 0.25

CORRECT ANSWER: (b)

Solution: Every node in a complete graph has an edge with every other node. Therefore for every node the
clustering coefficient will be 1.
7. What is the diameter of Graph G?

Figure 1: Graph G

(a) 5
(b) 6
(c) 7
(d) 8

CORRECT ANSWER: (6)

Ref: Lecture 21-35:01
Solution: Diameter of a network is the shortest path between most distant nodes in the network.

8. Calculate the clustering coefficient of vertex ’0’ in the following graph H.

Figure 2: Graph H

(a) 0.1
(b) 0.2
(c) 0.3
(d) 0.4

2
 NPTEL - JAN 2023

CORRECT ANSWER: (c)

Solution:
Clustering coefficient(0) = Number of friendships among friends of node 0/Total possible friendships
= 3/10 = 0.3
Reference: Lecture 21-31:04
9. Given n nodes, what is the minimum number of edges required to make the graph connected?

(a) O(log n)
(b) O(n2 )
(c) O(n3 )
(d) O(n log n)

CORRECT ANSWER: (d)

Ref: Lecture 25-28:58

10. Calculate the density of the following graph.

CORRECT ANSWER: 0.53

Numerical(up to two decimal digits)
Solution:
N umber of edges 8
Density of the graph = = = 0.53 (1)
M aximum possible edges f or the graph 15
Reference: Lecture 21-27:01