Ge2115 - Computer Practice Lab - Practice Programs: Courtesy VRB Publishers

GE2115 -COMPUTER PRACTICE LAB PRACTICE PROGRAMS
1.AIM: To write a program to find the area and circumference of the circle. ALGORITHM: Step-1 Step-2 Step-3 Start the program. Input the radius of the circle. Find the area and circumference of the circle using the formula Area=3.14*r*r Circumference=2*3.14*r Print the area and the circumference of the circle Stop
Step-4 Step-5 PROGRAM:
/*TO FIND THE AREA AND CIRCUMFERENCE OF THE CIRCLE*/ #include<stdio.h> main() { float rad,area,circum; printf(\nEnter the radius of the circle); scanf(%f,&rad); area=3.14*rad*rad; circum=2*3.14*rad; printf(\nArea=%f,area); printf(\nCircumference=%f,circum); } SAMPLE INPUT AND OUTPUT: Enter the radius of the circle 5 Area=78.500000 Circumference=31.400000
2. AIM:
To write a program to insert an element in an array in the given position ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Start the program Enter the size of the array Enter the elements of the array Print the elements of the array Enter the element to be inserted and its position in the array Set a loop up to the position you enter Push the order of the position by one, which are greater, then the position you entered
WWW.PROFMARIAMICHAEL.COM
Courtesy VRB Publishers
Page 1

Step-8 Step-9 Step-10 PROGRAM: /*INSERTING AN ELEMENTS INTO THE VECTOR*/ #include<stdio.h> main() { int a[100],no,i,pos,item; printf(\nEnter the size of the matrix); scanf(%d,&no); printf(\nEnter the elements of the matrix); for(i=0;i<no;i++) scanf(%d,&a[i]); printf(\nEntered elements of the matrix is); for(i=0;i<no;i++) printf(\n%d,a[i]); printf(\nEnter the element and its position in the array); scanf(%d\n%d,&item,&pos); no++; for(i=no;i>=pos;i-) a[i]=a[i-1]; a[-pos]=item; printf(\n); printf(\nArray after the insertion); for(i=0;i<no;i++) printf(\n%d,a[i]); } SAMPLE OUTPUT: Enter the size of the array 5 Enter the elements of the array 1 2 4 5 6 Entered elements of the array 1 2 4 5 6 Enter the element and its position in the array 3 Array after the insertion 1 2 3 4 5 6 Insert the element in the position entered by you Print the array after insertion of the element Stop
3.AIM:
To write a program to print the ascending and descending order of the given array. ALGORITHM: Step-1 Step-2 Step-3 Start the program Enter the size of the array Enter the elements of the array
Page 2

Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 Step-11 Step-12 PROGRAM: /*ASCENDING AND DESCENDING ORDER OF THE GIVEN NUMBERS*/ #include<stdio.h> main() { int num[100],no,i,j,a; printf(Enter Upper Limit...); scanf(%d,&no); printf(Enter the numbers); for(i=0;i<no;i++) scanf(%d,&num[i]); for(i=0;i<no-1;i++) { for(j=i+1;j<no;j++) { if(num[i]<num[j]) { a=num[i]; num[i]=num[j]; num[j]=a; } } } printf(\nThe ascending order of the given numbers); for(i=0;i<no;i++) printf(\n%d,num[i]); printf(\n The descending number of the given numbers); for(j=no-1;j>=0;j-) printf(\n%d,num[j]); } SAMPLE OUTPUT Enter the number how many number you want to sort 5 Enter the numbers 10 30 50 60 20 The ascending order of the given numbers 10 20 30 50 60 The descending number of the given numbers 60 50 30 20 10 Set a loop up to the array size minus one Set a inner loop up to the size of the array Check whether the next array element is greater than or not If greater than exchange their position If not greater than then go to the loop After the execution of the inner loop the outer loop is executed Print the ascending order of the given array Print the descending order of the given array Stop
Page 3

4.AIM:
To write a program to convert the binary number into decimal number ALGORITHM: Step-1 Step-2 Step-3 Step-4 Start the program Enter the binary value Set a loop Convert the binary number into decimal by using statement given below Find the digit decimal=decimal+(digit<<base); base=base+1; binary number=binarynumber/10; After the execution of the loop print the decimal value equivalent to the entered binary number Stop
//CONVERT BINARY NUMBER INTO DECIMAL NUMBER #include<stdio.h> main() { int bnum,digit,decimal=0,bin,base=0; printf(\nEnter the binary number...); scanf(%d,&bnum); printf(%d,bnum); bin=bnum; while(bnum!=0) { digit=bnum%10; decimal=decimal+(digit<<base); base=base+1; bnum=bnum/10; } printf(\nThe binary equivalent of %d in decimal=%d,bin,decimal); } SAMPLE OUTPUT: Enter the binary number...100 The binary equivalent of 100 in decimal=4
5.AIM:
To write a program to find the cosine value of the given x ALGORITHM: Step-1 Step-2 Step-3 Start the program Enter the value of X Convert X into radian
Page 4

Step-4 Step-5 Step-6 Step-7 PROGRAM: // TO FIND THE COSINE VALUE #include<stdio.h> #include<math.h> main() { float x,a,sum,temp; int i,no=20,mul; printf(\nEnter the value of x); scanf(%f,&x); a=x; x=x*3.1412/180; temp=1;sum=1; for(i=1;i<no+1;i++) { temp=temp*pow((double)(-1),(double)(2*i-1))*x*x/(2*i*(2*i-1)); sum=sum+temp; } printf(\nThe cosine value of %f is %f,a,sum); } SAMPLE OUTPUT Enter the value of x 45 The cosine value of 45.000000 is 0.707176 Set a loop Find the value of cosine using the formula temp=temp*pow((double)(-1),(double)(2*i-1))*x*x/(2*i*(2*i-1)); sum=sum+temp; After the execution of the loop print the cosine value Stop
6.AIM:
To write a Program to find the exponent of the given ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 PROGRAM: //EXPONENTIAL SERIES #include<stdio.h> Start the program Enter the x value and n value Set a loop up to n Find the exponent value of x temp=temp*x/i sum=sum+temp After the execution of the loop print the exponent value of x Stop number
Page 5

main() { float x,temp=1,sum=1; int i,no; printf(Enter the numbers); scanf(%f %d,&x,&no); for(i=1;i<no;i++) { temp=temp*x/i; sum=sum+temp; } printf(Exponent of x is %f\n,sum); } SAMPLE OUTPUT: Enter the numbers 5 5 Exponent of x is 65.375000
7.AIM:
To write a program to find the factorial of the given number ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 PROGRAM: //TO FIND THE FACTORIAL OF THE GIVEN NUMBER #include<stdio.h> main() { int fact=1,i,num; printf(Enter the number); scanf(%d,&num); for(i=1;i<=num;i++) { fact=fact*i; } printf(The factorial of %d is %d,num,fact); } SAMPLE INPUT AND OUTPUT: Start the program Enter a number Set a loop to find the factorial of the given number using the formula Fact=Fact*I Print the factorial of the given number Stop
Page 6

Enter the number 5 The factorial of 5 is 120
8.AIM:
To write a program to convert the Celsius into Fahrenheit ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 PROGRAM: //CONVERT THE CELCIUS INTO FAHRENTEIET #include<stdio.h> main() { float cel,faren; printf(Enter the Celsius value...); scanf(%f,&cel); faren=(1.8*cel)+32; printf(The fahrenteiet value of the given %f celsius value is %f,cel,faren); } SAMPLE INPUT AND OUTPUT Enter the Celsius value...45 The fahrenteiet value of the given 45.000000 celsius value is 113.000000 Start the program. Enter the Celsius value. Calculate the Fahrenheit value by using the formula given below. Fahreheit=(1.8*Celsius)+32 Print the Fahrenheit value Stop
9.AIM:
To write a program to generate the fibbonaci series ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 PROGRAM: Start the program Enter the number Check the number whether the number is zero or not. If zero print Zero value. If not zero go further. Set a loop up to the given number. fib=fib+a; a=b; b=c; Every increment in the loop prints the value of fib. After the execution of the loop stops the program
Page 7

//TO PRINT THE FIBBONACI SERIES UPTO GIVEN NUMBERS #include<stdio.h> main() { int num,fib=0,a=0,b=1,i; printf(Enter the number); scanf(%d,&num); printf(\n FIBBONACI SERIES\n); if(num==0) printf(0); else { for(i=0;i<num;i++) { fib=fib+a; a=b; b=fib; printf(%d\t,fib); } } } SAMPLE INPUT AND OUTPUT Enter the number 5 FIBONACCI SERIES 0 1 1 2 3 10.AIM: To write a program to store the data in a file and read the data from the file. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 PROGRAM: //DATA FILE #include<stdio.h> main() { FILE *fp; char c; fp=fopen(Write,w); printf(Enter the text....); Start the program Initialize the file pointer Open the file in the write mode using file pointer Enter the data Store the data in the file using the putc() statement Close the file Open the file in the read mode using the file pointer Print the data in the file End
Page 8

while((c=getchar())!=EOF) putc(c,fp); fclose(fp); printf(The entered data is....); fp=fopen(Write,r); while((c=getc(fp))!=EOF) printf(%c,c); fclose(fp); } SAMPLE OUTPUT: Enter the text.... Welcome to C language ^Z The entered data is.... Welcome to C language
11.AIM:
Program to illustrate functions without arguments and no return values. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 PROGRAM: //FUNCTIONS WITH OUT ARGUMENTS AND NO RETURN VALUES #include<stdio.h> main() { void message(void); message(); } void message() { char str[100]; printf(Enter a string........); scanf(%s,str); printf(WELCOME TO...%s,str); } SAMPLE OUTPUT: Enter a string LAK WELCOME TO LAK Start the program Declare the function Call the function Enter the String Print the string End the program in the calling function
12.AIM:
To write a program to illustrate function with arguments and no return value.
Page 9

ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 PROGRAM: //FUNCTIONS WITH ARGUMENTS BUT NO RETURN VALUES #include<stdio.h> main() { int a,b; printf(Enter two numbers....); scanf(%d%d,&a,&b); add(a,b); } add(int a,int b) { int c; c=a+b; printf(The addition of two numbers %d and %d is %d,a,b,c); } SAMPLE OUTPUT Enter two numbers....10 20 The addition of two numbers 10 and 20 is 30 Start the program Enter the two numbers Call the function with arguments passing to the calling function Add the two numbers in the calling function Print the addition of two values End the program in the calling function
13.AIM:
Program to illustrate parameter passed to the function. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 PROGRAM: Start the program Enter the size of the array Enter the elements of the array Print the array elements Call the function with base address of the array passed to it In the calling function gets the base address in the pointer variable Add the array elements Return the value from the calling function to the variable in the called function Print the sum in the called function End the program in the main function
Page 10

//illustrate parameter passed to the function #include<stdio.h> main() { int a[10],i,no,sum=0; printf(Enter the size of array...); scanf(%d,&no); printf(Enter the elements of the array...); for(i=0;i<no;i++) scanf(%d,&a[i]); for(i=0;i<no;i++) printf(\n%d,a[i]); sum=add(&a[0],no); printf(\nThe sum of %d numbers is...%d,no,sum); } add(int *pt,int n) { int i,a=0; for(i=0;i<n;i++) { a=a+*pt; pt++; } return(a); } SAMPLE OUTPUT: Enter the size of array... 5 Enter the elements of the array ... 1 2 3 4 5 1 2 3 4 5 The sum of 5 numbers is... 15
14.AIM:
To write a program to illustrate a function with arguments values. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 PROGRAM: Start the program Enter the two numbers Call the function with two arguments passed to it Add the two numbers in the calling function Return the addition value to the called function from the calling function Print the addition value in the main function End with return
Page 11

//FUNCTION WITH ARGUMENTS AND RETURN VALUES #include<stdio.h> main() { int a,b,c; printf(Enter the two numbers...); scanf(%d %d,&a,&b); c=add(a,b); printf(The addition of two numbers %d and %d is %d,a,b,c); } add(int x,int y) { int z; z=x+y; return(z); } SAMPLE OUTPUT: Enter the two numbers... 5 6 The addition of two numbers 5 and 6 is 11
15.AIM:
To write a program to find the largest and smallest of the given array. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 PROGRAM: //FIND THE LARGEST AND SMALLEST OF THE GIVEN ARRAY #include<stdio.h> main() { int a[100],i,small,large,no; printf(In how many numbers you want to find....); scanf(%d,&no); printf(Enter the elements of the array....); for(i=0;i<no;i++) Start the program Enter the size of array Enter the elements of the array Print the array elements Initialize the large and small is equal to the first element of the array Set a loop up to the array size Check the next element greater then the larger. If greater then as sign next element to the large Check the next element smaller then the larger. If smaller then assign next element to the small Print the value of large and small after the execution of the loop Stop
Page 12

scanf(%d,&a[i]); printf(\nThe elements of the array ); for(i=0;i<no;i++) printf(\n%d,a[i]); small=a[0]; large=a[0]; for(i=1;i<no;i++) { if(a[i]>large) large=a[i]; else if(a[i]<small) small=a[i]; } printf(\nThe largest of the given array is %d,large); printf(\nThe smallest of the given array is %d,small); } SAMPLE OUTPUT: In how many numbers you want to find....5 Enter the elements of the array.... 12 34 56 87 43 The elements of the array 12 34 56 87 43 The largest of the given array is 87 The smallest of the given array is 12
16.AIM:
To write a program to give the addition of two matrixes. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 Step-11 PROGRAM: // FIND THE ADDITION OF TWO MATRIXES #include<stdio.h> main() { int a[25][25],b[25][25],c[25][25],i,j,m,n; Start the program Enter the row and column of the matrix Enter the elements of the A matrix Enter the elements of the B matrix Print the A matrix in the matrix form Print the B matrix in the matrix form Set a loop up to the row Set a inner loop up to the column Add the elements of A and B in column wise and store the result in C matrix After the execution of the two loops. Print the value of C matrix Stop
Page 13

printf(Enter the rows and column of two matrixes...\n); scanf(%d %d,&m,&n); printf(\nEnter the elements of A matrix...); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf(%d,&a[i][j]); } printf(\nEnter the elements of B matrix...); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf(%d,&b[i][j]); } printf(\nThe elements of A matrix); for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) printf(\t%d,a[i][j]); } printf(\nThe elements of B matrix); for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) printf(\t%d,b[i][j]); } printf(\nThe addition of two matrixes); for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) { c[i][j]=a[i][j]+b[i][j]; printf(\t%d,c[i][j]); } } } SAMPLE OUTPUT: Enter the rows and column of two matrixes... 3 3 Enter the elements of A matrix... 1 2 3 4 5 6 7 8 9 Enter the elements of B matrix... 1 2 3 4 5 6 7 8 9 The elements of A matrix 1 2 3 4 5 6 7 8 9 The elements of B matrix 1 2 3 4 5 6 7 8 9 The addition of two matrixes
Page 14

2 8 14 4 10 16 6 12 18
17.AIM:
To write a program to multiply two matrixes. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 Step-11 Step-12 Step-13 PROGRAM: // MULTPLICATION OF TWO MATRIX #include<stdio.h> main() { int a[25][25],b[25][25],c[25][25],i,j,k,r,s; int m,n; printf(\nEnter the Rows and Columns of A matrix...); scanf(%d %d,&m,&n); printf(\nEnter the Rows and Columns of B matrix...); scanf(%d %d,&r,&s); if(m!=r) printf(\nThe matrix cannot multiplied); else { printf(\nEnter the elements of A matrix); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf(\t%d,&a[i][j]); } printf(\nEnter the elements of B matrix); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf(\t%d,&b[i][j]); } printf(\nThe elements of A matrix); Start the program Enter the row and column of the A matrix Enter the row and column of the B matrix Enter the elements of the A matrix Enter the elements of the B matrix Print the elements of the A matrix in matrix form Print the elements of the B matrix in matrix form Set a loop up to row Set a inner loop up to column Set another inner loop up to column Multiply the A and B matrix and store the element in the C matrix Print the resultant matrix Stop
Page 15

for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) printf(\t%d,a[i][j]); } printf(\n The elements of B matrix); for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) printf(\t%d,b[i][j]); } for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) { c[i][j]=0; for(k=0;k<m;k++) c[i][j]=c[i][j]+a[i][k]*b[k][j]; } } } printf(The multiplication of two matrixes); for(i=0;i<m;i++) { printf(\n); for(j=0;j<n;j++) printf(\t%d,c[i][j]); } } SAMPLE INPUT AND OUTPUT Enter the Rows and Columns of A matrix... 3 3 Enter the Rows and Columns of B matrix... 3 3 Enter the elements of A matrix 1 2 3 4 5 6 7 8 9 Enter the elements of B matrix 1 2 3 4 5 6 7 8 9 The elements of A matrix 1 2 3 4 5 6 7 8 9 The elements of B matrix 1 2 3 4 5 6 7 8 9 The multiplication of two matrixes 30 36 42 66 81 96 102 126 150
18.AIM:
WWW.PROFMARIAMICHAEL.COM Courtesy VRB Publishers Page 16

To find sum of Digits, Reverse and the given Number is Palindrome or not. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 PROGRAM: /* PROGRAM TO FIND THE SUM AND REVERSE OF THE GIVEN NUMBER*/ #include<stdio.h> main() { unsigned long int a,num,sum=0,rnum=0,rem; printf(\nEnter the number...); scanf(%ld,&num); a=num; while(num!=0) { rem=num%10; sum=sum+rem; rnum=rnum*10+rem; num=num/10; } printf(\nThe sum of the digits of %ld is %ld\n,a,sum); printf(\nThe reverse number of the %ld is %ld,a,rnum); if(a==rnum) printf(\nThe given number is a palindrome); else printf(\nThe given number is not a palindrome); } Sample output: Enter the number...12321 The sum of the digits of 12321 is 9 The reverse number of the 12321 is 12321 The given number is a palindrom Start the program Enter the number Set a loop upto the number is not equal to zero Find the digit of the number Find the sum of digit Find the reverse number After the end of the loop print the sum and reverse number the digit Find whether the reverse number is equal to the given number or not. If equal the number is palindrome If not equal the given number is not palindrome Stop
of
19.AIM:
To write a program to find the roots of the quadratic equation.
Page 17

ALGORITHM: Step-1 Step-2 Step-3 Step-4 Start the program Enter the value of a, b, c Find the value of d by using the formula D=b*b-4*a*c If D is greater then or equal to zero then find the two roots as root1=(-b+sqrt(d))/(2*a); root2=(-b-sqrt(d))/(2*a); Print the two roots If the D is not greater then or equal to zero then print the statement the roots are imaginary. Stop
// To find the roots of the quadratic equation #include<stdio.h> #include<math.h> main() { int a,b,c,d; float root1,root2; printf(Enter the values of a,b,c\n); scanf(%d %d %d,&a,&b,&c); d=b*b-4*a*c; if(d>=0) { root1=(-b+sqrt(d))/(2*a); root2=(+b+sqrt(d))/(2*a); printf(The roots of the values a=%d,b=%d,c=%d are\n %f %f,a,b,c,root1, root2); } else printf(The roots are imagenary); } SAMPLE OUTPUT: Enter the values of a,b,c 1 0 -9 The roots of the values a=1,b=0,c=-9 are 3.000000 3.000000
20.AIM:
To write a program to find the factorial of the given number using recursion ALGORITHM: Step-1 Step-2 Step-3 Step-4 Start the program Enter the number Call the recursive function passing the number to the recursive function as an argument. If the entered number is equal to one then return one to main function.
Page 18

Step-5 Step-6 Step-7 PROGRAM: #include<stdio.h> main() { int num,a; printf(Enter the number); scanf(%d,&num); a=recur(num); printf(The factorial of the number %d is %d,num,a); } recur(int no) { int fact=1; if(no==1) return(1); else fact=no*recur(no-1); } SAMPLE OUTPUT: Enter the number 5 The factorial of the number 5 is 120 If the number is less greater then one then call recursive Print the factorial value of the number. Stop
21.AIM:
To write a program to find whether the string is palindrome or not. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 PROGRAM: //TO FIND WHETHER THE GIVEN STRING IS PALINDROME OR NOT #include<stdio.h> #include<stdlib.h> main() { Start the program Enter the string Find the string length using the strlen() function Print the string length Set a loop up to the half of the string length Compare every character above the middle character with the below character of the middle character If any character equal prints the given string is palindrome If the character is not equal then print the given string is not a palindrome Stop
Page 19

int len=0,i,j; char name[25]; printf(Enter the string...); scanf(%s,name); while(name[len]!=\0') len++; printf(\n%d,len); for(i=0,j=len-1;i<len/2;i++,j-) { if(name[i]!=name[j]) { printf(\nThe given string is not a palindrom); exit(0); } }
22. AIM:
To find the number of vowels and number of consonants in a given string. PROGRAM: //TO FIND THE NUMBER VOWLES AND NUMBER OF CONSONANTS IN A GIVEN STRING #include<stdio.h> main() { int v=0,c=0,i=0; char str[25]; printf(Enter the string...); scanf(%s,str); while(str[i]!=\0') { switch(str[i]) { case a: case A: case E: case I: case O: case U: case e: case i: case o: case u: v++; break; default: c++; } i++; } printf(\nThe number of vowels is %d,v); printf(\nThe number of consonants is %d,c);
Page 20

getch(); } SAMPLE OUTPUT: Enter the string RAJA The number of vowels is 2 The number of consonants is 2
23.AIM:
To write the program to transpose the given matrix. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 PROGRAM: //TRANSPOSE OF GIVEN MATRIX #include<stdio.h> main() { int i,j,a[25][25],row,col; printf(\nEnter the number of rows and column of matrix); scanf(%d%d,&row,&col); printf(\nEnter the elements of the matrix); for(i=0;i<row;i++) for(j=0;j<col;j++) scanf(%d,&a[i][j]); printf(The given matrix); for(i=0;i<row;i++) { printf(\n); for(j=0;j<col;j++) printf(\t%d,a[i][j]); } printf(\nThe transpose of the given matrix); for(i=0;i<row;i++) { printf(\n); for(j=0;j<col;j++) printf(\t%d,a[j][i]); } } SAMPLE OUTPUT: Start the program Enter the row and column of the matrix Enter the elements of the matrix Print the elements of the matrix in the matrix format Set the loop up to row Set the inner loop up to column Print the matrix elements in the row wise Stop
Page 21

Enter the number of rows and column of matrix 3 3 Enter the elements of the matrix 1 2 3 4 5 6 7 8 9 The given matrix 1 2 3 4 5 6 7 8 9 The transpose of the given matrix 1 4 7 2 5 8 3 6 9
24.AIM:
To write a program to find the sine value for the entered value. ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 PROGRAM: // SINE SERIES #include<stdio.h> #include<math.h> main() { int no,i; float x,a,sum,b; printf(Enter the numbers); scanf(%f %d,&x,&no); b=x; x=x*3.141/180; a=x; sum=x; for(i=1;i<no+1;i++) { a=(a*pow((double)(-1),(double)(2*i-1))*x*x)/(2*i*(2*i+1)); sum=sum+a; } printf(Sin(%f) value is %f,b,sum); } SAMPLE OUTPUT: Enter the numbers 30 100 Start the program Enter the values x and n Convert the value x into radians Set a loop up to n Find the value of the sine by using the formula Print the value of sine x after the execution of the loop stop
Page 22

Sin(30.000000) value is 0.499914
25.AIM:
To write a program to print the student name, roll no, average mark and their grades. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-9 PROGRAM: //STUDENT RECORD USING POINTER AND STRUCT #include<stdio.h> main() { struct student { char name[25]; char regno[25]; int avg; char grade; } stud[50],*pt; int i,no; printf(Enter the number of the students...); scanf(%d,&no); for(i=0;i<no;i++) { printf(\n student[%d] information:\n,i+1); printf(Enter the name); scanf(%s,stud[i].name); printf(\nEnter the roll no of the student); scanf(%s,stud[i].regno); printf(\nEnter the average value of the student); scanf(%d,&stud[i].avg); } pt=stud; for(pt=stud;pt<stud+no;pt++) { if(pt->avg<30) pt->grade=D; else if(pt->avg<50) pt->grade=C; else if(pt->avg<70) pt->grade=B; else Start the program Initialize the structure variable Enter the number of student Set a loop up to the number of student Enter the student name, roll no, average marks Find their grades Print the student name, roll no, average and their grade Stop
Page 23

pt->grade=A; } printf(\n); printf(NAME REGISTER-NO AVERAGE GRADE\n); for(pt=stud;pt<stud+no;pt++) { printf(%-20s%-10s,pt->name,pt->regno); printf(%10d \t %c\n,pt->avg,pt->grade); } } SAMPLE OUTPUT: Enter the number of the students 3 student[1] information: Enter the name MUNI Enter the roll no of the student 100 Enter the average value of the student 95 student[2] information: Enter the name LAK Enter the roll no of the student 200 Enter the average value of the student 55 student[3] information: Enter the name RAJA Enter the roll no of the student 300 Enter the average value of the student 25 NAME REGISTER-NO AVERAGE GRADE MUNI 100 95 A LKA 200 55 B RAJA 300 25 D
26.AIM:
To write a program to swap two number without using pointer ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 PROGRAM: // SWAP THE NUMBER USING THE POINTER #include<stdio.h> main() { int x,y; Start the program Enter the two numbers Call the display function Pass the address of the two numbers to the calling function Get the address in the calling function in the pointer Swap the number using temporary variable Print the swamped values in the main function Stop
Page 24

printf(\nEnter the two numbers); scanf( %d %d,&x,&y); printf(\nThe entered number for x and y are,x=%d\ty=%d,x,y); display(&x,&y); printf(\nAfter the swapping the value of,x=%d\ty=%d,x,y); } display(int *a,int *b) { int t; t=*a; *a=*b; *b=t; } SAMPLE OUTPUT: Enter the two numbers...10 20 The entered number for x and y are, x=10 y=20 After the swapping the value of, x=20 y=10
27.AIM:
To write a program to find the string length and concatenation of string. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 PROGRAM: // TO FIND THE STRING LENGTH OF THE STRING #include<stdio.h> #include<string.h> main() { char str1[50],str2[]= WELCOME; int len; printf(Enter the string...); scanf(%s,str1); printf(\nThe string length of %s is %d,str1,strlen(str1)); printf(\nTheconcatenation string length is %d and its string is %s,strlen(str1),strcat(str1,str2)); } SAMPLE OUTPUT: Enter the string... LAK The string length of lak is 3 Start the program Enter the string Find the string length using the function strlen() Print the string length of the entered string concatenation the two string using the function strcat() Print the concatenated string Stop
Page 25

The concatenation string length is 16 and its string is LAK WELCOME W
28.AIM:
To write a program to print the pascal triangle ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 PROGRAM: //CONSTRUCT PASCAL TRIANGLE #include<stdio.h> main() { int noline,i,j,temp; printf(Enter the number of lines to print); scanf(%d,&noline); for(i=1;i<=noline;i++) { for(j=1;j<=noline-i;j++) printf( ); temp=i; for(j=1;j<=i;j++) printf(%4d,temp++); temp=temp-2; for(j=1;j<i;j++) printf(%4d,temp-); printf(\n\n); } printf(\n); } SAMPLE OUTPUT: Enter the number of lines to print 5 1 2 3 2 3 4 5 4 3 4 5 6 7 6 5 4 5 6 7 8 9 8 7 6 5 Start the Enter the Construct Construct Pirnt the After the Stop program number of lines a loop up to the given number another inner loop number execution of the loop
29.AIM:
To write a program to find whether the number is prime Or not. ALGORITHM:
Page 26

Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 PROGRAM: //FIND THE GIVEN NUMBER IS PRIME OR NOT #include <stdio.h> main() { int num,i=2; printf(Enter the number...); scanf(%d,&num); while(i<=num-1) { if(num%i==0) { printf(The given number is not a prime number); break; } i++; } if(i==num) printf(The given number is a prime); } SAMPLE OUTPUT: Enter the number...5 The given number is a prime Start the program Enter the number set a loop up to number-1 Check the number is divide by any number other than one and the number itself If divide absolutely than print the number is not a prime If not divide other then one and itself then print the number is prime. Stop
30.AIM:
To write a program to find the reverse of the string. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 PROGRAM: Start the program Enter the string length Print the string length Enter the string character by character Pass the length of the string to the recursive function If the sting length is 1 then print the character If the string length is greater than one then reduces the string length by one and call the recursive function. Stop
Page 27

//REVERSE THE STRING USING THE RECURSION #include<stdio.h> main() { int len; void rev(); printf(Enter the string length); scanf(%d,&len); printf(\n%d,len); printf(\n); rev(len); printf(\n); } void rev(len) int len; { char c; if(len==1) { c=getchar(); c=getchar(); putchar(c); } else { c=getchar(); c=getchar(); rev(-len); putchar(c); } return; } SAMPLE OUTPUT: Enter the string length 4 4 A M A R R A M A
31.AIM:
To write a program to find the size of the data types. ALGORITHM:
PROGRAM: //TO FIND THE SIZE OF DATAS #include<stdio.h> main()
Page 28

{ int i=10; float f=25.005; char name[]=welcome; printf(\n The size of integer is %d,sizeof(i)); printf(\n The size of float is %d,sizeof(f)); printf(\n The size of character is %d,sizeof(name)); }
SAMPLE OUTPUT: The size of integer is...2 The size of float is... 4 The size of character is...8
32.AIM:
To find the sum and average of the given array ALGORITHM:
PROGRAM: //FIND THE SUM AND AVERAGE OF THE GIVEN NUMBERS #include<stdio.h> main() { int a[100],i,no,sum=0; float avg=0; printf(\nEnter the number of elements); scanf(%d,&no); printf(Enter the numbers); for(i=0;i<no;i++) { scanf(%d,&a[i]); sum=sum+a[i]; } avg=(float)sum/no; printf(sum=%d\naverage=%f,sum,avg); } Sample Output: Enter the number of elements5 Enter the numbers 1 2 3 4 5 sum=15 average=3.000000
33.AIM:
To write a program to convert the string into upper case
Page 29

ALGORITHM:
PROGRAM: //CONVERT THE LOWER CASE TO UPPER CASE LETTER #include<stdio.h> main() { int i=0; char str[100]; printf(Enter the string); scanf(%s,str); while(str[i]!=\0') { printf(%c,toupper(str[i])); i++; } } Sample Ouput Enter the string GuRu GURU
34.AIM:
To write a program to find the largest of the three numbers. ALGORITHM: Step-1 Step-2 Step-3 step-4 Step-5 Step-6 Step-7 Step-8 PROGRAM: //TO FIND THE LARGEST OF THE THREE NUMBERS #include<stdio.h> main() { int a,b,c,big; printf(Enter the three numbers); Start the program Enter the three numbers Assign large to first number Check the next number is greater then the large. If greater then assign large to next number Compare the next number with large Do the step-4 Print the larger value of the three number Stop
Page 30

scanf(%d %d %d,&a,&b,&c); big=a; if(big<b) big=b; else if (big<c) big=c; printf(The biggest of three number is %d,big); } SAMPLE OUTPUT: Enter the three numbers 93 43 23 The biggest of three number is 93
35.AIM:
To write a program to find the standard deviation of the given array. ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 PROGRAM: //COMPUTE STANDARD DEVIATION USING FUNCTION #include<stdio.h> #include<math.h> main() { int i,num; float dev,list[100]; float standev(); printf(\nEnter the size of the list); scanf(%d,&num); printf(\nEnter the elements of the list); for(i=0;i<num;i++) scanf(%f,&list[i]); printf(\nEntered elements are); for(i=0;i<num;i++) printf(\n%f,list[i]); dev=standev(list,num); printf(\n Standard Deviatiion of the list is %10.5f\n,dev); } float standev(float lis[100],int no) { int i; float mean,dev,sum=0.0; float avg(); Start the program Enter the array size Enter the elements of the array Print the Entered elements Call the function to calculate standard deviation Call the average function from the standard deviation function
Page 31

mean=avg(lis,no); printf(\n Mean of %3d elements is%10.2f\n,no,mean); for(i=0;i<no;i++) sum=sum+(mean-lis[i])*(mean-lis[i]); dev=sqrt(sum/(float)no); return(dev); } float avg(float l[100],int n) { int i; float sum=0.0; for(i=0;i<n;i++) sum=sum+l[i]; return(sum/(float)n); } Sample Output Enter the size of the list 5 Enter the elements of the list 1 2 3 4 5 Entered elements are 1.000000 2.000000 3.000000 4.000000 5.000000 Mean of 5 elements is 3.00 Standard Deviatiion of the list is 1.41421
36.AIM:
To write a menu driven program to find 1. Factorial of the given number 2. Prime number or not 3. Even number or Odd number 4. Exit ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 Step-11 Step-12 Start the program Enter the number Enter your choice using switch statement If you choose the choice 1. Find the factorial set a loop up to the entered number Calculate factorial fact=fact*I Print the factorial value If you choose the choice 2.Find whether the number is prime or not set a loop up to number-1 Check the number is divide by any number other than one and the number itself If divide absolutely then print the number is not a prime If not divide other than one and itself then print the number is prime
Page 32

Step-13 Step-14 Step-15 Step-16 Step-17 PROGRAM: // MENU DRIVEN PROGRAM #include<stdio.h> main() { int num,o,fact=1,i; while(1) { printf(\nEnter the number ); scanf(%d,&num); printf(\nchoose one of the options given below); printf(\n1.Factorial of the given number\n2.Prime number or not\n3.Odd or Even \n4.Exit); scanf(%d,&o); switch(o) { case 1: for(i=1;i<=num;i++) fact=fact*i; printf(The factorial of %d is %d,num,fact); break; case 3: if(num%2==0) printf(The given number is Even number); else printf(The given number is Odd number); break; case 2: i=2; while(i<=num-1) { if(num%i==0) { printf(The given number is not a prime number); break; } i++; } if(i==num) printf(The given number is a prime); break; default: exit(0); } } If you choose the choice 3. Find whether the number is odd or even If the number is divide by 2 then print the number is even If the number is not dividing by 2 then print the number is odd If you choose the choice 4.Exit the program Continue the program
Page 33

} SAMPLE OUTPUT: Enter the number .. 5 Choose one of the options given below 1. Factorial of the given number 2. Prime number or not 3. Odd or Even 4. Exit 1 The factorial of 5 is 120 Enter the number..5 Choose one of the options given below 1.Factorial of the given number 2.Prime number or not 3.Odd or Even 4.Exit 2 The given number is a prime Enter the number...5 Choose one of the options given below 1.Factorial of the given number 2.Prime number or not 3.Odd or Even 4.Exit 4
37. AIM :
To print Magic Suare numbers. Algorithm Step-1 Step-2 Step-3 Step-3.1 Step-3.1.1 Start the program Declare x, y and z variables as int data type. for i=1 to less than 10, x = x+ 1 for y:=z to less than or equal to 10, y =y+z for z = 10 to less than or equal to 100, z=z+10 print the Magic Square print x-z, x+z-y, x+y print x+y+z, x, x-y-z print x-y, x+y-z, x+z Stop the program
Step-4 PROGRAM
#include <stdio.h> #include<string.h> main ( ) { int x, y, z; for (x=0; x<=1; x+=2) for (y=0; y<=1; y+=2)
Page 34

for (z=9; z<=10; z+=10) { printf ("\n\n Magic Square %d\n\n", 3+x); printf ("%d\t%d\t%d\n",x-z,x+z-y,x+y); printf ("%d\t%d\t%d\n",x+y+z,x,x-y-z); printf ("%d\t%d\t%d\n",x-y,x+y-z,x+z); getch(); } } Sample output Magic Square -9 9 3 13 1 -11 -1 -7 11
38.AIM:
Program to print Triangle of Numbers. ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-5 Step-5.1 Step-5.1.1 Step-5.2 l Step-6 PROGRAM #include<stdio.h> main( ) { int i, j, k, l, n; printf("Type N-no of lines in triangle \n") ; scanf("%d",&n); l=1; for (i=1, j=n-i; i<=n; i++, j--) { for (k=1; k<=j; k++) printf(" "); for (k=1; k<=l; k++) printf(" %d", i); printf("\n") ; l+=2; } } Start the program Declare the variables i, j, k, l and n as int data type Read N numbers of lines in a triangle Initialize l=1 for i=1, j=n-i to less than or equal to n for k=1 to less than or equal to j print " " for k=1 to less than or equal to 1 print "i" is incremented by 2 Stop the program.
Page 35

SAMPLE OUTPUT Type N-no of lines in triangle 3 1 2 2 2 3 3 3 3 3
39.AIM:
Program to find whether a year is Leap year. ALGORITHM
PROGRAM #include<stdio.h> main() { int ye; printf ("Enter the year \n"); scanf("%d", &ye); if (ye%4==0) printf("It is a Leap Year \n"); else printf("It is Not a Leap Year\n"); } SAMPLE OUTPUT Enter the year 2000 It is a Leap Year
40. AIM:
Program to print the following Triangle. 5 4 5 3 4 5 2 3 4 5 1 2 3 4 5 ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-4.1 Step-5 PROGRAM #include<stdio.h> Start the program Declare i, j and n as int data type Read the number of lines for i=n to greater than or equal to 0 for j=i to less than n print y Stop the program
Page 36

main() { int i, j, n; printf("Enter number of lines\n"); scanf("%d", &n); printf("\n\n\n"); for (i=1;i<=n;i++) { for (j=1;j<=i;j++) printf("%-2d",j); printf("\n\n"); } } SAMPLE OUTPUT Enter number of lines 5 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5
41.AIM:
Write a program to read n numbers and find the maximum and the minimum. ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-5 Step-5.1 Step-6 Step-7 Step-7.1 Step-7.1.1 Step-7.2.1 Step-8 Step-9 PROGRAM #include<stdio.h> main () { int table[50], i, cnt, max, min; clrscr(); printf ("Enter number of elements in the array\n"); scanf("%d", &cnt); printf("Enter the elements\n"); Start the program Declare array table[50], i, cnt, max and min as int data type Enter the number of elements in the array Enter the elements into the array for i=1 to less than or equal to cnt Read the values from the console. Initialize max = min = table [1] for i=2 to less than or equal to cnt check if (max < table [i]) max = table [i] min = table[i] print maximum value and minimum value Stop the program
Page 37

for (i=1; i<=cnt; i++) scanf("%d", &table[i]); max = min = table[1]; for (i=2; i<=cnt; i++) { if (max<table[i]) max = table [i]; else if (min>table[i]) min = table[i]; } printf ("Maximum value = %d\n",max); printf ("Minimum value = %d",min); } SAMPLE OUTPUT Enter number of elements in the array 5 Enter the elements 1 4 2 3 5 Maximum value = 5 Minimum value = 1
42.AIM:
Program to find the determine of 2 2 matrix. ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-4.1 Step-4.1.1 Step-5 Step-6 Step-7 Step-7.1.1 Step-8 Step-8.1 Step-9 PROGRAM #include<stdio.h> main() { int a[2][2], d, i, j; printf ("Enter any 2x2 matrix\n"); for (i=0;i<2;i++) for (j=0;j<2;j++) scanf ("%d", &a[i][j]); d=a[0][0] * a[1][1] - a[0][1] * a[1][0]; printf ("--------------------------\n"); Start the program Declare a two-dimensional array a[2][2],d, i and j as int data type. Enter any 22 matrix for i=0 to less than 2 for j=0 to less than 2 Read a[i][j] Initialize d = a[0][0] * a[1][1] - a[0][1] * a[1][0]: print Determinant of matrix for i=0 to less than 2 print a[i][j] print The Determinant value is print d. Stop the program
Page 38

printf(" Matrix \n") ; printf ("--------------------------\n"); for (i=0;i<2;i++) { for (j=0;j<2;j++) printf("%-4d", a[i][j]); printf("\n"); } printf ("--------------------------\n"); printf ("\n The Determinant value is %-4d\n",d); }
SAMPLE OUTPUT Enter any 2x2 matrix 1 2 3 4 ---------------Matrix ---------------1 2 3 4 ---------------The Determinant value is -2
43. AIM:
Program to check whether a matrix is an upper triangular. ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-5 Step-5.1 Step-5.1.1 Step-6 Step-6.1 Step-6.1.1 Step-6.1.2 Step-7 Step-7.1 Step-8 PROGRAM #include<stdio.h> Start the program Declare a two dimensional array a[10][10], i, j, m, n and flag=1 as int data type. Enter the order of matrix Enter the matrix rowwise for i=0 to less than or equal to m for j=0 to less than or equal to n Read a [i][j] for i=0 to less than or equal to m for j=0 to less than or equal to n check if (a[i][j]!=0) Print The given matrix is not an upper triangular Initialize flag=0 Check if (flag) print The given matrix is an upper triangular Stop the program.
Page 39

main() { int i,j,a[10][10],m,n,flag=1; printf("Enter the order of the matrix (m,n)....."); scanf("%d%d", &m, &n); printf("\nEnter the matrix row wise....."); for (i=0; i<m; i++) for (j=0; j<n; j++) scanf("%d", &a[i][j]); for (i=0; i<m; i++) for (j=0; j<n; j++) { if (a[i][j]!= 0) printf("\n\n The given matrix is not an upper triangular"); flag = 0; break; } if (flag) printf("\n\n The given matrix is an upper triangular"); } SAMPLE OUTPUT Enter the order of the matrix (m,n).....3 3 Enter the matrix row wise..... 1 2 3 4 5 6 7 8 9 The given matrix is not an upper triangular
44.
AIM:
Program to demonistrate Macros with arguments.
ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-9.1 Step-10 Step-10.1 Step-11 Step-12 Start the program Define square(x) as ((x)*(x)) Define for-loop loop (index, max) as for (index=0; index<max; index+i) Define maximum of two max(x,y) as ((x) (y)) ? (x):(y)) Declare two arrays vec[10], sq[10], a, b, i, n and large as int data type print Program to compute print 1. Largest element in the Array print 2. Square of each array element Read Size of the Array Enter elements of the Array Macro calling loop (i, n) Read the elements and stored in the array vec(i) To display array elements by calling macro loop (i, n) print the vec(i) Initialize large=0 Call macro loop (i, n)
Page 40

Step-12.1 Step-13 Step-14 Step-15 PROGRAM #include<stdio.h> #define square(x) ((x)*(x)) #define loop(index, max) for(index=0; index < max; index++) #define max(x, y) (((x)>(y))? (x):(y)) main() { int a, b, i=0, n, large, vec[10], sq[10]; printf("Program to compute : \n"); printf("1. largest element in the array.\n"); printf("2. square of each array element.\n\n"); printf("Enter Size of the array..... "); scanf("%d", &n); printf("\nEnter %d elements of the array\n", n); loop(i,n) scanf ("%d", &vec[i]); loop(i, n) printf("%5d", vec[i]); large =0; loop(i,n) { sq[i] = square(vec[i]); large = max(large, vec[i]); } printf("\n\nLargest array element is : %5d", large); printf("\nElement Square \n"); printf ("----------------- \n"); loop(i,n) printf("%5d %8d\n", vec[i], sq[i]); } SAMPLE OUTPUT Program to compute : 1. largest element in the array. 2. square of each array element. Enter Size of the array..... 5 Enter 5 elements of the array 1 2 3 4 5 1 2 3 4 5 Largest array element is : 5 Element Square ------------------------1 1 2 4 3 9 Compute Sq[i]=Square (vec[i]) Large=max (large, vec(i)) print Largest array element print Element and its Square Stop the program.
Page 41

4 5 16 25
45. AIM:
Program to delete duplicates in a Vector ALGORITHM Step-1 Step-2 Start the program Declare the variables i, j, k, n, num and flag=0 and declare array a(50) as Float data type. Step-3 Enter the size of vector Step-4 Initialize num=n Step-5 Enter vector elements Step-5.1 for i=0 to less than n Read a[i] Step-6 Print vector elements Step-6.1 for i=0 to less than n print a[i] Step-7 Removing duplicates Step-7.1 for i=0 to less than n-1 Step-7.1.1 for j = i+1 to less than n Step-7.1.1 Check if (a[i]=a[j]) n=n-1 Step-7.1.1 flag = 1 Step-7.1.1 j = j-1 Step-8 Check if (flag==0) Print No duplicates found in vector Step-9 Else Print Vector has no. of duplicates and print it Step-10 Print Vector after deleting duplicates Step-10.1 for i=0 to less than n printa[i] Step-11 Stop the program. PROGRAM #include<stdio.h> main() { int i,j,k,n, num, flag=0; float a[50]; printf("Size of vector?"); scanf("%d", &n); num = n; printf("\nEnter Vector elements ?\n"); for (i=0; i<n; i++) scanf("%f", &a[i]); for (i=0; i<n-1; i++) for (j=i+1; j<n; j++) { if (a[i]==a[j]) { n=n-1; for (k = j; k < n; k++) a[k] = a[k+1];
Page 42

flag = 1; j--; } } if (flag==0) printf("\nNo duplicates found in vector \n"); else { if((num-n)==1) { printf("\nVector has only one duplicate\n"); printf("Vector after deleting duplicates : \n"); for (i=0;i<n;i++) printf("%6.2f", a[i]); } else { printf("\nVector has %d duplicates \n\n", num-n); printf("Vector after deleting duplicates : \n"); for (i=0;i<n;i++) printf("%6.2f", a[i]); } } } SAMPLE OUTPUT Size of vector? 5 Enter Vector elements ? 1 2 3 2 2 Vector has 2 duplicates Vector after deleting duplicates : 1.00 2.00 3.00
46. AIM:
Program to insert an element into the Vector ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 Step-11 Start the program Declare the variables i, j, k, n and pos as int and a[50], item as float data type. Enter the size of vector Enter the elements into the vector Step-4.1 for i=0 to less than n Read and stored in a[i] for i=0 to less than n Step-5.1 Print the vector elements a[i] Read the element to be inserted and print Enter the position of insertion Increment n by 1 for k=n to greater than or equal to pos Step-9.1 a[k] = a[k-1] a[--pos] = item print Vector after insertion
Page 43

Step-12 Step-13 PROGRAM #include<stdio.h> main() { int i,k,n, pos; float a[50], item; printf("Enter Size of Array : "); scanf("%d", &n); printf("\nEnter Array Elements : "); for (i=0; i<n; i++) scanf("%f", &a[i]); printf("\nEnter New Element to be Inserted : "); scanf("%f", &item); printf("\nEnter Position of Insertion : "); scanf("%d", &pos); n++; for (k=n;k>=pos;k--) a[k] = a[k-1]; a[--pos] = item; printf("\nArray of Elements after insertion :\n"); for (i=0;i<n; i++) printf("%10.2f",a[i]); } SAMPLE OUTPUT Enter Enter Enter Enter Array Size of Array : 5 Array Elements : 1 2 3 5 6 New Element to be Inserted : 4 Position of Insertion : 4 of Elements after insertion : 1.00 2.00 3.00 4.00 for i=0 to less than n Step-12.1 print a[i] Stop the Program
5.00
6.00
47. AIM:
Program to print the upper and lower Triangle of the matrix ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-4.1 Step-4.1.1 Step-5 Step-5.1 Start the program Declare a two dimensional array a[10][10], i, j, m and n as int data type. Enter the size of matrix and print that size Enter the elements into the matrix for i=0 to less than n for j = 0%y to less than m Read a[i][j] for i=0 to less than n for j=0 to less than m print a[i][j]
Page 44

Step-6 Step-6.1 Step-6.1.1 Step-6.1.2 Step-7 Step-7.1 Step-7.1.1 Step-7.1.2 Step-8 PROGRAM #include<stdio.h> main() { int a[10][10], i, j, m, n; printf("Enter Row and Column of the Matrix : "); scanf("%d %d", &n, &m); printf("\nEnter Elements of matrix : "); for(i=0; i<n; ++i) for(j=0; j<m; ++j) scanf("%d", &a[i][j]); printf("Lower Triangular Matrix :\n"); for(i=0; i<n; ++i) { for(j=0; j<m; ++j) { if(i>=j) printf("%5d",a[i][j]); if(i<j) printf (""); } printf("\n"); } printf("Upper Triangular Matrix :\n"); for(i=0; i<n; ++i) { for(j=0; j<m; ++j) { if (i<=j) printf ("%5d",a[i][j]); if (i>j) printf("") ; } printf("\n"); } } SAMPLE OUTPUT Enter Enter Lower 1 3 Upper 1 Row and Column of the Matrix : 2 2 Elements of matrix : 1 2 3 4 Triangular Matrix : 4 Triangular Matrix : 2 4 for i=0 to less than n for j=0 to less than m if (i<j) print if(i>j) print a[i][j] Lower Triangular Matrix for i=0 to less than n for j=0 to less than n check if (i<=j) Print The upper triangular matrix a[i][j] Check if (i>j) Print Stop
48. AIM:
WWW.PROFMARIAMICHAEL.COM Courtesy VRB Publishers Page 45

Program for Binary search using Recursion ALGORITHM: Step-1 Step-2 Step-3 Step-4 Step-5 Step-6 Step-7 Step-8 Step-9 Step-10 Step-11 Start the program Declare an array a[50], i, n and loc as int data type Declare bin( ) function as int data type Enter the size of matrix for i=0 to less than n Step-5.1 Read and placed in a[i] for i=0 to less than n Step-6.1 print a(i) Enter element to be searched Assign loc=bin(a,o,n) Check if (loc==0) Step-9.1 Print unsuccessful search %d not found else Step-10.1 Print Successful search found. Stop the program
Recursive Function Step-1 Step-2 Step-3 Step-3.1 Step-3.2 Step-3.2.1 Step-3.3 Step-3.3.1 Step-3.3.2 Step-3.4 Step-3.4.1 Step-4 Step-4.1 Step-5 PROGRAM #include<stdio.h> int key; main() { int a[50], i, n, loc; int bin(int *,int,int); printf("Enter the size of the array : "); scanf("%d", &n); printf("\nEnter Array elements (Ascending Order) :\n\n"); for (i=0; i<n; i++) scanf("%d", &a[i]); printf("\nEnter Element to be Searched : "); scanf("%d", &key); loc=bin(a,0,n); Global declaration of an array b(50) low and high Declare mid as static int of local declaration and i as int data type. mid=(low+high) check if (key<b(mid)) high = mid-1 bin(b, low, high) else if (key==b(mid)) low = mid+1 bin (b, low, high) else if (key==b(mid))) return(mid+1) else return(0) Stop the program.
Page 46

if(loc==0) printf("Unsuccessful search. %d not found. \n", key); else { printf("Successful search.\n"); printf("%d found at position %d. \n", key, loc); } } int bin(int b[],int low,int high) { static int mid; int i; if(low<=high) { mid=(low + high)/2; if(key<b[mid]) { high = mid-1; bin(b,low,high); } else if(key>b[mid]) { low = mid+1; bin(b,low,high); } else if(key==b[mid]) return(mid+1); } else return(0); } SAMPLE OUTPUT Enter the size of the array : 5 Enter Array elements (Ascending Order) : 1 2 3 4 5 Enter Element to be Searched : 4 Successful search. 4 found at position 4.
49.
AIM:
Program to Find substring of a given string
ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-4.1 Step-5 Step-6 Step-7 Start the program Declare mainstr[50], substr[50] as char data type and count, pos, i, j, len and num as int data type Enter the main string for len=0 to mainstr(len)!=\0 print Its length Enter the starting position of substring Enter number of characters in substring check if (pos<=0 or Count<=0 or pos>len)
Page 47

Step-7.1 Step-8 Step-8.1 Step-8.1.1 Step-8.1.2 Step-8.2 Step-8.2.1 Step-8.3 Step-8.4 Step-8.4.1 Step-8.4.2 Step-8.5 Step-9 PROGRAM #include<stdio.h> main() { char mainstr[50], substr[50]; int count, pos, i, j, len, num; printf("Enter the main string \n"); gets (mainstr); for (len = 0; mainstr[len] != '\0'; len++); printf ("It's length is : %d \n", len); printf("\nStarting position of substring ? \n"); scanf("%d", &pos); printf("\nNumber of Characters in substring ? \n"); scanf("%d", &count); if (pos <=0 || count <=0 || pos > len) printf ("\n\nExtracted string is EMPTY \n"); else { if (pos+count-1 > len) { printf("\n\nCharacters to be extracted exceed length \n"); num = len-pos+1; } else num = count; j=0; for (i=--pos;i<=pos+num-1; i++) { substr[j] = mainstr[i]; j++; } substr[j]='\0'; printf("\n\nSubstring is : %s\n", substr); } getch(); } print Entracted string is Empty else if (pos+count>len) print Characters to be extracted exceed Length number = len-pos+1 else num=count j=0 for i = --pos to less than or equal to pos+num-1 substr[j] = mainstr[i] j = j+1 print Substring Stop the program
Page 48

SAMPLE OUTPUT Enter the main string muni rathnam It's length is : 12 Starting position of substring ? 1 Number of Characters in substring ? 4 Substring is : muni 50.
AIM:
Program to Replace A portion of string ALGORITHM Step-1 Step-2 Step-3 Step-4 Step-4.1 Step-5 Step-6 Step-7 Step-8 Step-8.1 Step-9 Step-9.1 Step-9.1.1 Step-9.2 Step-10 Step-10.1 Step-10.2 Step-10.3 Step-10.3.1 Step-10.3.2 Step-10.4 Step-10.5 Step-10.6 Step-10.6.1 Step-10.6.2 Step-10.7 Step-10.8 Step-11 Step-12 Start the program Declare mainstr[50], repstr[50], save[50] as Char data type and i, j, k, pos, num, last, last, len1, len2, len as int data type. Enter the main string. for len1=0 to mainstr[len1]! = \0 Print The length of the string Enter position from where it is to be replaced Enter number of characters to be replaced Enter replacing string for (len2=0 to repstr(len2)! = \0 print the length; len2 Check if (pos>len1) for (i=0) to less than len2 mainstr[len1+i-1] = repstr[i] len = len1+len2 else last = pos + len2-1 j = 0 for i = pos+num-1 to less than len1 save[j] = mainstr[i] j++ len = j j = 0 for i = --pos to less than last mainstr[i] = repstr[j] j++ for i=0 to less than len Step-10.7.1 mainstr[last] = save[i] Step-10.7.2 Last++ for i = last to less than len1 Step-10.8.1 mainstr[i] = Print REPLACED String Stop the program
PROGRAM #include<stdio.h> main()
Page 49

{ char mainstr[50], repstr[50], save[50]; int i, j, k, pos, num, last, len1, len2, len; printf("Enter main string : "); scanf("%[^\n]", mainstr); for(len1=0; mainstr[len1] != '\0'; len1++); printf("\nLength is %d\n", len1); printf("\nPosition from where it is to be replaced ? : "); scanf("%d", &pos); printf("\n\nNumber of characters to be replaced? : "); scanf("%d", &num); printf("\n\nEnter replacement string : "); %s", repstr); for (len2=0; repstr[len2] != '\0'; len2++); printf("\nLength is %d \n", len2); if (pos > len) { for (i=0; i<len2; i++) mainstr[len1+i-1] = repstr[i]; len = len1 + len2; } else { last = pos + len2 - 1; j = 0; for (i = pos + num - 1; i<len1; i++) { save[j] = mainstr[i]; j++; } len = j; j = 0; for (i=--pos; i<last; i++) { mainstr[i] = repstr[j]; j++; } for (i=0; i<len; i++) { mainstr[last] = save[i]; last++; } for (i = last; i<len1; i++) mainstr[i]=' '; } printf("\n"); printf ("REPLACED string is : %s", mainstr); printf("\n"); } SAMPLE OUTPUT
Page 50

Enter main string : muni rathnam Length is 12 Position from where it is to be replaced ? : 1 Number of characters to be replaced? : 4 Enter replacement string : mani Length is 4 REPLACED string is : mani rathnam
Page 51

Ge2115 - Computer Practice Lab - Practice Programs: Courtesy VRB Publishers

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Ge2115 - Computer Practice Lab - Practice Programs: Courtesy VRB Publishers

Hochgeladen von

Copyright:

Verfügbare Formate

GE2115 -COMPUTER PRACTICE LAB PRACTICE PROGRAMS

Step-4 Step-5 PROGRAM:

Courtesy VRB Publishers