[MO412 - 2s2024 ] Vitor Antônio Pimenta Silva

 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 + ...

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