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

Questions 6–10

1. 6application · medium

   A social media analyst is studying a directed network of Twitter followers. They want to identify users who are most influential in terms of being followed by many other influential users, rather than just having many followers. Which centrality measure should they use?

   • AEigenvector centrality
   • BDegree centrality
   • CCloseness centrality
   • DBetweenness centrality
   Reveal Solution Discussion Select an answer first
2. 7application · easy

   A graph has 6 nodes and the following edges: (1,2), (2,3), (3,1), (4,5), (5,6). What is the number of connected components in this graph?

   • A6
   • B1
   • C2
   • D3
   Reveal Solution Discussion Select an answer first
4. 8foundation · easy

   What does the density of an undirected graph measure?

   • AThe total number of paths between all pairs of nodes.
   • BThe average number of edges per node.
   • CThe number of connected components in the graph.
   • DThe proportion of possible edges that are actually present in the graph.
   Reveal Solution Discussion Select an answer first
5. 9foundation · easy

   What is the primary advantage of using an adjacency list over an adjacency matrix for representing a sparse graph?

   • AAdjacency lists are more memory-efficient for sparse graphs because they only store existing edges.
   • BAdjacency lists allow constant-time checks for whether a specific edge exists.
   • CAdjacency lists are the only representation that can handle directed graphs.
   • DAdjacency lists automatically sort neighbors by weight.
   Reveal Solution Discussion Select an answer first
6. 10foundation · easy

   Which centrality measure identifies nodes that frequently lie on the shortest paths between other pairs of nodes?

   • ADegree centrality
   • BEigenvector centrality
   • CBetweenness centrality
   • DCloseness centrality
   Reveal Solution Discussion Select an answer first