Jyoti P.

Hi Banhi, Dotnet is very easy. Most of the syntaxes are built in. Try to search for some basic articles on Dotnet, so that you will feel comfortable once you start studying Dotnet. You can expertise if you practice all the topics with both theory and practicals. Try to do more and more programs on the specified topics.

When Function is call within same function is called Recursion. The function which call same function is called recursive function. In other word when a function call itself then that function is called Recursive function. Recursive function are very useful to solve many mathematical problems like to calculate factorial of a number, generating Fibonacci series, etc. The rule of thumb for recursion is, "Use recursion, if and only if on each iteration your task splits into two or more similar tasks". So Fibonacci is not a good example of recursion application, while Hanoi is a good one. So most of the good examples of recursion are tree traversal in different disquises. Advantage of Recursion : Function calling related information will be maintained by recursion. Stack evaluation will be take place by using recursion. In fix prefix, post-fix notation will be evaluated by using recursion. Disadvantage of Recursion : It is a very slow process due to stack overlapping. Recursive programs can create stack overflow. Recursive functions can create as loops. Eg : Here is a program which finds the table of any number using recursion. #include stdio.h #include conio.h void main() { int table(int,int); int n,i; // local variable clrscr(); printf("Enter any num : "); scanf("%d",&n); for(i=1;i< =10;i++) { printf(" %d*%d= %d\n",n,i,table(n,i)); } getch(); } int table(n,i) { int t; if(i==1) { return(n); } else { t=(table(n,i-1)+n); return(t); //return(table(n,i-1)+n); } }