Sample resume for freshers

Hi Guys, This it the time of campus recruitment and many final year and pre final year students are looking for resume. Here I am sharing a sample resume for fresher. If you are fresher then this format will help you for initiating your resume. This very simple resume style with all basic details. Sample Resume for Freshers

Please share other resume formats with us. Thank you.

C Program to Find Armstrong Series

It is a sample c program to generate Armstrong number series from 1 to 1000. 

Program Source Code
//C Program to Find All Armstrong Number between 1 to 1000.
#include"stdio.h"
#include"conio.h"
void main()
{
  int no,r,sum=0,i;
  clrscr();
  printf("\n\n***The Armstrong No. Series Between 1 and 1000 are:***  ");
  for(i=1;i<=1000;i++)
  {
   sum=0;
   no=i;
   while(no!=0)
   {
    r=no%10;
    no=no/10;
    sum=sum+(r*r*r);
   }
   if(sum==i)
    printf("\n%d",i);
  }
   getch();
}

Output

C Program for Check Armstrong Number

It is a sample C program to find accepted number is Armstrong number on not.


Program Source Code

//Write a program to check accepted number is armstrong number or not.
#include"stdio.h"
#include"conio.h"
void main()
{
  int i,no,r,sum=0;
  clrscr();
  printf("*******Armstrong Number******");
  printf("\n Enter a number");
  scanf("%d",&no);
  i=no;
  while(no!=0)
   {
    r=no%10;
    sum=sum+(r*r*r);
    no=no/10;
   }
   if(sum==i)
    printf("Number is a Armstrong number\n");
   else
    printf("Number is not a armstrong number\n");
   getch();
}

Output

Find Fibonacci Series Using Recursion in C Programming

It is sample C program which demonstrate how to use recursion concept in c programming. Here is a recursion program which accept a number from user and generate Fibonacci series using recursion.

Program Code

//Find Fibonacci Series Using Recursion in C Programming
#include"stdio.h"
#include"conio.h"
fibonacci(int n);
void main()
{
 int n,r,i;
 clrscr();
 printf("********** Fibonacci Series Using Recursion *********\n");
 printf("enter a number: ");
 scanf("%d",&n);
 printf("\n\n");

 for(i=0;i<=n;i++)
 {
  r=fibonacci(i);
  printf("\t%d",r);
 }
 getch();
}

fibonacci(int n)
{
 int f;
 if((n==1)||(n==2))
  return(1);
 else if(n==0)
  return(0);
 else
  f=fibonacci(n-2)+fibonacci(n-1);
 return(f);
}

Output