SOCIAL NETWORKS NPTEL - JULY 2023
6 Week 6
1. Which of the following is the most efficient way of obtaining the big web graph containing billions of nodes?
(a) Breadth First Search
(b) Depth First Search
(c) Linear search
(d) Binary search
(e) Random walk
Answer: (e)
2. What is the problem in link analysis that teleportation solves?
(a) differentiate an important website from all websites
(b) It prevents web crawlers from getting stuck in infinite loops
(c) It helps web crawler to visit all nodes during analysis
(d) none of the above
Answer: (c)
3. Choose the correct option corresponding to the gold coins’ distribution game.
(a) The game might not converge.
(b) The game converges even with people having an equal or unequal number of gold coins.
(c) The game converges only when people have an unequal number of gold coins.
(d) The game converges only when people have an equal number of gold coins.
Answer: (b)
Solution:
When people distribute gold coins equally, the game converges. At the convergence state, everybody might/might
not have the same number of gold coins.
4. Consider algorithm 1 to be equal sharing coin distribution game and algorithm 2 to be random dropping coin
distribution game. Which of the following is true?
(a) Algorithm 1 ranks the nodes in ascending order of their importance while algorithm 2 ranks the nodes in
descending order of importance.
(b) Both the algorithms rank the nodes in descending order of their importance but give different results.
(c) Algorithm 1 ranks the nodes in descending order of their importance while algorithm 2 ranks the nodes
in ascending order of importance.
(d) Both the algorithms rank the nodes in descending order of their importance and give same result.
Answer: (d)
Solution: It has been stated in the lecture video that both of these algorithms are equivalent and that both of
them finally converge. Moreover, they converge to a state where nodes are arranged in the descending order of
their importance.
5. Given a complete network having 4 nodes. We take a random walk of length 1 million on this network. Every
time we arrive on a node, we gift it a gold coin. The approximate number of gold coins each node collects at
the end of this experiment is
(a) 1 million each
(b) Two nodes collect half of a million gold coins and two nodes remain empty handed
(c) Quarter a million each
(d) Since the experiment is probabilistic, nothing can be said
16
SOCIAL NETWORKS NPTEL - JULY 2023
Answer: (c)
Solution: The network is complete so every node is equally important. So, we roughly give an equal number
of coins to all the nodes. So its 1/4th of a million each
6. Which of the following is not possible in the gold coin distribution game?
(a) Total number of coins circulating in the system decreases
(b) One node ends up collecting all the gold coins
(c) One node ends up getting no gold coin
(d) Total number of coins in the system increases
Answer: (d)
7. Choose the correct statement with respect to the pagerank matrix.
(a) Pagerank matrix is symmetric
(b) Sum of elements in each column is 1.
(c) Pagerank matrix is same as the adjacency matrix of a graph.
(d) Sum of elements in each row is 1.
Answer: (b)
8. A gold coin distribution game is played on the following network. When the game converges,
Figure 11: Gold Coin Distribution Game
(a) Yahoo, Amazon and M’soft, each collects one third of the coins
(b) M’soft collects all the coins
(c) Yahoo and M’soft together gets all the coins and Amazon gets none
(d) All the coins are lost
Answer: (b)
Solution: M’soft redistributes all coins to itself. Hence, it eventually ends up having all the coins in the system.
9. In the graph G shown in following figure, assume that the current pagerank values of A, B and C are 0.3, 0.3
and 0.4 respectively. What will be their pagerank values after one iteration?
Figure 12: Graph G
(a) A : 0.4,B : 0.3,C : 0.3
(b) A : 0.4,B : 0.4,C : 0.2
(c) A : 0.3,B : 0.3,C : 0.4
(d) A : 0.3,B : 0.4,C : 0.3
17
SOCIAL NETWORKS NPTEL - JULY 2023
Answer: (a) Ref: Lecture 77-4:00 Solution: A gets the point of C, B gets the point of A and C gets the points
of B.
10. Consider the graph shown in Figure 13. The number written in each circle represents the number of gold coins
possessed by the corresponding node. Choose the number of gold coins every node has in the next iteration,
according to the equal sharing gold coins’ game.
Figure 13: Graph G
(a) A: 20, B: 40, C: 30, D: 30
(b) A: 30, B: 40, C: 40, D: 40
(c) A: 30, B: 40, C: 30, D: 30
(d) A: 20, B: 40, C: 40, D: 30
Answer: (c)
18