Social Networks | Week 6

Social Networks Week 6 Assignment 6 Answers

Course Link: Social Networks | Week 6

Q1. Which of the following is the most efficient way of obtaining the big web graph containing billions of nodes?
Breadth First Search
Depth First Search
Linear search
Binary search
Random walk

Q2. What is the problem in link analysis that teleportation solves?
differentiate an important website from all websites
It prevents web crawlers from getting stuck in infinite loops
It helps web crawler to visit all nodes during analysis
none of the above

Q3. Choose the correct option corresponding to the gold coins’ distribution game.
The game might not converge.
The game converges even with people having an equal or unequal number of gold coins.
The game converges only when people have an unequal number of gold coins.
The game converges only when people have an equal number of gold coins.

Q4. 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?
Algorithm 1 ranks the nodes in ascending order of their importance while algorithm 2 ranks the nodes in descending order of importance.
Both the algorithms rank the nodes in descending order of their importance but give different results.
Algorithm 1 ranks the nodes in descending order of their importance while algorithm 2 ranks the nodes in ascending order of importance.
Both the algorithms rank the nodes in descending order of their importance and give same result.

Q5. 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
1 million each
Two nodes collect half of a million gold coins and two nodes remain empty handed
Quarter a million each
Since the experiment is probabilistic, nothing can be said

Q6. Which of the following is not possible in the gold coin distribution game?
Total number of coins circulating in the system decreases
One node ends up collecting all the gold coins
One node ends up getting no gold coin
Total number of coins in the system increases

Q7. Choose the correct statement with respect to the pagerank matrix.
Pagerank matrix is symmetric
Sum of elements in each column is 1.
Pagerank matrix is same as the adjacency matrix of a graph.
Sum of elements in each row is 1.

Q8. A gold coin distribution game is played on the following network. When the game converges,
Yahoo, Amazon and M’soft, each collects one third of the coins
M’soft collects all the coins
Yahoo and M’soft together gets all the coins and Amazon gets none
All the coins are lost

Q9. 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?
A : 0.4,B : 0.3,C : 0.3
A : 0.4,B : 0.4,C : 0.2
A : 0.3,B : 0.3,C : 0.4
A : 0.3,B : 0.4,C : 0.3

Q10. Consider the graph shown in Figure 12. 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.
A: 20, B: 40, C: 30, D: 30
A: 30, B: 40, C: 40, D: 40
A: 30, B: 40, C: 30, D: 30
A: 20, B: 40, C: 40, D: 30