Are you looking for the Answers to NPTEL Social Networks Assignment 2? This article will help you with the answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Social Networks Assignment 2“
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 2
| Assignment No. | Answers |
|---|---|
| Social Networks Assignment 1 | Click Here |
| Social Networks Assignment 2 | Click Here |
| Social Networks Assignment 3 | Click Here |
| Social Networks Assignment 4 | Click Here |
NPTEL Social Networks Assignment 2 Answers:-
Q1. For any vertex v in an undirected (without loop, multiple edges), the clustering coefficient of v ranges from:
Answer:- b
Q2. Which of the following is not a network data set format?
Answer:- b
Q3. Diameter of the complete graph on n vertices is
Answer:- d
Q4. Assuming Synonymy network of English language is undirected, we can traverse from the word ’FRIEND’ to ’ENEMY’ necessarily because:
Answer:- a
???? Next Week Answers: Assignment 02 ????
Q5. Let the given four real-world networks be
A. Friendship network B. Road network C. E-mail network D. Citation network
Answer:- b
Q6. For reading a network file where the data is in the following form, which function should be used?
Answer:- b
Q7. State yes or no. Degree distribution of most real-world networks follows power law, which means there are very few nodes with very less degrees and there are a lot of nodes with very high degrees.
Answer:- a
Note:- We are going to post answers for all weeks you can join us on telegram for regular updates and if there are any changes in answers then will update on our telegram channel only.
Q8. What is the density of the graph H?
Answer:- b
Q9. Given that the clustering coefficient of a vertex v is 0.3, and the number of edges between the neighbors of v is 3. What is the degree of the vertex v? (Graph considered is undirected, without loops and multiple edges)
Answer:- c
Q10. If G is a connected graph with n vertices, what is the minimum number of edges the graph G should have?
Answer:- b
For other courses answers:- Visit
For Internship and job updates:- Visit
Disclaimer: We do not claim 100% surety of answers, these answers are based on our sole knowledge, and by posting these answers we are just trying to help students, so we urge do your assignment on your own.
if you have any suggestions then comment below or contact us at [email protected]
If you found this article Interesting and helpful, don’t forget to share it with your friends to get this information.
