- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Worst case is the worst case time comple...

Q. |
## Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used? |

A. | o(log v) |

B. | o(v2) |

C. | o(e2) |

D. | o(v log e) |

Answer» B. o(v2) | |

Explanation: use of adjacency matrix provides the simple implementation of the prim’s algorithm. in prim’s algorithm, we need to search for the edge with a minimum for that vertex. so, worst case time complexity will be o(v2), where v is the number of vertices. |

View all MCQs in:
Design and Analysis of Algorithms

- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the worst case time complexity of a quick sort algorithm?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
- Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
- What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- Matrix A is of order 3*4 and Matrix B is of order 4*5. How many elements will be there in a matrix A*B multiplied recursively.
- If Matrix X is of order A*B and Matrix Y is of order C*D, and B=C then the order of the Matrix X*Y is A*D?

Login to Continue

It will take less than 2 minutes

Report MCQ