Social Networks | NPTEL 2022 | Week 2 Assignment Solutions

This set of MCQ(multiple choice questions) focuses on the Social Networks NPTEL Week 2 Assignment Solutions.

Course layout (Answers Link)

Answers COMING SOON! Kindly Wait!

NOTE: You can check your answer immediately by clicking show answer button. This set of “Social Networks NPTEL 2022 Week 2 Assignment Solution” contains 10 questions.

Now, start attempting the quiz.

Social Networks NPTEL 2022 Week 2 Assignment Solutions

Q1. For any vertex v in an undirected (without loop, multiple edges) , the clustering coefficient of v ranges from:

a) -1 to +1
b) 0 to 1
c) −∞ to +∞
d) 0 to +∞

Show Answer

Q2. Which of the following is not a network data set format?

a) Comma Separated Values
b) GEphi XML Format
c) Pajek NET
d) GraphML

Show Answer

Q3. Diameter of the complete graph on n vertices is

a) n-1
b) n-2
c) 0
d) 1

Show Answer

Q4. Assuming Synonymy network of English language is undirected, we can traverse from the word ’FRIEND’ to ’ENEMY’ necessarily because:

a) the underlying network is connected.
b) there must be an edge between them.
c) the words have same number of letters.
d) the Synonymy network is complete.

Show Answer

Q5. Let the given four real-world networks be
A. Friendship network  B. Road network  C. E-mail network  D. Citation network

Choose the correct option.

a) Only (A) is undirected
b) Only (C) and (D) are directed.
c) Only (C) is directed.
d) All of them are undirected.

Show Answer

Social Networks NPTEL Week 2 Assignment Solutions

Q6. For reading a network file where the data is in the following form, which function should be used?
node1 node2
node2 node3
node2 node5…….. 
where node1, node2, node3, node5 etc are ids of the nodes and node1 node2 indicates that there is an undirected edge between node1 and node2 and so on

a) nx.read_nodelist()
b) nx.read_edgelist()
c) nx.read_adjmat()
d) Both nx.read_edgelist() and nx.read_adjmat() can be used

Show Answer

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.

a) Yes
b) No

Show Answer

Social Networks NPTEL Week 2 Assignment Solutions

Q8. What is the density of the graph H?

a) 1/2
b) 1/3
c) 1
d) 0

Show Answer

Social Networks NPTEL week 2 Assignment Solutions

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)

a) 3
b) 4
c) 5
d) Insufficient information

Show Answer

Q10. If G is a connected graph with n vertices, what is the minimum number of edges the graph G should have?

a) n
b) n-1
c) n+1
d) n/2

Show Answer

Social Networks NPTEL week 2 Assignment Solutions

<< Prev- Social Networks Week 1 Assignment Solutions

>> Next- Social Networks Week 3 Assignment Solutions

---

NPTEL answers: Problem solving through programming in C

Programming in Java NPTEL week 1 quiz answers

The above question set contains all the correct answers. But in any case, you find any typographical, grammatical or any other error in our site then kindly inform us. Don’t forget to provide the appropriate URL along with error description. So that we can easily correct it.

Thanks in advance.

For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.