(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
Category: Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best tree edge) when the graph has relatively few edges?
(A) True
(B) False
(C) NA
(D) NA
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
(A) (V+E)
(B) (V E)
(C) (V)
(D) (V^2)
The relationship between number of back edges and number of cycles in DFS is?
(A) Both are equal
(B) Back edges are half of cycles
(C) Back edges are one quarter of cycles
(D) There is no relationship between no. of edges and cycles
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
(A) log (V)
(B) V.V
(C) E.E
(D) log €
Analysis of Selection algorithm ends up with?
(A) T(n)
(B) T(1 / 1 + n)
(C) T(n / 2)
(D) T((n / 2) + n)
Sorting is one of the few problems where provable __ bonds exits on how fast we can sort.
(A) lower
(B) upper
(C) average
(D) log n
Divide-and-conquer as breaking the problem into a small number of?
(A) smaller sub problems
(B) pivot
(C) Sieve
(D) Selection