Scribd
Upload
11 views

Week 1

The first section provides a C program to find the sum of the digits of a positive integer entered by the user. The second section gives a C program to generate the first n terms of the Fibonacci sequence. The third section shows a C program that takes a user input n and outputs all prime numbers between 1 and n.

Uploaded by

Prasad Yadav
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views

Week 1

The first section provides a C program to find the sum of the digits of a positive integer entered by the user. The second section gives a C program to generate the first n terms of the Fibonacci sequence. The third section shows a C program that takes a user input n and outputs all prime numbers between 1 and n.

Uploaded by

Prasad Yadav
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

a)

Write a C program to find the sum of individual digits of a positive integer.

#include<stdio.h> #include<conio.h> void main() { intnum, k=1, sum=0; clrscr(); printf("Enter the number whose digits are to be added:"); scanf("%d",&num); while(num!=0) { k=num%10; sum=sum+k; k=num/10; num=k; } printf("Sum of the digits:%d",sum); getch(); } /* Output:

b) A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to generate the first n terms of the sequence. #include <stdio.h> void main() { int num1=0, num2=1,no,counter,fab; clrscr(); printf("PROGRAM TO FIND THE FIBONACCI SERIES UP TO N NO. IN SERIES"); printf("\nENTER LENGTH OF SERIES (N) : "); scanf("%d",&no); printf("\nFIBONACCI SERIES"); printf("\t%d %d",num1,num2); //LOOP WILL RUN FOR 2 TIME LESS IN SERIES AS THESE WAS PRINTED IN ADVANCE for(counter = 1; counter <= no-2; counter++) { fab=num1 + num2; printf(" %d",fab); num1=num2; num2=fab; } getch(); } Output:

c) Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user. #include <stdio.h> void main() { int no,counter,counter1,check; clrscr(); printf("PRIME NO. SERIES"); printf("\nINPUT THE VALUE OF N: "); scanf("%d",&no); printf("\nTHE PRIME NO. SERIES B/W 1 TO %d : \n\n",no); for(counter = 1; counter <= no; counter++) { check = 0; //THIS LOOP WILL CHECK A NO TO BE PRIME NO. OR NOT. for(counter1 = counter-1; counter1 > 1 ; counter1--) if(counter%counter1 == 0) { check++; // INCREMENT CHECK IF NO. IS NOT A PRIME NO. break; } if(check == 0) printf("%d\t",counter); } getch(); } Output:

You might also like