## Depth First Search Quiz

Question 1 |

What is the worst case performance, expressed in Big-O notation, of the Depth First Search algorithm?

O(|E|+|V|) | |

O(log(n)) | |

O(n) | |

O(|V||E|) | |

O(n^2) |

Question 1 Explanation:

The worst case performance is dependent on the number of edges and vertices.

Question 2 |

What is the worst case space complexity, expressed in Big-O notation, of the Depth First Search algorithm?

O(|V|^2) | |

O(log(|V|)) | |

O(|V|) | |

O(|E|+|V|) | |

O(|V||E|) |

Question 2 Explanation:

The worst case space complexity is solely dependent on the number of vertices.

There are 2 questions to complete.

List |