- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is running time of Dijkstra’s algor...

Q. |
## What is running time of Dijkstra’s algorithm using Binary min- heap method? |

A. | o(v) |

B. | o(vlogv) |

C. | o(e) |

D. | o(elogv) |

Answer» D. o(elogv) | |

Explanation: time required to build a binary min heap is o(v). each decrease key operation takes o(logv) and there are still at most e such operations. hence total running time is o(elogv). |

View all MCQs in:
Design and Analysis of Algorithms

- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- What is the average running time of a quick sort algorithm?
- What is the running time of Chan’s algorithm?
- The running time of Chan’s algorithm is obtained from combining two algorithms.
- What is the running time of Hershberger algorithm?
- What is the running time of Bellmann Ford Algorithm?
- What is the running time of the Floyd Warshall Algorithm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- What is the computational complexity of Binary GCD algorithm where a and b are integers?

Login to Continue

It will take less than 2 minutes

Report MCQ