MathJax


Saturday, September 17, 2022

2022-159

Given the following oriented graph and applying two BFSs, one starting from node A (BFS-A), and the other starting at D (BFS-D), which of the following statements are true?


I.   BFS-A visits node D.
II.  The number of visited nodes in BFS-A is 5
III. BFS-D gets to visit all nodes in the graph.
IV. Deleting the red links reduces the number of visited nodes in BFS-D.

 

    A. Only II

    B. II and IV

    C. II, III and IV

    D. III and IV

    E. None of the above

    Original idea by: Victor Sotelo
at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2024-248

  Consider the following networks:   Which of the following options correctly ranks these networks from  most  robust to  least  robust agai...

  • 2023-228
    A company launched a new gadget C to be produced globally for North American and South American markets. The company uses just-in-time as ...
  • 2021-041
    Considering the following network and its partition in green and pink nodes: The modularity \( M \) of a partition can be computed using...
  • 2022-174
    In the Non-linear preferential attachment, the preferential attachment probability becomes \( \Pi(k) \sim k^{\alpha} \). For a starting netw...