Objectives:
1. How to develop the methods. (Return type and nonreturn type).
2. Definition and application of Recursion.
3. Examples of the recursive programming.(Factorial, GCD/HCF, Fibonacci Series).
Here I will explain the what are the advantages of the recursive approach to solve problems. And will explain how to convert an iterative method to a recursive method.
After completion of the class, the student can understand how to convert the mathematical formula into a method. And in this session, I will explain the Towers of Honni problem with a practical explanation.
The methodology I am using is very simple and depends on the USA curriculum of AP computers. No need to install any software and no need to remember anything.
Here using an online GDB compiler will execute the code and a total of 6 programs will be executed in this session.
With my experience and examples, the student can understand and able to write the code him/herself.
Certified
You have 
