Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

146) The running time of an algorithm T(n), where 'n' is the input size, is given by T(n) = 8T(n/2) + qn, if n>1 Where p,q are constants. The order of this algorithm is

Answer is:

n³

147) L:et m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n. Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)

Answer is:

p x (m div 3)

148) Sorting is useful for

Answer is:

All of these

Explanation:

Sorting is useful for
* report generation
* responding to queries easily
* making searching easier and efficient

149) Choose the correct statements

Answer is:

Both 1) External sorting is used if the number of items to be sorted is very large and 2) External sorting needs auxiliary storage

150) A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be

Answer is:

stable