Page 1 - HA

Home Assignment

Computer Science

Class – XI

Topic: Introduction to Problem Solving

Fill in the blanks:

1. An __________________ is defined as a step-by-step procedure designed to perform an
operation which will lead to the desired result, if followed correctly.

2. ____________________ have a definite beginning and a definite end, and a finite number
of steps.
3. In order to write effective algorithms, we need to identify the __________________,
___________________ and _________________.

4. A __________________ is a type of diagram that represents the algorithm graphically
using boxes of various kinds, in an order connected by arrows.
5. Three types of flow of control within a program are ___________________,
_________________ and ___________________.
6. An algorithm where all the steps are executed one after the other is said to execute in
___________________.

7. _________________ involves selection of one of the alternatives based on outcome of a
condition.
8. There can be more than one approach to solve a problem and hence we can have more
than one _________________ for a particular problem.

9. An algorithm may have a certain set of steps, which are repeating for a finite number of
times, such an algorithm is said to be __________________.
10. The choice of algorithm should be made on the basis of ________________ and
________________complexity.
11. Three different programming languages are ________________, ________________ and
________________.

12. The method of taking an input and running through the steps of the algorithm is
sometimes called ________________.
13. Only language computer can understand is __________________.