Network Science Questions

Consider the following statements regarding the BFS (Breadth-First Search) and DFS (Depth-First Search) algorithms in an undirected graph. Identify which of the statements below are false: I. Both BFS and DFS can be utilized to check if a graph is connected. II. DFS can potentially get caught in a cycle, whereas BFS is immune to this issue. III. DFS is guaranteed to find the shortest path between two vertices, if such a path exists. IV. BFS always finds the shortest path (in terms of the number of edges) between any two vertices, if such a path exists. a) I b) II c) II and III d) II and IV e) None of the above Original Idea: Matheus Lindino

      The graph above represents the social network of a group of people in a research lab, illustrating co-authorship among the researchers. Based on this information, which of the following options is the approximate value of the average clustering coefficient:   A) ⟨C⟩ = 0.2 B) ⟨C⟩ = 0.4 C) ⟨C⟩ = 0.6 D) ⟨C⟩ = 0.8 E) None of the above    Original idea by: Matheus Lindino

  Given the curriculum chart for the Computer Engineering course above, which of the options below indicate the topological order for a student to organize which subjects should be taken? Consider alphabetical/numerical order when performing DFS: a) LA -> CEI -> DC1 -> DC2 -> C1 -> C2 -> C3 -> SP -> A1 -> A2 b) LA -> CEI -> DC1 -> DC2 -> A1 -> A2 -> C1 -> C2 -> C3 -> SP c) C1 -> CEI -> C2 -> LA -> A1 -> DC1 -> C3 -> A2 -> DC2 -> SP d) CEI -> C1 -> DC1 -> A1 -> LA -> C2 -> DC2 -> A2 -> C3 -> SP e) None of the above Original idea by: Matheus Lindino