NPTEL Social Networks Week 12 Assignment Answers 2025
1. In myopic search, how does an agent decide the next step in the search process?
- By looking ahead multiple steps and computing the best path
- By making decisions based only on immediate local information
- By randomly selecting a path at each step
- By following a predefined shortest path algorithm
Answer :- For Answers Click Here
2. How does myopic search compare to optimal search in terms of efficiency?
- Always finds the shortest path
- Can get stuck in local minima and find suboptimal paths
- Runs faster than optimal search in all cases
- Requires more computational resources than optimal search
Answer :-
3. The time complexity of myopic search depends most on:
- Network size and degree distribution
- Number of hubs in the network
- Presence of long-range connections
- Clustering coefficient of the network
Answer :-
4. What makes myopic search faster than exhaustive search in large networks?
- It prunes unnecessary paths
- It visits all nodes efficiently
- It precomputes all shortest paths
- It uses global information to guide the search
Answer :-
5. Which network property is most important in making something go viral?
- High clustering coefficient
- Presence of weak ties
- Number of triangles in the network
- Number of connected components
Answer :- For Answers Click Here
6. In a social network, which type of node is best for maximizing influence?
- A high-degree node (hub)
- A randomly chosen node
- A node with low betweenness centrality
- A node with no outgoing edges
Answer :-
7. What is a pseudocore in a network?
- A node that connects different clusters but is not highly connected
- A highly connected subgraph that resembles a core
- A node that has high betweenness centrality
- A node with low degree but high influence
Answer :-
8. Why are pseudocores important in network diffusion?
- They help in increasing clustering coefficient
- They act as intermediate nodes in information spread
- They prevent overloading of hubs
- They slow down the spread of information
Answer :-
9. What is the main principle behind the cascading model in information spread?
- Information spreads only through strong ties
- Each node adopts an idea only if a certain fraction of its neighbors adopt it
- The spread occurs instantaneously across the network
- The spread is always uniform across all nodes
Answer :-
10. When implementing a cascading model in code, what is the key parameter that determines the spread?
- Degree of nodes
- Adoption threshold for each node
- Total number of nodes in the network
- Diameter of the network
Answer :- For Answers Click Here
