28/12/2017 Social Networks - - Unit 5 - Week 1 - Introduction
X
Courses » Social Networks
Announcements Course Forum Progress Mentor Unit 5 - Week 1 - Introduction
Course outline Week1- Assignment 1
Course Trailer .
FAQ
1) Which of the following is not a Python built-in data structure? 1 point Things to Note Tuple Accessing the Portal Dictionary Class Week 1 - Introduction List
Accepted Answers: Lecture 01 - Introduction (9 min) Class
2) What is the output of the following program : 1 point
Lecture 02 - Answer to the puzzle (6 min)
Indentation Error
120
Runtime Error 20
Lecture 03 - Accepted Answers: Introduction to Indentation Error Python-1 (21 min) 3) What is the output of the following expression : 1 point
125 5 25 1
Lecture 04 - Introduction to Python-2 (28 min) Accepted Answers: 5
4) What is the output of the following code snippet : 1 point
Lecture 05 - Introduction to https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=6&assessment=31 1/5 28/12/2017 Social Networks - - Unit 5 - Week 1 - Introduction Networkx-1 (10 min)
Lecture 06 - Introduction to 0 1 2 0 Networkx-2 (45 min) 0 1 2 Error
None of the above
Accepted Answers: None of the above Lecture 07 - Social 5) To get all the values from the dictionary, which of the following functions may be used? 1 point Networks: The Challenge (4 min) value() getvalues() values()
None of the above
Accepted Answers: Lecture 08 - Google values() Page Rank (2 min) 6) What is the output of the following: 0 points
Error 1 2 3 4 5 x x x x x Lecture 09 - None of the above Searching in a Network (2 min)
Accepted Answers: 1 2 3 4 5
7) What is the output of the following: 1 point
Lecture 10 - Link Prediction (2 min) True False Error
None of the above
Accepted Answers: Lecture 11 - The True Contagions (2 min) 8) What is the output of the following: 1 point
[1, 2, 3, 4, 5, 5, 4, 3, 2, 1]
[6, 6, 6, 6, 6] Lecture 12 - 30 Importance of [1, 2, 3, 4, 5] Acquaintances (1 min) https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=6&assessment=31 2/5 28/12/2017 Social Networks - - Unit 5 - Week 1 - Introduction Accepted Answers: [1, 2, 3, 4, 5, 5, 4, 3, 2, 1]
9) What is the output of the following code snippet: 1 point
Lecture 13 - Marketing on Social [3108 , 1983, `yoyo', `sud'] Networks (2 min) [3108 , 1983]
[‘annie’, 3108 , 1983] [3108 , 1983, `yoyo']
Accepted Answers: [3108 , 1983]
10)Suppose list1 is [1, 7, 8, 20, 15, 2, 10, 1, 23], what is list1 after list1.pop(1)? 1 point Quiz : Week1- Assignment 1 [7, 8, 20, 15, 2, 10, 23] [1, 8, 20, 15, 2, 10, 1, 23]
[7, 8, 20, 15, 2, 10, 1, 23] None of the above.
Accepted Answers: [1, 8, 20, 15, 2, 10, 1, 23]
Solutions to Week1- 11)What is returned by time.time()? (Choose the most specific option) 1 point Assignment1 The current time
The current time in seconds The current time in seconds since midnight
The current time in seconds since midnight, January 1, 1970 GMT (the Unix time)
Accepted Answers: Feedback for week 1 The current time in seconds since midnight, January 1, 1970 GMT (the Unix time)
12)Which of the following is passed as a parameter to G.add_nodes_from()? 0 points
A Dictionary of nodes
A list of nodes Week 2 - Handling A set of nodes Real-world Network Datasets A Tuple of Nodes
Week 3- Strength of Weak Ties Accepted Answers: Week4 - - Strong and A list of nodes Weak Relationships (Continued) & 13)What is the syntax to access an attribute `weight' of an edge (1,2) in a graph G? 1 point Homophily G(1,2)['weight'] Week 5 - Homophily G[1][2]('weight') Continued and +Ve / - G[1][2]['weight'] Ve Relationships G[1,2]['weight']
Week 6- Link Analysis
Accepted Answers: Week 7 - Cascading Behaviour in G[1][2]['weight'] Networks 14)To access a dictionary having the degrees of each node in a graph 'G', we can use: 1 point
Week 8 : Link nx.degree(G) Analysis (Continued) G.degree() Week -9 : Power Both nx.degree(G) and G.degree() work Laws and Rich-Get- nx.degrees(G) Richer Phenomena
Week 10 - Power law (contd..) and https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=6&assessment=31 3/5 28/12/2017 Social Networks - - Unit 5 - Week 1 - Introduction Epidemics Accepted Answers: Both nx.degree(G) and G.degree() work Week 11- Small World Phenomenon 15)In case of a weighted graph, what is returned by G.edges()? 1 point
Week 12- Pseudocore A List (How to go viral on A dictionary web?) A set None of the above
Accepted Answers: A List
16)In the context of freeze(G) function of Networkx, choose the True statement out of 1t hpeo inftoll
It prevents changing sizes of nodes of the graph. It prevents addition or removal of nodes and edges from the graph G. It prevents changing colors of nodes and edges. Node and edge attributes can not be modified after the graph has been 'frozen'.
Accepted Answers: It prevents addition or removal of nodes and edges from the graph G.
17)Which out of the following is not a layout provided by Networkx? 1 point
Circular_Layout Spectral_Layout Concave_Layout Spring_Layout
Accepted Answers: Concave_Layout
18)Font size of the labels of nodes can be changed using which of the following functi1o npso?int
nx.draw_networkx_labels() G.draw_networkx_labels() nx.change_networkx _labels() G.change_networkx _labels()
Accepted Answers: nx.draw_networkx_labels()
Previous Page End
© 2014 NPTEL -
Privacy & Terms -
Honor Code https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=6&assessment=31 4/5 28/12/2017 Social Networks - - Unit 5 - Week 1 - Introduction
-
FAQs
-
A project of In association with Funded by
Powered by
https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=6&assessment=31 5/5