Which is true statement in the following?

(A) Kruskal algorithm is multiple source technique for finding MST
(B) Kruskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
(C) Both of above
(D) Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best Tree edge) when the graph has relatively few edges

»Important Links:

Latest Jobs in PakistanGovt Jobs in PakistanPrivate Jobs in Pakistan
NTS JobsPPSC JobsFPSC Jobs
Teaching JobsNADRA JobsBank Jobs
English McqsGeneral Knowledge McqsPak Studies Mcqs
Current Affairs McqsCurrent Affairs Mcqs PDFCurrent Affairs of Pakistan
Books PDFNotes PDFIslamic Studies Mcqs

Leave a Reply

Your email address will not be published. Required fields are marked *

error: Content is protected !!