MathJax


[MO412] Question 3

Given the following directed graphs, consider the Breadth-First Search (BFS) algorithm is used starting from node A and running until the queue is empty. Choose the alternative that correctly states the order in which the queue is built.

Consider that the neighbors of each node are lexicographically ordered.



    A.        i) A, B, C, D, E, F, G    ii) A, B, D, E, C, F, G

    B.        i) A, B, D, E, C, F, G    ii) A, B, C, D, E, F, G

    C.        i) A, B, C, D, F, E, G    ii) A, B, D, E, C, F, G

    D.        i) A, B, C, D, E, F, G    ii) A, B, D, C, E, F, G

    E. None of the above.


Original idea by: Vitor Antônio Pimenta Silva

Comentários

Postar um comentário

Postagens mais visitadas deste blog

[MO412] Question 1

Imagem
Identify all backward edges forming cycles within the following directed graph: Assign the alternative that contains all backward edges: A. (a→d, e→c) B. (a→b, c→e) C. (d→a, e→c) D. (d→b, e→c) E. None of the above. Original idea by: Vitor Antônio Pimenta Silva
Leia mais

[MO412] Question 4

 Consider a particle moving in a one dimensional space. It's acceleration is proportional to the square of its velocity. Also, at t=0, it has a velocity v(t=0) = 2 [m/s] and at t=1, v(t=1) = 1 [m/s]. Consider that the particle starts at x=0. A first-order separable ordinary differential equation can be generalized as: dx dt = g ( t ) ⁢ h ( x ) . With that in mind, choose the alternative that correctly describes the particle's position in relation to time. In other words, x ( t ) ,   t ≥ 0 . A. x ( t ) = ln ( 1 + t ) 2 B. x ( t ) = 1 + ln ( 2 +
Leia mais

[MO412] Question 2

Imagem
Assume you only know two graph traversal algorithms: Depth-First Search (DFS) and Breadth-First Search (BFS). Given the following directed graphs, choose the alternative that correctly states, in order , which algorithm reaches NODE H first (least amount of movements). Every traversal must start from NODE A. Also, the list of nodes is ordered alphabetically. a. BFS, BFS, DFS b. BFS, BFS, DFS c. DFS, DFS, BFS d. DFS, DFS, DFS e. None of the above. Original idea by: Vitor Antônio Pimenta Silva
Leia mais