SNA and Graph Theory DATA-SCIENCE-OPTIMIZE Practice Questions (Page 4)

Questions 16–20

1. 16foundation · easy

   What is the primary goal of community detection in social network analysis?

   • ATo partition the network into groups of nodes that are more densely connected internally than to the rest of the network.
   • BTo reduce the number of edges in the network to simplify analysis.
   • CTo identify the most influential nodes in the network based on their connections.
   • DTo find the shortest path between any two nodes in the network.
   Reveal Solution Discussion Select an answer first
2. 17application · easy

   A data analyst is creating a network visualization to present to stakeholders. The network has two clear communities, but the current visualization does not show them distinctly. What is the best way to highlight the community structure?

   • AUse a circular layout with nodes in alphabetical order.
   • BRemove all edges between communities.
   • CIncrease the thickness of all edges.
   • DColor nodes by community membership.
   Reveal Solution Discussion Select an answer first
4. 18foundation · easy

   Which of the following best describes a weighted graph?

   • AA graph that has more edges than nodes.
   • BA graph where edges are colored to indicate different types of relationships.
   • CA graph where each edge has an associated numerical value, such as cost, distance, or strength of connection.
   • DA graph where nodes are assigned importance scores based on their position.
   Reveal Solution Discussion Select an answer first
5. 19foundation · easy

   In a network visualization, what does the size of a node typically represent?

   • AThe number of communities the node belongs to.
   • BThe density of the entire network.
   • CA node attribute such as degree centrality, so larger nodes indicate more connections or higher importance.
   • DThe age of the node in the network.
   Reveal Solution Discussion Select an answer first
6. 20expert · hard

   A data scientist is analyzing a social network with overlapping communities, such as a person belonging to both a family group and a work group. They need to identify these overlapping memberships. Which community detection approach is most suitable?

   • ALouvain modularity
   • BGirvan-Newman algorithm
   • CClique percolation method
   • DForce-directed visualization
   Reveal Solution Discussion Select an answer first