Social Networks Week 1 NPTEL Assignment Answers 2026

Need help with this week’s assignment? Get detailed and trusted solutions for Social Networks Week 1 NPTEL Assignment Answers. Our expert-curated answers help you solve your assignments faster while deepening your conceptual clarity.

✅ Subject: Social Networks
📅 Week: 1
🎯 Session: NPTEL 2025 July-October
🔗 Course Link: Click Here
🔍 Reliability: Verified and expert-reviewed answers
📌 Trusted By: 5000+ Students

For complete and in-depth solutions to all weekly assignments, check out 👉 NPTEL Social Networks Week 1 NPTEL Assignment Answers

🚀 Stay ahead in your NPTEL journey with fresh, updated solutions every week!

NPTEL Social Networks Week 1 Assignment Answers 2026

1. The communication system described is most appropriately represented as:

• A table of contacts
• A graph of users and connection
• A loop-based structure
• A sorted list

Answer : For Answers Click Here

2. The main reason some students never received the notice was that:

• The message was sent too late
• The coordinators did not forward it
• There were no communication paths to them
• The system deleted messages

Answer :

3. Ignoring self-messaging and duplicate connections makes the structure:

• Random
• Directed
• Simple
• Cyclic

Answer :

4. Tracing the spread of the message step by step from the hostel office is best described as:

• Sorting users
• Searching through connections
• Counting messages
• Reversing data

Answer :

5. If every student could directly message every other student, the notice would:

• Still spread slowly
• Reach only coordinators
• Reach everyone immediately
• Fail due to overload

Answer : For Answers Click Here

6. Which Python structure is most suitable for storing hourly data in sequence?

• Set
• Dictionary
• List
• Tuple

Answer :

7. Reversing the list helped the coordinator mainly to:

• Change the values
• Analyze recent activity first
• Increase the data size
• Remove older data

Answer :

8. If three numbers between 0 and 1 are added, which outcome is impossible?

• 0.9
• 1.6
• 2.7
• 3.8

Answer :

9. The random number experiment showed that randomness:

• Has no limits
• Always gives large values
• Produces varying results within bounds
• Removes all patterns

Answer : For Answers Click Here

10. Creating more connections between users mainly helps to:

• Reduce data storage
• Improve message reach
• Decrease user count
• Control randomness

Answer :

11. A system with 500 guards and 499 links where everyone is reachable suggests that:

• The system is inefficient
• The system has the minimum required connections
• The system is overloaded
• The system is disconnected

Answer :

12. Passing alerts from one guard to another step by step represents:

• Searching
• Sorting
• Printing
• Deleting

Answer :

13. Adding extra random links mainly resulted in:

• Faster alerts
• Fewer message paths
• Repeated alerts
• Message loss

Answer :

14. Communication that works equally in both directions means the system is:

• One-way
• Two-way
• Circular
• Isolated

Answer :

15. This case study mainly shows that increasing connections always:

• Improves performance
• Simplifies communication
• Helps only up to a point
• Eliminates confusion

Answer : For Answers Click Here

NPTEL Social Networks Week 1 Assignment Answers 2025

1. Which of the following is the output of the given code segment?

l=[]

l.append (5)

l.append (”AAA”)

l.append ([2,3])

print(l)

• [5, AAA, [2, 3]]
• [5,‘AAA’,[2, 3]]
• [5,‘AAA’,2,3]
• error

Answer :- b

2. Assume you have to roll a dice with six faces. Choose the statement to simulate the same.

• random.randint(1, 6)
• random.randrange(1, 8)
• random.randint(1, 7)
• random.randrange(1,6)

Answer :- a

3. Select the code to create the given dictionary:
{1 : 2, 2 : 4, 3 : 6, 4 : 8, 5 : 10, 6 : 12, 7 : 14, 8 : 16, 9 : 18}

• d={x:x**2 for x in range(1,10)}print(d)
• d={x:x*2 for x in range(1,9)}print(d)
• d={x:x*2 for x in range(1,10)}print(d)
• d={x:x**2 for x in range(1,9)}print(d)

Answer :- c

4. What does the G(n,p) random graph model in Networkx library represent?

• A graph with n nodes and p edges
• A graph with n nodes and p is the probability of an edge between any two nodes
• A graph with n nodes and p-1 edges
• A graph with n nodes and p is the probability of a path of any length between every two nodes

Answer :- b

5. What is the output of the following code snippet?

import networkx
G = networkx.Graph( )
G.add_edges_from ([(2,1), (2,3), (4,2), (2,5)])
G.remove node ( 2 )
print(len(G.edges( )))

• 0
• 1
• 2
• 3

Answer :- a

6.

Which of the following functions is used to find the shortest path length?

• networkx.dijkstra_path_length(G,‘node a’)
• networkx.dijkstra_path_length(‘node a’,‘node b’)
• networkx.dijkstra_path_length(‘node a’,‘node b’,G)
• networkx.dijkstra_path_length(G,‘node a’,‘node b’)

Answer :- d

7. What does the Page Rank algorithm measure?

• The number of friends a person has in the social network
• The person who is more important in the network
• The person who is very frequently posting content on the social network
• The total number of connections in the network

Answer :- b

8. The code inside the ‘try’ block is monitored for any exceptions. The ‘except’ block contains the code to handle the exception, providing an alternative path for the program to continue execution. Find the output for the given code snippet:

x=[5,2,7,3,8]

try :

a=x[3]

if(a%2==0):

print(”It is an even number”)

else:

print(”It is an odd number”)

except:
print(”Element does not exist”)

• Element does not exist
• It is an even number
• It is an odd number
• error

Answer :- c

9. What is the maximum number of graphs possible from 70 nodes?

Answer :- b

10. Which algorithm or concept should be used to suggest connections on LinkedIn?

• Link Prediction
• Page Ranking
• Hits algorithm
• BFS

Answer :- a