Social Networks Week 1 Nptel Assignment Answers

Are you looking for Nptel Social Networks Week 1 Assignment Answers ? You are here at right place for Week 1 assignment answers

Social Networks Nptel Week 1 Assignment Answer and solution Swayam Platform image — Nptel Social Networks Week 1 Assignment Answers

Course Link: Click Here

1. Which Python code correctly computes the sum of even numbers in the list L = [3, 5, 8, 2, 6]?

(a) sum(x for x in L if x % 2 == 0)
(b) sum(x for x in L if x % 2 != 0)
(c) sum(x for x in L if x > 2)
(d) sum(L)

View Answer

2. You are given a dictionary d = {'A': 10, 'B': 20, 'C': 30}. Which Python code snippet correctly adds a new key 'D' with value 40 to the dictionary?

(a) d['D'] = 40
(b) d.add('D', 40)
(c) d.update('D', 40)
(d) d.update({'D': 40})

View Answer

3. Given the following Python code snippet, what will be the output?

import matplotlib.pyplot as plt  
x = [1, 2, 3, 4]  
y = [1, 4, 9, 16]  
plt.scatter(x, y)  
plt.show()

(a) A bar chart displaying the values in x and y.
(b) A line graph connecting the points (1, 1), (2, 4), (3, 9), (4, 16).
(c) A scatter plot with points (1, 1), (2, 4), (3, 9), (4, 16).
(d) A histogram displaying the values of x and y.

View Answer

4. Using the NetworkX library, how would you create an undirected graph with three nodes (A, B, C) and two edges (A-B and B-C)?

(a)

G = nx.Graph()  
G.add_edges_from([('A', 'B'), ('B', 'C')])

(b)

G = nx.DiGraph()  
G.add_edges_from([('A', 'B'), ('B', 'C')])

(c)

G = nx.Graph()  
G.add_edges([('A', 'B'), ('B', 'C')])

(d)

G = nx.Graph()  
G.add_edges_from([('A', 'B'), ('B', 'C')], directed=True)

View Answer

5. In the PageRank algorithm, what is the primary assumption regarding the link structure of the web?

(a) Pages that are linked to more often are likely more important.
(b) Pages that are less frequently linked are likely more important.
(c) Pages with more content are likely more important.
(d) Pages without links are considered equally important as those with links.

View Answer

6. In a social network, you are tasked with finding the shortest path between two individuals, A and B. Which of the following algorithms would be suitable?

(a) Dijkstra’s Algorithm
(b) A* Search Algorithm
(c) Breadth-First Search (BFS)
(d) Depth-First Search (DFS)

Nptel Social Networks Week 1 Assignment Answers (Jan-Apr 2023)

Course Link: Click Here

Q1) What would be the output for the following code?
scores=[78,77,45]
scores.append(90)
scores.append(98)
scores.reverse()
print(scores)
a. [98, 90, 78, 77, 45]
b. [78, 77, 45, 90, 98]
c. [98, 90, 45, 77, 78]
d. [78, 77, 45, 98, 90]

Answer: c. [98, 90, 45, 77, 78]

Q2) Given the following code, Which of the following is not a possible output?

import random

def calc():
    x=random.random()
    y=random.random()
    z=random.random()
    return( x+y+z )
print(calc())

a. 1.6115945523495627
b. 0.202709723169674
c. 2.3142203461882844
d. 3.9133426822720435

See also Social Networks | Week 8

Answer: d. 3.9133426822720435

Q3) Which of the following statement creates the given dictionary, d:{1:1,2:4,3:9,4:16}
a. d={x:x∗∗2 for x in range(1,5)}
b. d={x:x∗∗2 for x in range(5)}
c. d={x:x∗∗2 for x in range(0,5)}
d. d={x:x∗∗2 for x in range(1,6)}

Answer: a. d={x:x∗∗2 for x in range(1,5)}

These are Nptel Social Networks Week 1 Assignment Answers

Q4) Identify the graph output for the following segment:

import networkx as nx
import matplotlib.pyplot as plt
G=nx.Graph()
G.add_nodes_from([1,2,3,4,5])
G.add_edges_from([(1,2),(2,3),(2,5),(1,6),(3,4)])
nx.draw(G,with_labels=True)
plt.show()

Answer: a

These are Nptel Social Networks Week 1 Assignment Answers

Q5) Given the following code, what is the number of edges in the graph created?
G=nx.Graph()
G.add_nodes_from([i for i in range(10)])

def create_graph(n):
    while(len(G.edges())< n):
        u=random.choice(list(G.nodes()))
        v=random.choice(list(G.nodes()))
        if u!=v and G.has_edge(u,v)==0:
        G.add_edge(u,v)

a. 9
b. 10
c. n
d. n−1

Answer: c. n

Q6) Which of the statements is True for the graph created from the statement: nx.gnp_random_graph(10,0.5)?
a. Graph has 10 nodes with half of the nodes connected
b. Graph has 10 nodes with each edge to be put with probability 0.5
c. Connected graph with 10 nodes
d. Graph has 5 nodes with half of the nodes connected

Answer: b. Graph has 10 nodes with each edge to be put with probability 0.5

These are Nptel Social Networks Week 1 Assignment Answers

Q7) What is the maximum number of graphs that can be created from 10 nodes?
a. 2^{(10 2)}
b. 2^{(2 10)}
c. 2¹⁰
d. 2^{10 2}

Answer: a. 2^{(10 2)}

Q8) Given that we have n nodes in a network, what is the approximate number of steps to search a node?
a. nlogn
b. logn
c. nⁿ
d. 2^logn

Answer: b. logn

These are Nptel Social Networks Week 1 Assignment Answers

Q9) Identify the layout for the graph given in the following figure.

a. spectral
b. spring
c. circular
d. random

Answer: c. circular

Q10) Friend suggestion on Facebook is one of the applications of
a. Page ranking
b. Link prediction
c. Small work phenomenon
d. Cascading

Answer: b. Link prediction