Time complexity to find if there is an edge between 2 particular vertices is _________?Group of answer choicesO(V)O(E)O(1)O(V+E)

On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?Group of answer choicesIs independent of both the number of edges and verticesDepends on the number of edgesDepends on the number of verticesIt depends on both the number of edges and vertices

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________?Group of answer choicesO(E+V)O(E)O(V*V)O(V)Next

Time Complexity of DFS is? (V – number of vertices, E – number of edges)Group of answer choicesO(V + E)O(E)O(V*E)O(V)

What is the worst time complexity of checking node u and v are directly connected by an edge in a graph G = |V, E| when adjacency list is used

What is the time complexity of searching for an element in a singly linked list?Group of answer choicesO(n)O(1)O(n log n)O(log n)