(A) T(n)
(B) T(n / 2)
(C) log n
(D) n / 2 + n / 4
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.
For the heap sort we store the tree nodes in?
(A) level-order traversal
(B) in-order traversal
(C) pre-order traversal
(D) post-order traversal
We do sorting to __.
(A) keep elements in random positions
(B) keep the algorithm run in linear order
(C) keep the algorithm run in (log n) order
(D) keep elements in increasing or decreasing order
For the heap sort, access to nodes involves simple __ operations.
(A) arithmetic
(B) binary
(C) algebraic
(D) logarithmic
he sieve technique works in __ as follows.
(A) phases
(B) numbers
(C) integers
(D) routines
The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of?
(A) divide-and-conquer
(B) decrease and conquer
(C) greedy nature
(D) 2-dimension Maxima
The analysis of Selection algorithm shows the total running time is indeed __in n.
(A) arithmetic
(B) geometric
(C) linear
(D) orthogonal
How many elements do we eliminate in each time for the Analysis of Selection algorithm?
(A) n / 2 elements
(B) (n / 2) + n elements
(C) n / 4 elements
(D) n elements