(A) different
(B) same
(C) NA
(D) NA
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.
If n is not very large, then almost any algorithm __ be fast.
(A) may
(B) may be not
(C) will
(D) none
For n = 1, 000, 000, if plane-sweep takes 1 second, the bruteforce will take about __.
(A) 14 hours
(B) 14 minutes
(C) 14 second
(D) none
The runtime of entire plane-sweep algorithm is O(n log n)__.
(A) True
(B) False
(C) NA
(D) NA
Plane-sweep Algorithm, the inner while-loop __ execute more than n times over the entire course of the algorithm.
(A) can
(B) cannot
(C) NA
(D) NA
Sorting takes __ time.
(A) O(n)
(B) O(n^2)
(C) O(n log n)
(D) none
This approach of solving geometric problems by sweeping a line across the plane is called __.
(A) plane sweep
(B) brute force
(C) NA
(D) NA
This follows from the fact that dominance relation is __.
(A) symmetric
(B) transitive
(C) non-transitive
(D) none