Answer:
BFS uses Queue to find the shortest path. DFS uses Stack to find the shortest path. ... Time Complexity of BFS = O(V+E) where V is vertices and E is edges. Time Complexity of DFS is also O(V+E) where V is vertices and E is edges.
Explanation:
The value of 2 in 270,413 is 10,000x greater than the value of 2 in 419,427.
Step-by-step explanation:
The value of 2 in 270,413 is 200,000.
The value of 2 in 419,427 is 20
Divide the two numbers together to find your answer:
200,000/20 = 10,000
The value of 2 in 270,413 is 10,000x greater than the value of 2 in 419,427.
Please mark it as brainlest answer:).
D
Step by step explanation
Answer:
47.91 sec
Explanation:
it is given that 
at t=0 velocity =0 ( as it is given that it is starting from rest )
we have to find time at which velocity will be 3.3 
we know that 

integrating both side
---------------eqn 1
at t=o it is given that v=0 putting these value in eqn 1 c=0
so 
when v= 3.3 
t=
=47.91 sec