1) What do you understand by “Best case-Efficiency” of an algorithm? describe it with suitable ex.
2) Define the Euclid’s algorithm for finding GCD of two given numbers with suitable ex.
3) What do you mean by Sequential Algorithms?
4) What do you mean by Parallel Algorithms?
5) What is Exact and Approximation algorithm?
6) What is Algorithm Design Technique?
7) What do you mean by Flowchart? describe it with suitable ex.
8) Describe Algorithm’s Correctness with suitable ex.
9) What do you mean by Efficiency of algorithm?
10) What do you understand by generality of the algorithm?
11) What do you mean by algorithm’s Optimality?
12) What do you understand by “Sorting” problem?
13) What do you mean by “Searching” problem?
14) What do you understand by “Worst case-Efficiency” of the algorithm? describe it with suitable ex.