Social Networks - - Unit 17 - Week 12- Pseudoco... https://onlinecourses.nptel.ac.in/noc18_cs56/uni...

reviewer3@nptel.iitm.ac.in ▼

Courses » Social Networks Announcements Course Ask a Question Progress Mentor FAQ

Unit 17 - Week 12- Pseudocore (How to go viral on

web?)

Course
outline
Assignment 12
The due date for submitting this assignment has passed.
Course Trailer As per our records you have not submitted this Due on 2018-10-24, 23:59 IST.
assignment.
Prerequisite
Assignment 1) An internet meme is (Choose the best answer) 1 point

FAQ A social networking website

Any website
Things to Note
A computer virus
How to access
the portal Any kind of digital artefact traversing through the Internet, be it an image, video or a file in
some other format.
Week 1 -
No, the answer is incorrect.
Introduction
Score: 0

Week 2 - Accepted Answers:

Handling Any kind of digital artefact traversing through the Internet, be it an image, video or a file in some other
Real-world format.
Network
Datasets 2) As per the definition, in a core-periphery structure (Choose the TRUE statement): 1 point

Week 3- Low status people are linked in densely connected core while the high status people atomize
Strength of
around this core as periphery of the network.
Weak Ties
Core and the periphery occupy interchangeable positions in the network.
Week 4 - Strong
and Weak The notion of a node being in a core or in a periphery does not depend on the social status or
Relationships the wealth of a node.
(Continued) &
Homophily High status people are linked in densely connected core while the low status people atomize
around this core as periphery of the network.
Week 5 - No, the answer is incorrect.
Homophily
Score: 0
Continued and
+Ve / -Ve Accepted Answers:
Relationships High status people are linked in densely connected core while the low status people atomize around this
core as periphery of the network.
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -
A project of In association with

Funded by

1 of 4 Thursday 08 November 2018 04:48 PM

Social Networks - - Unit 17 - Week 12- Pseudoco... https://onlinecourses.nptel.ac.in/noc18_cs56/uni...

RecursivelyPowered
keeps removing
by the nodes of degree i from the graph, i.e., keeps removing the
Week 8 : Link
degree i nodes from the graph till there are no degree i nodes in the graph.
Analysis
(Continued)
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.
Week -9 : Power
Laws and
Rich-Get-Richer
Recursively keeps removing the nodes of degree ≥
Phenomena
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.
Week 10 - Power
law (contd..) and No, the answer is incorrect.
Epidemics Score: 0
Accepted Answers:
Week 11- Small
World Recursively keeps removing the nodes of degree ≤ i from the graph, i.e., keeps removing the nodes of
Phenomenon degree ≤ i from the graph till there are no degree ≤ i nodes in the graph.

4) Identify the 1-core, 2-core and 3-core from the given graph (based on the definition of 1 point
Week 12-
Pseudocore k-core)
(How to go viral
on web?)

Lecture 150 :
Programming
illustration-
Small world
networks :
Introduction

Lecture 151 :
Base code

Lecture 152 :
Making
homophily
based edges .

Lecture 153 : 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

Adding weak
ties 1-core: H, I, J, K; 2-core: A, B, G; 3-core: C, D, E, F

Lecture 154 : 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

Plotting change
in diameter 1-core: A, B, C, D, E, F, G, H, I, J, K; 2-core: Empty; 3-core: Empty

Lecture 155 : No, the answer is incorrect.

Programming Score: 0
illustration-
Myopic Search Accepted Answers:
: Introduction 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

Lecture 156 : 5) The nodes of degree 1in a graph 1 point

Myopic Search

Lecture 157 : will always belong to 1-core.

Myopic Search
will always belong to 2-core.
comparision to
optimal search will always belong to 3-core.
Lecture 158 : will always belong to innermost core of the network.
Time Taken by
Myopic Search No, the answer is incorrect.
Lecture 159 :
Score: 0
PseudoCores : Accepted Answers:
Introduction will always belong to 1-core.
Lecture 160 :
6) Which of the following nodes, from the given graph, will be removed in the first iteration of 1 point
How to be Viral
k-shell decomposition algorithm?
Lecture 161 :
Who are the
right key

2 of 4 Thursday 08 November 2018 04:48 PM

Social Networks - - Unit 17 - Week 12- Pseudoco... https://onlinecourses.nptel.ac.in/noc18_cs56/uni...

nodes?

Lecture 162 :
finding the right
key nodes (the
core)

Lecture 163 :
Coding K-Shell
Decomposition

Lecture 164 :
Coding
cascading
Model

Lecture 165 :
Coding the
importance of
core nodes in
cascading

Lecture 166 : A and G

Pseudo core
A, E and G
Quiz :
Assignment 12 A, E, G and C

Week 12 A, E, G, C and F.
Feedback :
Social No, the answer is incorrect.
Networks Score: 0
Accepted Answers:
DOWNLOAD
VIDEOS A, E, G and C

7) The core number of a node in a graph cannot be 1 point

greater than its degree

lesser than its degree

equal to its degree

Can't say

No, the answer is incorrect.

Score: 0
Accepted Answers:
greater than its degree

8) Given that a node v in a network is part of exactly 3 cliques (induced complete subgraph) 1 point
of order 3, 4 and 6. Then the core number of v cannot be

greater than 3

less than 7

less than 6

less than 5

No, the answer is incorrect.

Score: 0
Accepted Answers:
less than 5

Previous Page End

3 of 4 Thursday 08 November 2018 04:48 PM

Social Networks - - Unit 17 - Week 12- Pseudoco... https://onlinecourses.nptel.ac.in/noc18_cs56/uni...

4 of 4 Thursday 08 November 2018 04:48 PM