Hello NPTEL Learners, In this article, you will find **NPTEL Social Networks Assignment 6 Week 6 Answers 2023**. All the Answers are provided below to help the students as a reference don’t straight away look for the solutions, first try to solve the questions by yourself. If you find any difficulty, then look for the solutions.

**NPTEL Social Networks Assignment 6 Answers 2023 Join Group👇 **

**Note:** We are trying to give our best so please share with your friends also.

## NPTEL Social Networks Assignment 6 Answers 2023:

We are updating answers soon Join Group for update: **CLICK HERE**

#### Q.1. Which of the following is valid about characteristics of a web graph?

- Directed and cyclic
- Directed and acyclic
**Directed and cyclic/acyclic**- Undirected and cyclic
- Undirected and acyclic
- Undirected and cyclic/acyclic

#### Q.2. Pick out the most efficient technique to obtain the web graph containing a huge number of nodes.

- Breadth first search
- Depth first search
**Random walk**- Both A and B

#### Q.3. Consider the graph shown in the following Figure. The number written in each circle represents the number of gold coins possessed by the corresponding node(20, 30, 20, 30). Choose the number of gold coins every node has in the next iteration, according to the equal sharing gold ‘coins’ game.

**NPTEL Social Networks Assignment 6 Answers Join Group👇 **

#### Q.4. Identify the type of nodes that can cause a challenge in the Random walk coin distribution technique.

- indegree > outdegree
- outdegree > indegree
**zero outdegree**- high outdegree

#### Q.5.** **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 converges but Algorithm 2 does not
- Algorithm 2 converges but Algorithm 1 does not
**Both algorithms converge**- None of them converges

#### Q.6. In the graph shown in the following figure, assume that the current pagerank values of A, B and C are 0.4, 0.2 and 0.4 respectively. What will be their pagerank values after one iteration?

- A : 0.4,B : 0.4,C : 0.4
- A : 0.2,B : 0.4,C : 0.4
- A : 0.4,B : 0.2,C : 0.4
**A : 0.4,B : 0.4,C : 0.2**

#### Q.7. In a random graph with n nodes, the number of nodes to be traversed in order to to visit all nodes in a random walk as observed in the experiment is approximately

- log n
- n log n
**n2**- 2n

**NPTEL Social Networks Week 6 Answers Join Group👇 **

**CLICK HERE**

#### Q.8. Which of the following is true for Teleportation?

Statement I – Choosing a node uniformly at random in a graph Statement II – Choosing the highest degree node in the graph

#### Q.9. A web graph is a/an

**Directed graph**- Undirected graph
- Complete graph
- Bipartite graph

#### Q.10. If nx represents networkx library then, for a graph G, what does nx.pagerank(G) returns?

- List of web pages that are top 10 priority
- List of page rank values
**Dictionary where keys are nodes and values are Page ranks**- Dictionary where keys are Page ranks and values are nodes

**NPTEL Social Networks Assignment 6 Answers Join Group👇 **

**Disclaimer**: This answer is provided by us only for discussion purpose if any answer will be getting wrong don’t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided by **Chase2learn**. This tutorial is only for Discussion and Learning purpose.

#### About NPTEL Social Networks Course:

The world has become highly interconnected and hence more complex than ever before. We are surrounded by a multitude of networks in our daily life, for example, friendship networks, online social networks, world wide web, road networks etc. All these networks are today available online in the form of graphs which hold a whole lot of hidden information. They encompass surprising secrets which have been time and again revealed with the help of tools like graph theory, sociology, game theory etc. The study of these graphs and revelation of their properties with these tools have been termed as Social Network Analysis.

**Course Outcome:**

- Week 1: Introduction
- Week 2: Handling Real-world Network Datasets
- Week 3: Strength of Weak Ties
- Week 4: Strong and Weak Relationships (Continued) & Homophily
- Week 5: Homophily Continued and +Ve / -Ve Relationships
- Week 6: Link Analysis
- Week 7: Cascading Behaviour in Networks
- Week 8: Link Analysis (Continued)
- Week 9: Power Laws and Rich-Get-Richer Phenomena
- Week 10: Power law (contd..) and Epidemics
- Week 11: Small World Phenomenon
- Week 12: Pseudocore (How to go viral on web)

**CRITERIA TO GET A CERTIFICATE**:

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.

Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

**YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.**

If you have not registered for exam kindly register Through https://examform.nptel.ac.in/

**Join Our Telegram Group:- CLICK HERE**