Sorting takes......time.
a) O(n)
b) O(n^2)
c) O(n log n)
d) none
This approach of solving geometric problems by sweeping a line across the plane is called
a) plane sweep
b) brute force
c) sweep
d) NA
This follows from the fact that dominance relation is.....
a) Symmetric
b) Transitive
c) non-Transitive
d) None
If you find yourself in maze the better traversal approach will be?
a) BFS
b) DFS
c) Level order
d) BFS and DFS both are valid
You have an adjacency list for G, what is the time complexity to compute Graph transpose GAT.?
a) (V+E)
b) ? (VE)
c) ? (V)
d) ? (V^2)
In digraph G=(V,E);G has cycle if and only if?
a) The DFS forest has forward edge
b) The DFS forest has back edge
c) The DFS forest has both back and forward edge
d) BFS forest has forward edge
