Pages

Saturday, 3 December 2011

Write a c program for Floyd’s triangle.

1. Write a c program to print Floyd’s triangle
2. C program to display Floyd’s triangle
3. How to print Floyd’s triangle in c
#include<stdio.h>
int main(){
  int i,j,r,k=1;
  printf("Enter the range: ");
  scanf("%d",&r);
  printf("FLOYD'S TRIANGLE\n\n");
  for(i=1;i<=r;i++){
      for(j=1;j<=i;j++,k++)
           printf(" %d",k);
      printf("\n");
  }
  return 0;
}
Sample output:
Enter the range: 10
FLOYD'S TRIANGLE
 1
 2 3
 4 5 6
 7 8 9 10
 11 12 13 14 15
 16 17 18 19 20 21
 22 23 24 25 26 27 28
 29 30 31 32 33 34 35 36
 37 38 39 40 41 42 43 44 45
 46 47 48 49 50 51 52 53 54 55





What is Floyd’s triangle?

Definition of floyd's triangle:

Floyd's triangle is a right angled-triangle using the natural numbers. Examples of floyd's triangle:

Example 1:

1
2 3
4 5 6
7 8 9 10
Example 2:

1
2   3
4   5   6
7   8   9   10
11  12  13  14  15
16  17  18  19  20 21

Write a c program to print Fibonacci series of given range.

Code 1:
1. Write a program to generate the Fibonacci series in c
2. Write a program to print Fibonacci series in c
3. Basic c programs Fibonacci series
4. How to print Fibonacci series in c
5. How to find Fibonacci series in c programming
6. Fibonacci series in c using for loop
#include<stdio.h>
int main(){
    int k,r;
    long int i=0l,j=1,f;
    //Taking maximum numbers form user
    printf("Enter the number range:");
    scanf("%d",&r);
    printf("FIBONACCI SERIES: ");
    printf("%ld %ld",i,j); //printing firts two values.
    for(k=2;k<r;k++){
         f=i+j;
         i=j;
         j=f;
         printf(" %ld",j);
    }
  
    return 0;
}
Sample output:
Enter the number range: 15
FIBONACCI SERIES: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
Code 2:
1. Fibonacci series using array in c
2. Fibonacci series program in c language
3. Source code of Fibonacci series in c
4. Wap to print Fibonacci series in c
#include<stdio.h>
int main(){
    int i,range;
    long int arr[40];
    printf("Enter the number range: ");
    scanf("%d",&range);
    arr[0]=0;
    arr[1]=1;
    for(i=2;i<range;i++){
         arr[i] = arr[i-1] + arr[i-2];
    }
    printf("Fibonacci series is: ");
    for(i=0;i<range;i++)
         printf("%ld ",arr[i]);
  
    return 0;
}

Sample output:
Enter the number range: 20
Fibonacci series is: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181
Code 3:
1. Fibonacci series in c using while loop
2. C program to calculate Fibonacci series
3. C program to display Fibonacci series
4. Fibonacci series in c with explanation
5. C code to generate Fibonacci series
#include<stdio.h>
int main(){
    int k=2,r;
    long int i=0l,j=1,f;
    printf("Enter the number range:");
    scanf("%d",&r);
    printf("Fibonacci series is: %ld %ld",i,j);
    while(k<r){
         f=i+j;
         i=j;
         j=f;
         printf(" %ld",j);
          k++;
    }
  
    return 0;
}
Sample output:
Enter the number range: 10
Fibonacci series is: 0 1 1 2 3 5 8 13 21 34
Code 4:
1. Sum of Fibonacci series in c

#include<stdio.h>
int main(){
    int k,r;
    long int i=0,j=1,f;
    long int sum = 1;
    printf("Enter the number range: ");
    scanf("%d",&r);
    for(k=2;k<r;k++){
         f=i+j;
         i=j;
         j=f;
         sum = sum + j;
    }
    printf("Sum of Fibonacci series is: %ld",sum);
  
    return 0;
}
Sample output:
Enter the number range: 4
Sum of Fibonacci series is: 4
 
Alogrithm:

What is Fibonacci series?
Logic of Fibonacci series
Definition of Fibonacci numbers:
We assume first two Fibonacci are 0 and 1
A series of numbers in which each sequent number is sum of its two previous numbers is known as Fibonacci series and each numbers are called Fibonacci numbers. So Fibonacci numbers is
Algorithm for Fibonacci series 
Fn = Fn-2 + Fn-1
Example of Fibonacci series:
0 , 1 ,1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55  ...
5 is Fibonacci number since sum of its two previous number i.e. 2 and 3 is 5
8 is Fibonacci number since sum of its two previous number i.e. 3 and 5 is 8 and so on.

Write a c program to solve quadratic equation.

1. C program to calculate roots of a quadratic equation
2. Quadratic equation in c language
#include<stdio.h>
#include<math.h>
int main(){
  float a,b,c;
  float d,root1,root2;  
   printf("Enter a, b and c of quadratic equation: ");
  scanf("%f%f%f",&a,&b,&c);
   
  d = b * b - 4 * a * c;
  
  if(d < 0){
    printf("Roots are complex number.\n");
    printf("Roots of quadratic equation are: ");
    printf("%.3f%+.3fi",-b/(2*a),sqrt(-d)/(2*a));
    printf(", %.3f%+.3fi",-b/(2*a),-sqrt(-d)/(2*a));
  
    return 0; 
  }
  else if(d==0){
   printf("Both roots are equal.\n");
   root1 = -b /(2* a);
   printf("Root of quadratic equation is: %.3f ",root1);
   return 0;
  }
  else{
   printf("Roots are real numbers.\n");
  
   root1 = ( -b + sqrt(d)) / (2* a);
   root2 = ( -b - sqrt(d)) / (2* a);
   printf("Roots of quadratic equation are: %.3f , %.3f",root1,root2);
  }
  return 0;
}
Sample output:
Enter a, b and c of quadratic equation: 2 4 1
Roots are real numbers.
Roots of quadratic equation are: -0.293, -1.707
1. How to find a b and c in a quadratic equation
#include<stdio.h>
#include<math.h>
int main(){
  float a,b,c;
  float d,root1,root2;  
  printf("Enter quadratic equation in the format ax^2+bx+c: ");
  scanf("%fx^2%fx%f",&a,&b,&c);
   
  d = b * b - 4 * a * c;
  
  if(d < 0){
    printf("Roots are complex number.\n");
   
    return 0;
  }
 
   root1 = ( -b + sqrt(d)) / (2* a);
   root2 = ( -b - sqrt(d)) / (2* a);
   printf("Roots of quadratic equation are: %.3f , %.3f",root1,root2);
  return 0;
}
Sample output:
Enter quadratic equation in the format ax^2+bx+c: 2x^2+4x+-1
Roots of quadratic equation are: 0.000, -2.000

Write a c program to check given number is palindrome number or not.

Code 1:
1. Wap to check a number is palindrome
2. C program to find whether a number is palindrome or not
#include<stdio.h>
int main(){
    int num,r,sum=0,temp;
    printf("Enter a number: ");
    scanf("%d",&num);
    temp=num;
    while(num){
         r=num%10;
         num=num/10;
         sum=sum*10+r;
    }
    if(temp==sum)
         printf("%d is a palindrome",temp);
    else
         printf("%d is not a palindrome",temp);
    return 0;
}
Sample output:
Enter a number: 131
131 is a palindrome
Code 2:
1. Write a c program for palindrome
2. C program to find palindrome of a number
3. Palindrome number in c language
#include<stdio.h>
int main(){
    int num,r,sum,temp;
    int min,max;
    printf("Enter the minimum range: ");
    scanf("%d",&min);
    printf("Enter the maximum range: ");
    scanf("%d",&max);
    printf("Palindrome numbers in given range are: ");
    for(num=min;num<=max;num++){
         temp=num;
         sum=0;
         while(temp){
             r=temp%10;
             temp=temp/10;
             sum=sum*10+r;
         }
         if(num==sum)
             printf("%d ",num);
    }
    return 0;
}
Sample output:
Enter the minimum range: 1
Enter the maximum range: 50
Palindrome numbers in given range are: 1 2 3 4 5 6 7 8 9 11 22 33 44
Code 3:
1. How to check if a number is a palindrome using for loop
#include<stdio.h>
int main(){
    int num,r,sum=0,temp;
    printf("Enter a number: ");
    scanf("%d",&num);
    for(temp=num;num!=0;num=num/10){
         r=num%10;
         sum=sum*10+r;
    }
    if(temp==sum)
         printf("%d is a palindrome",temp);
    else
         printf("%d is not a palindrome",temp);
    return 0;
}
Sample output:
Enter a number: 1221
1221 is a palindrome
Code 4:
1. C program to check if a number is palindrome using recursion
#include<stdio.h>
int checkPalindrome(int);
int main(){
    int num,sum;
    printf("Enter a number: ");
    scanf("%d",&num);
    sum = checkPalindrome(num);
    if(num==sum)
         printf("%d is a palindrome",num);
    else
    printf("%d is not a palindrome",num);
    return 0;
}
int checkPalindrome(int num){
    static int sum=0,r;
    if(num!=0){
         r=num%10;
         sum=sum*10+r;
         checkPalindrome(num/10);
    }
    return sum;
}
Sample output:
Enter a number: 25
25 is not a palindrome

Definition of Palindrome number or What is palindrome number?

A number is called palindrome number if it is remain same when its digits are reversed. For example 121 is palindrome number. When we will reverse its digit it will remain same number i.e. 121
Palindrome numbers examples: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191 etc.
**FRESHER JOBS**