# NPTEL Social Networks Assignment 3 Answers 2022

Are you looking for the Answers to NPTEL Social Networks Assignment 3? This article will help you with the answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Social Networks Assignment 3

## What is Social Networks?

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.

## CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the 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 THE 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.

Below you can find the answers for the NPTEL Social Networks Assignment 3

## NPTEL Social Networks Assignment 3 Answers:-

Q1. In social networks, friends and acquaintances respectively lead to:

Q2. The below mentioned principle is referred as:

If two people in a social network have a friend in common, then there is an increased likelihood
that they will become friends themselves at some point in the future.

Q3. Consider the graph below (Figure 1), where each edge is labelled as S (strong tie) or W (weak tie) – except the edge connecting B and C. According to the theory of strong and weak ties, with the strong triadic closure assumption, what would be the label for the edge BC?

Q4. In most of the real-world networks, a local bridge is a

???? Next Week Answers: Assignment 04 ????

Q5. Given that neighbourhood overlap of an edge m

Q6. Let the below given network (Figure 2) be friendship network. Then, the embeddedness of a relationship between v0 and v2 is:

Q7. In Girvan-Newmann algorithm, we keep removing the ______

Q8. What is the neighbourhood overlap of an edge connecting D and B from the below given graph?

Q10. Computing betweenness Centrality of a given node involves computing which of the following?