NPTEL Social Networks Week 1 Assignment Answers 2022

1. If there exist a graph where nodes represents students and edges represents friendship, then for a rumour to be spread across entire class –

a. Every student must know every other student.
b. The graph needs to be connected.
c. The graph need not be connected.
d. Will spread in any case.

Answer:- b

2. If x = random.randrange(5,10), which values can x take?

I) 5
II) 8
III) 4
IV) 10

• a. Only I, II, IV
• b. Only I, II, III
• c. Only II, III
• d. Only I, II

Answer:- b

3. If x = random.randint(3,6), which values can x take?

I) 5
II) 4.3
III) 3
IV) 6

• a. Only I, II
• b. Only I, III
• c. Only I, III, IV
• d. Only I

Answer:- c

4. What will be the output of the following code snippet?

x = [5, 2, 7, 3, 8]
try:
	a = x[5]
	if(a%2 == 0):
		print("It is an even number")
	else:
		print("It is an odd number")
except:
	print("Element does not exist")

a. It is an even number
b. It is an odd number
c. Element does not exist
d. The code won’t run

Answer:- c

5. What will be the output of the following code snippet?

import random
x = []
for i in range(7):
  x.append(random.randint(1,5))
x.sort()
x.append({"one":1, "two":2})
print(len(x))

• a. 9
• b. 8
• c. 7
• d. 10

Answer:- b

6. Maximum number of edges that can be present in a graph with 10 nodes are –

a. 100
b. 45
c. 50
d. 55

Answer:- b

7. For a complete graph Z with 5 nodes if A=z.order()/z.size(), what will be the value of A?

a. 1/4
b. 1/8
c. 1/2
d. 1/16

Answer:- c

8. What will nx.dijktra_path(G,u,v) return?

a. Returns shortest path from u to v in a weighted graph
b. Returns shortest path length
c. Returns all possible paths from u to v
d. Returns no. of possible paths from u to v

Answer:- a

9. What will nx.gnp_random_graph(20,0.5) return?

a. Returns graph with 20 nodes with half of the nodes connected.
b. Returns graph with 20 nodes with each edge to be put with probability 0.5
c. Returns a connected graph with 10 nodes.
d. Returns a graph with 10 nodes with each edge to be put with probability 0.5

Answer:- b

10. Maximum number of graphs possible from 50 nodes are –

Answer:- b