1. In this unit the following concepts have been formally or informally defined and discussed:
Problem, Solution of a Problem, Algorithm, Program, Process (all section 1.1) . Instance of a problem (Section 1.2)
2. The differences between the related concepts of
(i) algorithm, program and process (Section 1.1)
(ii) problem and instance of a problem (Section 1.2)
(iii) a general method and an algorithm (Section 1.4) and
(iv) definiteness and effectiveness of an algorithm (Section 1.4)
are explained
3. The following well-known problems are defined and discussed:
(i) The Four-Colour Problem (Section 1.2)
(ii) The Fermat’s Last Theorem (Section 1.3)
(iii) Travelling Salesperson Problem (Section 1.7)
(iv) 8-puzzle problem (Section 1.7)
(v) Goldbach conjecture (Solution of Ex.1)
(vi) The Twin Prime Conjecture (Solution of Ex.1)
4. The following characteristic properties of an algorithm are discussed (Section 1.4)
(i) Finiteness
(ii) Definiteness
(iii) Inputs (iv) Outputs (v) Effectiveness
5. In order to emphasize the significant role that available tools play in the design of an algorithm, the problem of multiplication of two natural numbers is solved in three different ways, each using a different set of available tools. (Section 1.5)
6. In Section 1.6, the building blocks of an algorithm including
(a) the instructions viz., (i) assignment (ii) read and (iii) Write and
(b) control structures viz., (i) sequencing (ii) selection and (iii) repetition are discussed
7. The important concepts of procedure and recursion are discussed in Section 1.6.
8. In Section 10, the following issues which play an important role in designing, developing and choosing an algorithm for solving a given problem, are discussed:
(i) understanding the problem
(ii) analysing the problem
(iii) capabilities of the computer system used for solving the problem
(iv) whether required solution must be exact or an approximate solution may be sufficient
(v) choice of appropriate technology
(vi) notations for specification of an algorithm
(vii) proving correctness of an algorithm
(viii) analysing an algorithm and
(ix) coding the algorithm.
Problem, Solution of a Problem, Algorithm, Program, Process (all section 1.1) . Instance of a problem (Section 1.2)
2. The differences between the related concepts of
(i) algorithm, program and process (Section 1.1)
(ii) problem and instance of a problem (Section 1.2)
(iii) a general method and an algorithm (Section 1.4) and
(iv) definiteness and effectiveness of an algorithm (Section 1.4)
are explained
3. The following well-known problems are defined and discussed:
(i) The Four-Colour Problem (Section 1.2)
(ii) The Fermat’s Last Theorem (Section 1.3)
(iii) Travelling Salesperson Problem (Section 1.7)
(iv) 8-puzzle problem (Section 1.7)
(v) Goldbach conjecture (Solution of Ex.1)
(vi) The Twin Prime Conjecture (Solution of Ex.1)
4. The following characteristic properties of an algorithm are discussed (Section 1.4)
(i) Finiteness
(ii) Definiteness
(iii) Inputs (iv) Outputs (v) Effectiveness
5. In order to emphasize the significant role that available tools play in the design of an algorithm, the problem of multiplication of two natural numbers is solved in three different ways, each using a different set of available tools. (Section 1.5)
6. In Section 1.6, the building blocks of an algorithm including
(a) the instructions viz., (i) assignment (ii) read and (iii) Write and
(b) control structures viz., (i) sequencing (ii) selection and (iii) repetition are discussed
7. The important concepts of procedure and recursion are discussed in Section 1.6.
8. In Section 10, the following issues which play an important role in designing, developing and choosing an algorithm for solving a given problem, are discussed:
(i) understanding the problem
(ii) analysing the problem
(iii) capabilities of the computer system used for solving the problem
(iv) whether required solution must be exact or an approximate solution may be sufficient
(v) choice of appropriate technology
(vi) notations for specification of an algorithm
(vii) proving correctness of an algorithm
(viii) analysing an algorithm and
(ix) coding the algorithm.
No comments:
Post a Comment