TAKE iQUIZ

up for the challenge?

Time remaining

  • Minutes

  • :

  • Seconds

Question 1 of 11

1. What is the event loop in the context of asynchronous programming?

 
 
 
 

Question 2 of 11

2. Which of the following is True in context of dynamic linking and static linking:

 
 
 
 

Question 3 of 11

3. What is the vanishing gradient problem in deep learning?

 
 
 
 

Question 4 of 11

4. Which model measures the likelihood p(z | x,m) i.e., probability of observation “z” given sensor pose x and environment representation m

 
 
 
 

Question 5 of 11

5. Which particle is most likely to be dropped while resampling?

 

 
 
 
 

Question 6 of 11

6. The EKF algorithm is good for:

 
 
 
 

Question 7 of 11

7. Which of the algorithm is improved version of Dijkstra’s algorithm?

 
 
 
 

Question 8 of 11

8. In the Pure Pursuit algorithm, which of the following statements about the lookahead distance is true?

 
 
 
 

Question 9 of 11

9. In a lattice-based path planning approach, what is a “lattice”?

 
 
 
 

Question 10 of 11

10. What is the space and time complexity of the below code?

 
 
 
 

Question 11 of 11

11. When dealing with a car moving along its longitudinal axis, which type of filter, such as Kalman, EKF (Extended Kalman Filter), or UKF (Unscented Kalman Filter), would you choose for state estimation? Why?