(A) 64
(B) 96
(C) 128
(D) 256
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.
Continuing sort has time complexity of ?
(A) O(n)
(B) O(n+k)
(C) O(nlogn)
(D) O(k)
Which sorting algorithm is faster?
(A) O (n log n)
(B) O n^2
(C) O (n+k)
(D) O n^3
Although it requires more complicated data structures, Prim’s algorithm for a minimum spanning tree is better than Kruskal’s when the graph has a large number of vertices?
(A) True
(B) False
(C) NA
(D) NA
The difference between Prim s algorithm and Dijkstra s algorithm is that Dijkstra s algorithm uses a same key?
(A) True
(B) False
(C) NA
(D) NA
In the clique cover problem, for two vertices to be in the same group, they must be apart from each other?
(A) True
(B) False
(C) NA
(D) NA
In the clique cover problem, for two vertices to be in the same group, they must be__each other.
(A) Apart from
(B) Far from
(C) Near to
(D) Adjacent to
The term coloring came form the original application which was in map drawing?
(A) True
(B) False
(C) NA
(D) NA