Index of programs:Set 3

Use of GOTO

Find number of times anumber is repeated in array

Ascending order sort of numbers

Find routs of quadratic equation

Whether number prime or not

<<Previous                                               Next Page>>

Program1:
#include<iostream.h> #include<conio.h> /* Author : Rohith.R Email : rrohithr@gmail.com Category : Begineer Program : For understanding GOTO ; loop statement replace Meant For: Plus One students,Kerala */ void main() { int i=1; F:if(i<=10) { cout<<i; i=i+1; goto F; } else cout<<"Stopped"; getch(); }

Program 2:

#include<iostream.h> #include<conio.h> /* Author : Rohith.R Email : rrohithr@gmail.com Category : Begineer Program : To find the place where a number is repeated and how many times so Meant For: Plus One students,Kerala */ void main() { int n; cout<<"Enter the limit of array:"; cin>>n; int a[50]; for(int i=1;i<=n;i++) { cout<<"\n"; cout<<"Number"<<"["<<i<<"]"; cin>>a[i]; } cout<<"Enter the checking numbers:"; int c; cin>>c; int l=0; clrscr(); cout<<"Program aim[1]: Finding the places at which number is repeated:"; cout<<"\n\nProgram aim[2]: Printing the number of times number is repeated:"; cout<<"\n\n Found at places: "; for(i=1;i<=n;i++) { if(a[i]==c) { l=l+1; cout<<"\t"<<i; } else continue; } cout<<" of the array"; cout<<"\n\nThe number of times number is repeated:"<<l-1<<"times"; cout<<"\n Press any key to continue"; getch(); }

Program 3:

#include<iostream.h> #include<conio.h> /* Author : Rohith.R Email : rrohithr@gmail.com Category : Begineer Program : To sort a given list of numbers in ascending order Meant For: Plus One students,Kerala Hint : You can also sort in descending order by changing sign in if statement : REFER 1. */ void main() { int num[50],t,n,i,j; cout<<"\n Enter limit:"; cin>>n; for(i=1;i<=n;i++) { cout<<"\n Enter number:"; cin>>num[i]; } for(i=1;i<=n-1;i++) for(j=1;j<=n-i;j++) if(num[j]>num[j+1]) //REF 1: change sign { t=num[j]; num[j]=num[j+1]; num[j+1]=t; } cout<<"\n Number in ascending order\n"; for(i=1;i<=n;i++) cout<<"\t"<<num[i]<<"\n"; cout<<"\n\n Press any key to continue"; getch(); }

Program 4:

#include<iostream.h> #include<math.h> #include<conio.h> /* Author : Rohith.R Email : rrohithr@gmail.com Category : Begineer Program : To find routs of a quadratic equation Meant For: Plus One students,Kerala */ void main() { clrscr(); float r1,r2,a,b,c,d; cout<<"Enter value of a:"; cin>>a; cout<<"Enter value of b:"; cin>>b; cout<<"Enter value of c"; cin>>c; d=(b*b)-(4*a*c); if(d==0) { r1=(-b)/(2*a); cout<<"\nThe root of eqtn is:"<<r1; } else if(d>0) { r1=((-b)+sqrt(d))/(2*a); r2=((-b)-sqrt(d))/(2*a); cout<<"\nThe first root of eqtn is:"<<r1; cout<<"\nThe second root of eqtn is:"<<r2; } else if(d<0) { r1=-b/(2*a); cout<<"\nThe rout part of eqtn is:"<<r1; r2=sqrt(-d)/(2*a); cout<<"\nThe imaginary rout of eqtn is:"<<r2; } cout<<"\n Press any key to continue"; getch(); }

Program5:

#include<iostream.h> #include<conio.h> #include<math.h> /* Author : Rohith.R Email : rrohithr@gmail.com Category : Begineer Program : To find fibonacii series and print primes in it Meant For: Plus One students,Kerala */ void main() { // Fibonacii number generation clrscr(); int prime(unsigned long int); unsigned long int a=0,b=1,c,n,x; cout<<"\t"<<"Enter limit"; cin>>n; cout<<"/////////////////////// Prime Fibonacii generation /////////////////\n"; cout<<"\t\t"<<a<<"\n"; cout<<"\t\t"<<b<<"\n"; for(int i=3;i<=n;i++) { c=a+b; x=prime(c); if(x==1) cout<<"\t\t"<<c<<"\t Prime"<<"\n"; else cout<<"\t\t"<<c<<"\n"; a=b; b=c; } cout<<"\n Press any key to continue"; getch(); } // Function to check whether number prime or not int prime(unsigned long int m) { int n=2; while(n<=sqrt(m)) { if(m%n==0) return(0); else n++; } return(1); }

<<Previous Page

Next Page>>