This section focuses on "Algorithms" in Data Structures. These Multiple Choice Questions (MCQ) should be practiced to improve the Data Structure skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.

1. ___________ is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.

2. Which of the following are characteristics of an algorithm?

3. Not all procedures can be called an algorithm

4. An algorithm should have _______ well-defined inputs.

5. An algorithm should have __________ well-defined outputs

6. Which of the following is a theoretical analysis of an algorithm?

7. _________ is measured by counting the number of key operations such as comparisons in the sorting algorithm.

8. The complexity of an algorithm f(n) gives the running time and/or the storage space required by the algorithm in terms of n as the size of input data.

9. The space required by an algorithm is equal to the sum of ________ components.

10. Space complexity S(P) of any algorithm P is S(P) = C + SP(I), where C is the?


 

Related Posts