- Computer Science Engineering (CSE)
- Data Structures (DS)
- The correctness of a divide and conquer ...

Q. |
## The correctness of a divide and conquer algorithm is usually proved by _________. |

A. | mathematical theorem. |

B. | de-Morgan `s law. |

C. | mathematical induction. |

D. | none. |

Answer» C. mathematical induction. |

View all MCQs in:
Data Structures (DS)

- Which of the following sorting algorithm is of divide-and-conquer type?
- Divide and conquer is an important algorithm design paradigm based on _______.
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- The efficient searching algorithm for algorithm for a sorted array is _________.
- What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
- What is the time complexity of an infix to postfix conversion algorithm?
- Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
- In infix to postfix conversion algorithm, the operators are associated from?
- What is an external sorting algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ