social networks nptel assignment answers week 7

Social Networks | NPTEL | Week 7 Assignment Solutions

This set of MCQ(multiple choice questions) focuses on the  Social Networks NPTEL Week 7 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 7 Assignment Solution” contains 10 questions.

Now, start attempting the quiz.

Social Networks NPTEL 2022 Week 7 Assignment Solutions

Q1. Assume that the actions AA and BB yield every player a payoff of aa and bb. Further assume that there are two friends Ram and Shyam; Ram decides to adopt action AA while Shyam decides to adopt action BB. What are the payoffs that they get?

a) Ram- a, Shyam- b b) Ram- a, Shyam- 0 c) Ram- 0, Shyam- b d) Ram- 0, Shyam- 0

Q2. Consider a set of initial adopters of behavior A, with a threshold of q for nodes in the remaining network to adopt behavior AA. Given the following two statements, Statement 1:  If the remaining network contains a cluster of density greater than 1−q, then the set of initial adopters will not cause a complete cascade. Statement 2:  Whenever a set of initial adopters does not cause a complete cascade with threshold q, the remaining network must contain a cluster of density greater than 1−q. Choose the correct option from the following.

a) Both Statement 1 and Statement 2 are true. b) Both Statement 1 and Statement 2 are false. c) Statement 1 is true but Statement 2 is false. d) Statement 2 is true but Statement 1 is false.

Q3. Consider two actions A and B. The payoff associated with the action A is 30 while the payoff associated with action B is 10. In such a case, what is the threshold fraction of neighbors that should have adopted A, in order for a node to adopt the action A?

a) 1/3 b) 1/4 c) 1/5 d) 1/3

Q4. Given a node X having 8 friends/neighbors. 3 of its neighbors have decided to adopt the behavior/action A having a payoff of 11. 5 of its friends have adopted the action B yielding a payoff of 6. What is the payoff X gets from its friends who have adopted B?

a) 30 b) 40 c) 10 d) 6

Q5. In the network shown in Figure 2, what is the density of the cluster comprised by the set of nodes {1, 2, 3, 4}?

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

Social Networks NPTEL Week 7 Assignment Solutions

Q6. Given a network as shown in Figure 3. Assume that initially every node in this network has adopted behavior B. Next, a new behavior A is introduced in the network and the nodes v and w are the initial adopters of this behavior A, i.e., nodes v and w now have adopted behavior A and rest of the nodes have adopted behavior B. The payoff associated with A is a=3 and the payoff associated with B is b=2. After the introduction of this new behavior A in the network, all the nodes will start weighing their options and might change their behavior. This leads to a cascade in the network. After two iterations, which nodes would have adopted the behavior A?

a) v, w, r b) v, w, t, s c) v, w, r, s, t d) v, w, r, s, t, u

Q7. Let v be a node in a graph. Suppose that a pp fraction of v′s neighbors have behavior A, and a (1−p) fraction have behavior B; that is, if v has d neighbors, then pd adopt A and (1−p)d adopt B, as shown in Figure 5. Behavior A has a payoff of a and behavior B has a payoff of b. Then A is a better choice for v if

a) p ≥ a / b b) p ≥ b / a c) p ≥ a / a+b d) p ≥ b / a+b

Q8. Given a network as shown in Figure 6. Assume that initially every node in this network has adopted behavior B. Next, a new behavior A is introduced in the network and the nodes 1 and 3 are the initial adopters of this behavior A, i.e., nodes 1 and 3 now has adopted behavior A and rest of the nodes have adopted behavior B. The payoff associated with A is a=3 and the payoff associated with B is b=1. After the introduction of this new behavior A in the network, all the nodes will start weighing their options and might change their behavior. This leads to a cascade in the network. When the cascade ends, which all are the nodes who have adopted the behavior A.

a) 1, 3, 2 b) 1, 3, 2, 4 c) 1, 3, 2, 4, 7 d) 1, 3, 2, 4, 5, 6, 7, 8

Social Networks NPTEL week 7 Assignment Solutions

Q9. Consider a group of 10 bachelors, 5 live on the first floor of the apartment and 5 live on the second floor. Suppose that each person in this group has two friends on their own floor, and one friend on the other floor. Now, a new restaurant opens, and five persons all living on the first floor each begin eating there on the first day. This action will eventually be adopted by

a) Nobody in the apartment b) Only the bachelors on the first floor c) Only the bachelors on the second floor d) Can’t say

Q10. Consider the following network with green nodes following the action A and red nodes following the action B at Time t = 1 (Figure 7). The payoff for action A is 6 and for B it is 5. Each one in this network changes his/her action based on his/her friends actions. What will happen after one complete iteration.

a) All nodes adopt action A b) All nodes adopt action B c) Some nodes adopt action A and other nodes adopt action B d) Insufficient data

<< Prev- Social Networks Week 6 Assignment Solutions

>> Next- Social Networks Week 8 Assignment Solutions

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.

Related Posts

Operating system fundamentals | nptel | week 0 assignment 0 solution, nptel operating system fundamentals week 1 assignment solutions, nptel operating system fundamentals week 10 answers, nptel operating system fundamentals week 2 assignment solutions, nptel operating system fundamentals week 3 assignment solutions, nptel operating system fundamentals week 4 assignment solutions, leave a comment cancel reply.

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

• 1st Central Law Reviews: Expert Legal Analysis & Insights

Navigation Menu

Search code, repositories, users, issues, pull requests..., provide feedback.

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly.

To see all available qualifiers, see our documentation .

• Notifications

NPTEL Course "Social Networks" by Dr. S. R. S. Iyengar, IIT Ropar - Notes, Data sets and Programs

gokulkarthik/NPTEL-Social-Networks

Folders and files, repository files navigation, nptel-socialnetworks.

This repository contains the social networks course notes, network data sets and python programs for network analysis. Some of the surprising observations and beautiful discoveries achieved with Social Network Analysis are listed below.

• 6 degrees of separation: You can reach out to any person on this earth within an average of 6 hops. That means, "You know someone who knows someone who knows someone who knows someone who knows someone who knows Justin Beiber (or Angelina Jolie or literally anyone on this planet.)".
• The algorithm behind Google search: How does Google achieve such precise and valid search results? The underlying algorithm is fairly simple and relies totally on the network of web pages.
• How do you get your dream job: Not through your best friends but through your acquaintances to whom you talk relatively less frequently! Sounds counterintuitive.
• Link prediction: Can one predict who is going to be your next Facebook friend, or which product are you going to buy next on Flipkart, or which is the next movie you are going to watch on Netflix? Yes, it is possible.
• Viral Marketing: Want to make your new product sell out quickly? How do you determine the people to whom you should be giving the free samples? Does that even matter?
• Contagion: Not only information but happiness, obesity, altruism, depression all spread from person to person.

PRE-REQUISITES:

The course doesn’t assume any pre-requisites. We expect one has undergone a first course in basic programming.

COURSE INSTRUCTOR

Sudarshan Iyengar has a PhD from the Indian Institute of Science and is currently working as an assistant professor at IIT Ropar and has been teaching this course from the past 4 years.

COURSE LAYOUT

Week 1: Introduction to Graph Theory and Python

Week 2: Analyzing Online Social Network Datasets

Week 3: Power Law and Emergent Properties

Week 4: Strength of Weak Ties

Week 5: Homophily and Social Influence

Week 6: Structural Balance

Week 7: The Structure of the Web

Week 8: Link Analysis and Web Search

Week 9: Link Prediction

Week 10: Information Cascades

Week 11: Diffusion Behavior in Networks

Week 12: The Small World Phenomenon

Certification:

The criteria for certification in this course is different because of the online programming exam component. Please read the following carefully: Final score = Quiz score + Programming Assignment Score + Programming exam score + Proctored exam score Quiz score: 15% weightage with best 8 out of 12 Programming Assignment score: 10% weightage with best 4 out of 6 Online programming exam (unproctored): 10% weightage. Proctored exam (to be attended in person): 65% weightage

To pass the course and get a certificate: Final score >= 40/100 To get an Elite category of certificate: Final score >= 60/100 To get a gold medal stamp in the certificate: Final score >= 90/100

References:

https://onlinecourses.nptel.ac.in/noc18_cs02/preview

Contributors 2

• Jupyter Notebook 99.4%

• Amazon Quiz
• Flipkart Quiz
• Play & Win 50,000 Coins
• Privacy Policy

NPTEL Social Networks ASSIGNMENT ANSWERS 2021

• by QuizXp Team
• August 5, 2021 January 24, 2022

NPTEL Social Networks This course will cover various techniques for test case design, as used for testing of software artifacts including requirements, design and code.

NPTEL Social Networks is a MOOC course offered by IIIT Bangalore on the NPTEL platform. We will discuss algorithms and techniques for test case design based on graphs, logic, the syntax of programming languages, and inputs. Special techniques for testing object-oriented features and web applications will also be discussed. The course is developed by Prof. Meenakshi D’souza is currently an Associate Professor at IIIT-Bangalore. Meenakshi did her Master’s TMs in Mathematics from the University of Madras, Chennai, and her Ph. D. in Theoretical Computer Science from The Institute of Mathematical Sciences, Chennai.

???? ???? Social Networks 2022 Assignment Answers ????????

CRITERIA TO GET A CERTIFICATE

Students have to score Average assignment score = 25% of the average of the best 6 assignments out of the total 8 assignments given in the course. Exam score = 75% of the proctored certification exam score out of 100 Final scores = Average assignment score + Exam score

Students will be eligible for CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If any of the 2 criteria are not met, the student will not get the certificate even if the Final score >= 40/100.

NPTEL Social Networks ASSIGNMENT WEEK 12 ANSWERS:-

Q1. In myopic search, the expected number of steps needed to reach target E[X] when  α

Q2. “When applying the standard k-shell decomposition to uncover the core of several example social networks, the resulting “innermost” structure is most likely to represent the “core” of complex networks.”

Q3. Myopic search constructs an exponentially smaller path i.e. proportional to ___?

Q4. Which of the following statement is True?

Q5. What is the time complexity of core number algorithm?

Q6. “The k-core subgraphs need to be necessarily connected”

Q7. The graph is composed of _ cliques (complete subgraphs) of size that are connected by a node x with a degree of 2.

Q8. Let  nmax  and  mmax  be the number of vertices and number of edges in the degeneracy-core, how can the density of the degeneracy-core be defined?

Q9. “The core number algorithm is an exponential time algorithm”

Q10. If a graph fits in memory, what is the running time complexity of core decomposition algorithm?

NPTEL Social Networks ASSIGNMENT WEEK 11 ANSWERS:-

Q1. In a small world, what is the expected distance between any two random nodes?

Q2. Why is the Milgram’s experiment known as Six degrees of separation experiment?

Answer:- a,c

Q3. Which of the following are false facts about large networks from the Milgram’s experiment?

Q4. “According to Watts-Strogatz small-world network, Introducing a tiny amount of randomness–in the form of long-range weak ties is enough to make the world “small” with short paths between every pair of nodes.”

Q5. What is the main difference between a small world and a random world?

Q6. “In a 2-D Watts-Strogatz model, for an efficient decentralised search, the ideal value of clustering exponent is 2 so that random links follow an inverse-square distribution.”

Q7. The Watt-Strogatz model creates a network of nodes using which of the concept?

Q8. In which of the following model, one end of each edge is rewired to another vertex independently and with probability p to a new vertex chosen randomly.

Q9. The Watts-Strogatz model corresponds to the special case of Kleinberg’s decentralized search model where q = ?

Q10. In decentralized search, the ___________ ties help one to better explore a region and the ____________ties allow one to search far away regions of the network.

NPTEL Social Networks ASSIGNMENT WEEK 10 ANSWERS:-

Q1. How the number of in-links to a given page be distributed?

Q2. Which of the following is true?

All the best for the final exam, for extra preparation, take our membership for better score in exam read more here:- Final Exam Membership

Q3. What is the fraction of web pages having in-degree k?

Q4. Which of the following are examples of scale-free networks?

Answer:- a,b,c,d

Q5. “Curves of the type where the variable on the x-axis represents rank and y-axis represents frequency have no history”

Q6. Which of the following properties differentiate spread of epidemic from spread of idea?

Q7. Which of the following is not an example of percolation?

Q8. An individual node in the branching process model goes through three potential stages during the course of the epidemic. Which one of the following describes a infectious stage?

Q9. Which of the following is true related to SIS model?

Answer:- a,

Q10. “We can combine elements of the SIR and SIS models in a simple way, so that after an infected node recovers, it passes briefly through the R state on its way back to the S state.”

NPTEL Social Networks ASSIGNMENT WEEK 9 ANSWERS:-

Q1. “The degree d v of vertex v is its number of incident edges”

Q2. “The degree sequence __ specify the graph”

Q3. The shape of the Normal Curve is ___________

Q4. Normal Distribution is applied for ___________

Q5. Which of the following is the ingredient in generating power law?

Q6. “New nodes prefer to attach to well-connected nodes over less-well connected nodes”

Q7. Which of the following is true for random network and real-world network?

Answer:- A,B

Q8. Which of the following is true?

Answer:- A,C

Q9. Suppose P(k) denotes the degree distribution of the network in figure 1, what is the value of P(2)+P(3)?

Q10. Which of the following curve is the sure litmus test for detecting power law in a network?

NPTEL Social Networks ASSIGNMENT WEEK 8 ANSWERS:-

Q1. Which of the following statements is/are true?

Answer:- a ,b

Q2. “Hub and Authority are Exclusionary”

Q3. The main page of a site usually has ______ hub and _______ authority scores.

Q4. What will be the page rank of nodes in figure 1?

Q5. If a network of n nodes is strongly connected, how many sets of equilibrium values exist?

Q6. Which of the following is/are a dangling node in figure 2?

Answer:- b,c

Q7. While performing k hub-authority updates in Principle of Repeated Improvement process, what will happen if we use larger and larger values of k?

Answer:- a,b

Q8. Which of the following properties are related to Markov matrix A?

Answer:- a,b,c

Q9. What happens to the magnitude of the hub and authority values with each update in hub authority computation?

Q10. Which of the following is correct with respect to normalizing weights in hubs and authorities?

NPTEL Social Networks ASSIGNMENT WEEK 7 ANSWERS:-

Q1. What will be the incentive given to nodes if they chose different behaviours?

Q2. State true or false: “Homophily can never serve as a barrier to diffusion”

Q3. What are the factors which influence model diffusion?

Q4. Why do people generally follow a company’s page?

Q5. If d is the number of neighbours and p is fraction of neighbours which adopt node A, when can it be said that A is the better choice?

Q6. Under what condition, do we say that set of initial adopters cause a complete cascade at threshold q?

Q7. Which of the following is an example of social reinforcement?

Q8. State true or false: “An effective viral marketing campaign requires that marketers identify individuals with high social networking potential.”

Q9. Suppose every player in a game is given a payoff a and b based on two actions, A and B. Now, there are two friends Monika and Phoebe; Monika decides to adopt action A while Phoebe decides to adopt action B. What are the payoffs that they get?

Q10. Consider two actions X and Y. The payoff associated with the action X is 40 while the payoff associated with action Y is 10. In such a case, what is the threshold fraction of neighbours that should have adopted X, in order for a node to adopt the action X?

NPTEL Social Networks ASSIGNMENT WEEK 6 ANSWERS:-

Q1. Which of the following is a link analysis task?

Q2. Which of the following statement is true regarding web graph?

Q3. On which scale, Page rank is calculated?

Q4. What is (are) the problem(s) associated with a random surfer while calculating page rank?

Q5. What will the following line of code return? nx.pagerank(g)

Q6. Which of the following is true regarding page rank?

Q7. Let algorithm 1 denotes the equal coin distribution (A1) and algorithm 2 denotes the random coin dropping (A2), which of the following is true?

Q8. What is the function of the following line of code? g = add_edges(g, 0.4)

Q9. How much time does naïve computation of random walk measure usually requires?

Q10. Given a graph g and points on random walk, what does the function X depict? def X(g, points): t = np.array(points) t = np.argsort(-t) return t

NPTEL Social Networks ASSIGNMENT WEEK 5 ANSWERS:-

Q1. Which of the following is correct with respect to Schelling’s model?

Q2. In Schelling’s model, every agent has threshold value of at least ________:

Q3. In the figure 1, according to Schelling’s model, Find the similarity ratio for X in case

Q4. When can a signed graph be considered as balanced?

Q5. Two of my close friends hate each other, what kind of triangular relationship structure is this?

Q6. “A complete graph with 6 vertices is unbalanced if it is having all positive edges having relationship with one random edge being negative.”

Q7. In which of the following conditions, a triangular network is stable?

Q8. Which of the triangles in figure 2 does not show the social belief that ‘friend of a friend is a friend’?

Q9. As the threshold decreases, the chances of agents being happy with their current location _______:

Q10. At more general level, Schelling model be viewed as an example of _________?

NPTEL Social Networks ASSIGNMENT WEEK 4 ANSWERS:-

Q1. Among which of the following, the individual characteristics drive the formation of links?

Q2. Consider the following two statements:    S1: the neighbourhood overlap of two editors in the bipartite affiliation network of editors and articles, consisting only of edges from editors to the articles they’ve edited.    S2: measure of similarity of editors.

Q3. If A = {5, 6, 7} and B = {6, 7, 10, 12}; then calculate the similarity measure between A and B .

Q4 . Which of the following statements are/ is true?

Answer:- A,D

Q5. With regards to fatman evolutionary model, which of the following is correct?

Q6. If get_person_nodes( G ) assigns nodes to each person in a graph, what does the following code implement? pnodes = get_person_nodes( G ) for u in pnodes: for v in pnodes: if ( u != v ): diff = abs(G.nodes[ u ][‘name’] – G.nodes[ v ][‘name’]) p = 1 / (diff + 1000) r = random.uniform(0, 1) if ( r < p ): G.add_edge( u, v )

Q7. Which of the following links are not possible in context to closure?

Q8. When plotted on a graph, the similarity measure curve is ____________ after the time at which two people started a conversation than the time after which they started conversing.

Q9. Which of the following statement is true? S1: if two people participate in a shared focus, this provides them with an opportunity to become friends; S2: if two people are friends, they can influence each other’s choice of foci.

Q10. Considering circles as people and triangles as the corporate boards to which people belong to, what does the figure 1 denote?

NPTEL Social Networks ASSIGNMENT WEEK 3 ANSWERS:-

Q1. Which of the following is/are true in case of providing any opportunity?

Q2. Which of the following is correctly defined by the following statement? “ 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. Which of the following is/are true related to local bridge?

Answer:- b,d

Q4. Which of the following indicate the absence of a structural hole?

Q5. Which of the following statement is correct regarding LinkedIn?

Q6. Which of the following input file formats does graphi allow?

Q7. Out of the following matrices, which of these can be used to depict a graph?

Q8. Which of the following indicate the absence of a structural hole?

Q9. What is the clustering coefficient for node 2?

Q10. Given 6 employees in a company, what are the number of ways that they will know each other?

NPTEL Social Networks ASSIGNMENT WEEK 2 ANSWERS:-

Q1. Road network is a ________ network whereas email network is a _______ network.chable in a graph?

Answer:- A .

Q2. Which of the following is the most commonly used format for datasets?

Q3. Which of the following file formats can be read using read_pajek() function?

Q4. Which of the following function is used to calculate the average of the clustering coefficients?

Q5. Gephi is written in which of the following languages?s defined and met in graphs-based structural coverage criteria?

Q6. If a simple graph G , contains n vertices and m edges, the number of edges in the Graph G’ (Complement of G ) is ___________?

NOTE:- IF THERE IS ANY CHANGE IN ANSWERS OF NPTEL Social Networks assignment answers WILL UPDATE BEFORE the LAST DATE AND NOTIFY ON TELEGRAM OR WHATSAPP. SO KINDLY JOIN US, CLICK ON THE BELOW IMAGE AND JOIN US.

Q7. All trees with  n  vertices consists of n -1 edges.

Q8. If  n  is the number of nodes, what is the minimum number of edges needed to make graph connected?

Q9. What will be the diameter of a complete graph of 15 nodes?

Q10. For a undirected network G made of 3 nodes and 2 edges, what will be the density ρ( G )?

NPTEL Social Networks ASSIGNMENT WEEK 1 ANSWERS:-

Q1. What is the number of edges present in a complete graph having ‘n’ vertices?

Q2. Which of the following functions is used to remove all edges and nodes in a graph in NetworkX?

Q3. What will be the output of the following Python code? t = (1, 2, 4, 3, 8, 9) [t[i] for i in range(0, len(t), 2)]

Q4. In which line there(s) is an error?  G = nx.Graph()  // line 1  G.add_node(1) // line 2  G.add_node(“Hello”) // line 3  G.add_node(2.0) // line 4

Q5. Which of the following graphs are isomorphic to each other?

Q6. What is the value of the sum of minimum in-degree and maximum out-degree of a Directed Acyclic Graph?

Q7. Assuming the value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices ‘u’ and ‘v’ will never change?

Q8. In the given graph which edge should be removed to make it a Bipartite Graph?

Q9. What will be the output of the following Python co de?

Q10. For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u , which of the following is true?

Also check :- Internship oppurtinites

Note:- 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.

Category: NPTEL

Programming in modern c++ | week 12, introduction to internet of things week 12, introduction to industry 4.0 and industrial internet of things | week 12, an introduction to artificial intelligence | week 12, the joy of computing using python | week 12, quantum mechanics 1 | week 12, programming in java | week 12, principles of management | week 12, leadership and team effectiveness | week 12, introduction to machine learning | week 12.

Social Network Analysis

Note: This exam date is subjected to change based on seat availability. You can check final exam date on your hall ticket.

Page Visits

Course layout, books and references.

• Social Network Analysis, Tanmoy Chakraborty, Wiley, 2021
• Network Science, Albert-Lazzlo Barabasi
• Social Network Analysis: Methods and Applications, Stanley Wasserman, Katherine Faus

Instructor bio

Prof. Tanmoy Chakraborty

Course certificate.

DOWNLOAD APP

SWAYAM SUPPORT

Please choose the SWAYAM National Coordinator for support. * :