This set of MCQ(multiple choice questions) focuses on the Social Networks NPTEL Week 12 Assignment Solutions.
Course layout (Answers Link)
Answers COMING SOON! Kindly Wait!
Week 0: Assignment answers
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)
NOTE: You can check your answer immediately by clicking show answer button. This set of “Social Networks NPTEL 2022 Week 12 Assignment Solution” contains 10 questions.
Now, start attempting the quiz.
Social Networks NPTEL 2022 Week 12 Assignment Solutions
Q1. An Internet meme is (Choose the best answer)
a) A social networking website
b) Any Website
c) A computer virus
d) Any kind of digital artefact traversing through the Internet, be it an image, audio, video or a file in some other format.
Answer: d)
Q2. As per the definition, in a core-periphery structure (Choose the TRUE statement):
a) Low status people are linked in densely connected core while the high status people atomize around this core as periphery of the network.
b) Core and the periphery occupy interchangeable positions in the network.
c) The notion of a node being in a core or in a periphery does not depend on the social status or the wealth of a node.
d) High status people are linked in densely connected core while the low status people atomize around this core as periphery of the network.
Answer: d)
Q3. The ith iteration of k-shell decomposition algorithm
a) Removes all the nodes of degree i from the graph.
b) Recursively keeps removing the nodes of degree i from the graph, i.e., keeps removing the degree i nodes from the graph till there are no degree i nodes in the graph.
c) Recursively keeps removing the nodes of degree ≤ i from the graph, i.e., keeps removing the nodes of degree ≤ i from the graph till there are no degree ≤ i nodes in the graph.
d) Recursively keeps removing the nodes of degree ≥ i from the graph, i.e., keeps removing the node of degree ≥ i from the graph till there are no degree ≥ i nodes in the graph.
Answer: c)
Q4. Identify the 1-core, 2-core and 3-core in the Figure 1 (Based on the definition of k-core).
a) 1-core: A,B,C,D,E,F,G,H,I,J,K ; 2-core: A,B,C,D,E,F,G ; 3-core: C,D,E,F
b) 1-core: H,I,J,K ; 2-core: A,B,G ; 3-core: C,D,E,F
c) 1-core: C,D,E,F ; 2-core: A,B,C,D,E,F,G ; 3-core: A,B,C,D,E,F,G,H,I,J,K
d) 1-core: I,J,K,H,A,B,G ; 2-core: Empty ; 3-core: C,D,E,F
Answer: a)
Q5. Pseudo-cores are the nodes
a) which belong to the core of the network (synonymous to core).
b) which belong to the periphery of the network (synonymous to periphery).
c) which do not belong to the innermost core of the network but have equal spreading power (cascade capacity) as the innermost core.
d) which do not belong to the outermost periphery of the network but have equal spreading power (cascade capacity) as the outermost periphery.
Answer: c)
Q6. The nodes of degree 1 in a graph
a) Will always belong to 1-core.
b) Will always belong to 2-core.
c) Can belong to any core.
d) Will always belong to the innermost core of the network.
Answer: a)
Q7. Given the graph as shown in Figure 2. While nodes from this graph will be removed in the first iteration of k-shell decomposition algorithm?
a) A and E
b) A, E, G and C
c) A, E, G, C and F
d) A, G and E
Answer: b)
Q8. The core number of a node in a graph can not be
a) Greater than its degree
b) Lesser than its degree
c) Equal to its degree
d) Can’t say
Answer: a)
Q9. Given that a node in a network is a part of exactly 3 cliques (complete subgraphs), of size 3, size 4 and size 6 respectively. Then the core number of this node can not be
a) greater than 3
b) less than 7
c) less than 6
d) less than 5
Answer: d)
Q10. In a clique of size 5
a) Every node has a coreness of 4
b) Every node has a coreness of 5
c) Every node has a coreness of 6
d) Every node has a coreness of 7
Answer: a)
<< Prev- Social Networks Week 11 Assignment Solutions
DISCLAIMER: Use these answers only for the reference purpose. Quizermania doesn't claim these answers to be 100% correct. So, make sure you submit your assignments on the basis of your knowledge.
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.