Question 14116 – NIC-NIELIT STA 2020
November 30, 2023
NTA UGC NET JUNE-2023 Paper-2
November 30, 2023
Question 14116 – NIC-NIELIT STA 2020
November 30, 2023
NTA UGC NET JUNE-2023 Paper-2
November 30, 2023

Question 14117 – NIC-NIELIT STA 2020

Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?

Correct Answer: C

Question 50 Explanation: 
DFS is the most efficient algorithm to find the cycle.
BFS, Prims and Kruskal’s also find the cycle but DFS will give better results.
Both BFS and DFS will give answer in O(V+E) time.
A
Prim’s Minimum Spanning Tree
B
Breadth First Search
C
Depth First Search
D
Kruskal’s Minimum Spanning Tree Algorithm
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!