Question

odd man out:

* topological sort algorithm
* DFS algorithm
* Binary search algorithm
* BFS algorithm
* prim's algorithm

a) Binary search algorithm
b) BFS algorithm
c) prim's algorithm
d) topological sort algorithm

Answer 1

Answer: Odd one here is (c) prim's algorithm.

Explanation:

(a). Binary search algorithm is used to search tye position of keyword which is present in a sorted array. It compares the value to be found with the middle value of the sorted array.

(b). Breadth-first search(BFS) algorithm is also used to search the particular node in a tree or search the particular point in graph data structure.

(c). Prim's algorithm is the only algorithm used to find the minimum spanning tree which is required in weighted undirected graph.

(d). Topological sort algorithm is also used to search the vertices in the graph using depth-first search.

Answer 2

Answer:

The Prim’s Algorithm is odd one among the given options. Hence the correct answer is C among the given options.

The Prim’s Algorithm is generally used to detect spanning trees i.e. usually MST. On the other hand, the other algorithms i.e. Binary search algorithm, BFS algorithm and topological sort algorithm are search algorithms.