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

Questions 11–15

1. 11application · medium

   A network analyst has an undirected graph with 10 nodes and 15 edges. They need to compute the graph density to compare it with other networks of different sizes. What is the density of this graph?

   • A0.33
   • B0.30
   • C0.15
   • D0.67
   Reveal Solution Discussion Select an answer first
2. 12foundation · easy

   Which of the following is a common approach used in community detection?

   • ACalculating the degree centrality of each node and sorting them in descending order.
   • BFinding the minimum spanning tree of the network.
   • COptimizing modularity, which measures the strength of division of a network into modules.
   • DRemoving nodes with the highest betweenness centrality until the network is disconnected.
   Reveal Solution Discussion Select an answer first
4. 13foundation · easy

   In an adjacency matrix for an undirected graph with n nodes, what does the value at position [i][j] represent?

   • AThe weight of the edge from node i to node j, but only if the graph is directed.
   • BThe degree of node i if i equals j.
   • CThe shortest path length between node i and node j.
   • DThe number of edges between node i and node j.
   Reveal Solution Discussion Select an answer first
5. 14application · medium

   A network analyst is visualizing a large social network with thousands of nodes. The current visualization is a cluttered mess with overlapping nodes and edges. What is the most effective first step to improve clarity?

   • AIncrease the size of all nodes and edges.
   • BColor all nodes the same to reduce visual noise.
   • CRemove all edges and show only nodes.
   • DUse a force-directed layout and adjust node size based on degree.
   Reveal Solution Discussion Select an answer first
6. 15application · medium

   A data scientist is analyzing a collaboration network of researchers. They want to identify groups of researchers who work together more frequently than with others. Which approach is most appropriate?

   • ACalculate the betweenness centrality of each edge.
   • BApply a community detection algorithm such as Louvain modularity.
   • CVisualize the network using a force-directed layout.
   • DCompute the degree centrality of each researcher and rank them.
   Reveal Solution Discussion Select an answer first