Module 2 :
Problem Solving strategies – Problem analysis – formal definition of problem – Solution – top- down design – breaking a problem into sub problems- overview of the solution to the sub problems by writing step by step procedure (algorithm) - representation of procedure by flowchart - Implementation of algorithms – use of procedures to achieve modularity. (For this part the instructor has to initially use suitable analogies of real world problems to explain the concepts, before delving into computer-solvable problems.)
Examples for algorithms and flow charts - at least 10 problems (starting with non-numerical examples, and numeric problems like factorial, largest among three numbers, largest among N, Fibonacci etc.; to be introduced with progressive levels of difficulty) must be discussed in detail. (Class assignments and/or tutorials may be used to strengthen understanding of this part. Chapters 4 and 5 of the ‘Rajaraman’ may be used for the teaching-learning process.)
Module 4 :
Functions, calling functions, type conversion and coercion, composition of functions, mathematical functions, user-defined functions, parameters and arguments.
(Note: - Chapter 3 of ‘Downey’ has to be covered. The instructor should demonstrate each aspect of the function with real examples and encourage students to develop their own. Chapter 6 (up to 6.3) of ‘Lambert’ can be used for detailed discussion and self-study.)
0 comments:
Post a Comment