Search⌘ K
AI Features
Home
Courses
Data Structures for Coding Interviews

Graphs: Quiz

Test your undersatnding of the concepts covered in this chapter.

We'll cover the following...
Technical Quiz
1.

What is the time complexity of BFS on a graph with VV vertices and EE edges using an adjacency list?

A.

O(V2)O(V^2)

B.

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

C.

O(Vlog⁡V)O(V \log V)

D.

O(Elog⁡V)O(E \log V)

1 / 5
...