12. Time complexity

What is the worst case running time of the above pseudo code?

• O(2)
• O(n)
• O(n-2)
• O(n²)

What is the worst case running time of the above pseudo code?

• O(n)
• O(log n)
• O(n log n)
• O(n²)

What is the worst case running time of the above pseudo code?

• O(n)
• O(log n)
• O(n log n)
• O(n²)

What is the worst case running time of the above pseudo code?

• O(n)
• O(n log n)
• O(n²)
• O(n³)

What is the worst case running time of the above pseudo code?

• O(n)
• O(n log n) 
• O(n²)
• O(n³)

The number of elements in the adjacency matrix of a graph having 6 vertices is __________.

• 7
• 14
• 36
• 49

For an adjacency matrix of an undirected graph, time complexity to find if there is an edge between 2 particular vertices is _________.

• O(V)
• O(E)
• O(1)
• O(V+E)

Time Complexity of Topological Sort is?
 (V – number of vertices,         E – number of edges)

• O(V + E) 
• O(V)
• O(E)
• None of the mentioned

Topological sort starts from a node which has __________.

• Maximum in-degree
• Minimum in-degree
• Any number of in-degree  
• None of the mentioned

Topological sort of a directed acyclic graph is ____________.

• Always unique
• Always not unique
• Sometimes unique and sometimes not unique
• None of the mentioned