## NPTEL Social Networks Week 6 Assignment Answers 2024

1. In the context of a web graph, which of the following statements best describes the significance of directed links between web pages?

- Directed links indicate the physical location of web pages on a server.
- Directed links represent the number of visits each web page receives.
- Directed links show the navigation paths from one web page to another.
- Directed links determine the color and layout of web pages.

Answer :-For Answers Click Here

2. Consider the implementation of Page Rank using Random Walk. Which of the following is TRUE?

Statement I – Random walk points is higher for the nodes with higher number of inlinks

Statement II – Random walk point is decreased by one when we reach a node

- I only
- II only
- Both I and II
- Neither I nor II

Answer :-For Answers Click Here

3. In a game where participants Alex, Sam, and Jamie distribute gold coins equally, it is observed that the game converges. At the convergence state, which of the following statements is most accurate?

- Alex, Sam, and Jamie always end up with an equal number of gold coins.
- Alex, Sam, and Jamie may or may not have an equal number of gold coins.
- The total number of gold coins with Alex, Sam, and Jamie increases as the game converges.
- The game never converges if Alex, Sam, and Jamie distribute the gold coins equally.

Answer :-For Answers Click Here

4. Which type of node could potentially cause an issue in the random walk (drop) gold coins distribution game?

- node with highest indegree
- node with least indegree
- node with highest outdegree
- node with zero outdegree

Answer :-

5. Examine the graph depicted in the following figure. Each circle contains a number representing the amount of gold coins the corresponding node holds. Determine the number of gold coins each node will have after one iteration of the equal sharing gold coins game.

- A: 45, B: 20, C: 25, D: 15, E: 25
- A: 45, B: 20, C: 25, D: 15, E: 5
- A: 45, B: 25, C: 25, D: 15, E: 25
- A: 45, B: 20, C: 25, D: 25, E: 25
- A: 45, B: 20, C: 25, D: 15, E: 20

Answer :-

6. Which of the following best describes the primary concept behind the Google PageRank algorithm?

- The algorithm ranks pages based solely on the relevance of their content to the search query, using keywords and semantic analysis
- The algorithm ranks pages by evaluating the quantity and quality of backlinks, distributing rank scores iteratively based on link structure and transition probabilities
- The algorithm ranks pages by analyzing user engagement metrics such as click-through rates, time spent on page, and bounce rates
- The algorithm ranks pages based on their presence and influence on social media platforms, considering factors like likes, shares, and comments

Answer :-For Answers Click Here

7. What is the relationship between indegree and page rank values for the mentioned citation network?

- Indegree is not correlated with page rank values
- indegree is directly proportional to page rank
- indegree is inversely proportional to page rank values
- None of the above

Answer :-

8. Which of the following correctly depicts teleportation?

- Jumping from the current node to its neighbor’s neighbor.
- Going back to the previous node which was explored.
- Jumping to any random node in the network
- Jumping to the node in the network which has maximum outdegree.

Answer :-

9. What happens if one or more nodes have no outlink while implementing the page rank algorithm?

- Points in every node in the network keeps increasing without bounds
- Points get accumulated in such nodes with no outlinks
- Points get to reach zero in the nodes with zero outlinks
- Points in every node in the network converges in exactly one iteration

Answer :-

10. Identify the correct sequence for implementing the PageRank algorithm using the points distribution method:

I. Assign 100 points to each of the n nodes.

II. Generate rankings based on the accumulated points.

III. Create a directed graph with n nodes.

IV. Distribute points among the nodes according to the graph’s structure and repeat this process until convergence.

- I, II, IV, III
- II, I, IV, III
- III, I, IV, II
- III, II, I, IV

Answer :-For Answers Click Here