Engineering

Design and Analysis of Algorithms MCQs: 418 Questions & Answers in Engineering

418 Design and Analysis of Algorithms MCQs in Engineering with answers & explanations. Page 11. Practice objective questions for competitive exams, interview… Use the answer toggle below to show or hide all solutions, tap an option to check one question, or open a question for its own page.

Page 11 of 21

Show answers

Answers hidden — tap an option or use “View Answer” on each question.

201

Design and Analysis of Algorithms MCQs: 418 Questions & Answers in Engineering

Which of the following is false in the case of a spanning tree of a graph G?

Every graph has only one minimum spanning tree.

Consider a complete graph G with 4 vertices. The graph G has spanning trees.

The travelling salesman problem can be solved using

Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?

Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?

If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

Which of the following is not the algorithm to find the minimum spanning tree of the given graph?

Which of the following is false?

Kruskal’s algorithm is used to

Kruskal’s algorithm is a

What is the time complexity of Kruskal’s algorithm?

Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first?

Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?

Which of the following is false about the Kruskal’s algorithm?

Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.

Which of the following is true?

Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.

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

Prim’s algorithm is a

Study tips for Design and Analysis of Algorithms