Analysis Of Algorithm

Topic Covered : Introduction to algorithm design and Data structures, Comparison of Algorithms, Complexity in terms of space and time, Calculation of O- notation. Abstract Data type and its implementation with a Rational number example

1. Which of the following concepts means determining at runtime what method to invoke?

A) Dynamic binding

B) Data hiding

C) Dynamic loading

D) None

Correct Answer: Dynamic binding

2. What is an external sorting algorithm?

A) Algorithm that uses tape or disk during the sort

B) Algorithm that uses main memory during the sort

C) Algorithm that involves swapping

D) Algorithm that are considered in place

Correct Answer: Algorithm that uses tape or disk during the sort

Explanation : Algorithm that uses tape or disk during the sort is called external sorting algorithm.

3. Which of the following is a Divide and Conquer algorithm?

A) Bubble Sort

B) Merge Sort

C) Selection Sort

D) Heap Sort

Correct Answer: Merge Sort

Explanation : Merge Sort is a Divide and Conquer algorithm.

Related Topics

Analysis Of Algorithm

1. Which of the following concepts means determining at runtime what method to invoke?

2. What is an external sorting algorithm?

3. Which of the following is a Divide and Conquer algorithm?