Divide and Conquer Strategy
1. Which of the following sorting algorithm is of divide-and-conquer type?
A.  Bubble sort B.  Insertion sort C.  Quick sort D.  All of above
2. Which of the following versions of merge sort algorithm does uses space efficiently?
A.  Contiguous version B.  Array version C.  Linked version D.  Structure version E.  Heap version.
3. . The divide and conquer merge sort algorithm’s time complexity can be defined as
A.  

θ (long n)

 B.  

θ(n)

 C.  Ω (n log n) D.  

θ (n log n)
4. Merge sort invented by _____________
A.  CARHOARE B.  HAMILTON C.  JOHN VON NEUMANN D.  STRASSEN
5. Application of mergesort _________
A.  Graphic card B.  Networking C.  Card Sorting D.  Data Processing
6. The sorting , which works very well for small file is ______________
A.  Count sort B.  Selection sort C.  Merge sort D.  Quick sort
7. Merge sort is _________.
A.  

External sorting

 B.  Insertion sorting C.  Internal sorting D.  Exponential sorting
8. Advantage of finding maximum and minimum using divide and conquer method instead of using conditional operators is __________________
A.  Reduce Space complexity B.  Get accurate value C.  Reduce Time complexity D.  Simple calculations
9.

The time complexity of Strassen’s algorithm is ___________
A.  O(E log V) B.  O(V2) C.  O(nlog7) D.  O(log n7)
10. By Strassen’s equation what is wrong in the following equation
A.  p1=(a+d)(e+h) B.  p3=(a-c)(e+f) C.  p2=(-e+g)d D.  p4=(a+b)h