Sharath

Its all about perspective. You like something , I like something else.

I like C# more than java, you migth like java.

Basically Agile development is incremental devlivery. Example: Take your android application, They launch the very first version of it. Then people with use and write they feed back, bugs, issues faced. Company will take the feedback and fix them. Or introduce new features.

This is how aglie methodology works. And its cool. As a software professional we dont hate agile development. :)

Most of the IT gaints use the same methodology.

Practise makes man perfect. If you practice a lot of examples then it would help.

1. Understand the problem

2. what is your approach in order to find solution to it?

if you have solid explaination to both the above question then continue with below approach,

And also use algothrimic method to approach the problem or flowchart method. This is how we approach problem in IT industry

#include <stdio.h>
#include <math.h>
int main()
{
int x,beta,z,k=0;
/*k=3.14+ x * tanh (beta), when x is equal to 20 and beta is divisible by 8 */
do{
printf("k=3.14+ x * tanh (beta)\n");
printf("Enter the value of x: \n");
scanf("%d",&x);
printf("Enter the value of beta: \n");
scanf("%d",&beta);
if(beta%8 == 0)
{
    k=3.14+x*tanh(beta);
    printf("The value of K is %d \n",k);
}
else
printf("Enter Beta value which is divisible by 8");
printf("If you want to continue press 1, else press 0 to exit");
scanf("%d",&z);
if(z==0)
return 0;
}while(z==1);
}

#include <stdio.h>
#include <math.h>
int main()
{
int x,n, sum1 =0, sum2=0;
printf("Enter the upper range value: \n");
scanf("%d",&n);
if (n>=1)
{
   for(x=1;x<=n;x++)
   {
       sum1 = pow(3,x) + pow(4,x);
       sum2 = pow(5,x);
       if ((sum1==sum2) && (sum1 >0) && (sum2 >0))
       printf("The feasible x value is %d, 3^%d+4^%d = %d, 5^%d = %d \n",x,x,x,sum1,x,sum2);
   }
     return 0;
}
else
printf("Please enter value greater than or equal to 1");
}

#include <stdio.h>

int main()
{
int j,i,n,factor;
printf("Enter the last number of the sequence:");
    scanf("%d",&j);
    for(n=2;n<=j;n++)
    {
         for(i=1;i<n;i++)
         {
              if(n%i==0)
              {
                   factor=i;/*finds the largest proper divisor*/
              }
         }
         if(factor>1)
         {
              printf ("%d, ",n);
         }              
     }
     return 0;
}