1) Which of the following is not true about Dijkstra's algorithm?

A - It is a single source shortest path algorithm

B - Its running time is O(|E|log|V|)

C - It is a divide and conquer algorithm

2) Which of the following graph representation method is more space efficient?

A - Adjacency list

B - Adjacency matrix

3) Inserting an element into a max-heap takes....

A - O(1) in best case and O(logn) in worst case

B - O(1) in best case and O(n) in worst case

C - O(logn) in best case and O(n) in worst case