Programming in C Lab

Transcription

1 Programming in C Lab

2 1a. Write a program to find biggest number among given 3 numbers. ALGORITHM Step 1 : Start Start 2 : Input a, b, c Start 3 : if a > b goto step 4, otherwise goto step 5 Start 4 : if a > c goto step 6, otherwise goto step 8 Start 5 : if b > c goto step 7, otherwise goto step 8 Start 6 : Output "a is the largest", goto step 9 Start 7 : Output "b is the largest", goto step 9 Start 8 : Output " c is the largest", goto step 9 Start 9 : Stop FLOWCHART

3 PROGRAM #include <stdio.h> int main() double n1, n2, n3; printf("enter three different numbers: "); scanf("%lf %lf %lf", &n1, &n2, &n3); if( n1>=n2 && n1>=n3 ) printf("%.2f is the largest number.", n1); if( n2>=n1 && n2>=n3 ) printf("%.2f is the largest number.", n2); if( n3>=n1 && n3>=n2 ) printf("%.2f is the largest number.", n3); return 0; OUTPUTgcc 1a.c./a.out Enter three different numbers is the largest number

4 2a. Write a program to determine roots of quadratic equation of the form ax2+bx+c by checking the discriminant value using IF statement. The discriminant tells us whether there are two solutions, one solution, or no solutions. ALGORITHM Step 1: [Start] Begin Step 2: [Input the co-efficients of the quadratic equation Read a,b,c Step 3:[Check for the non-zero coefficient of a] If a = 0 then print Invalid input, go to step 2 Step 4: [Find the value of disc] disc = b * b 4 * a * c Step 5: [Find the type and the values of roots of a given quadratic equation] If (disc = 0) then Print The roots are equal root1 = root2 = -b / 2.0*a Go to step 6 Else If (disc > 0) then Print The roots are real and distinct root1 = (-b + sqrt(disc)) / 2.0*a root2 = (-b - sqrt(disc)) / 2.0*a Go to step 6 else Print The roots are imaginary root1 = -b / 2.0*a root2 = sqrt(fabs(disc)) / 2.0*a Step 6: [Output] Print root1, root2 Step 7: [Stop] End

5 FLOWCHART PROGRAM #include <stdio.h> #include<math.h> void main() int a,b,c,d; float x1,x2; printf("enter the value of a,b & c\n"); scanf("%d%d%d",&a,&b,&c); d=b*b-4*a*c; if(d==0)

6 printf("both roots are equal\n"); x1=-b/(2.0*a); x2=x1; printf("first  Root x1= %f\n",x1); printf("second Root x2= %f\n",x2); else if(d>0) printf("both roots are real and diff-2\n"); x1=(-b+sqrt(d))/(2*a); x2=(-b-sqrt(d))/(2*a); printf("first  Root x1= %f\n",x1); printf("second Root x2= %f\n",x2); else printf("root are imaginary\n No Solution \n"); OUTPUT Enter a, b and c of quadratic equation: Roots are real numbers. Roots of quadratic equation are: ,

7 3a. Write a program to demonstrate use of Switch-Case statement by choosing and displaying day- name when day-number is given as input. (Eg: 0 for Sunday, 1 for Monday, 2 for Tuesday...etc...). ALGORITHM Step 1: Input day number from user. Store it in some variable say week. Step 2: Switch the value of week i.e. use switch(week) and match with cases. Step 3: There can be 7 possible values(choices) of week i.e. 1 to 7. Therefore write 7 case inside switch. In addition, add default case as an else block. Step 4: For case 1: print "MONDAY", for case 2: print "TUESDAY" and so on. Print "SUNDAY" for case 7:. Step 5: If any case does not matches then, for default: case print "Invalid week number". FLOWCHART

8 PROGRAM #include <stdio.h> int main() int week; /* Input week number from user */ printf("enter week number(1-7): "); scanf("%d", &week); switch(week) case 1: printf("monday"); break; case 2: printf("tuesday"); break; case 3: printf("wednesday"); break; case 4: printf("thursday"); break; case 5: printf("friday"); break; case 6: printf("saturday"); break; case 7: printf("sunday"); break; default: printf("invalid input! Please enter week number between 1-7."); return 0; OUTPUT Enter week no 3

9 Wednesday 4a. Write a program to generate Prime numbers between 2 to a given number, N. ALGORITHM Step 1: Input N & M Step 2: While (N < M) I=2 Step 4: While (I<N) Step 5: IF N%I == 0 goto Step 7 Step 6: I++ Step 7: IF I==NUM Print NUM Step 7: N++ FLOWCHART PROGRAM

10 #include<stdio.h> void main() int n,i,fact,j; printf("enter the Number"); scanf("%d",&n); printf("prime Numbers are: \n"); for(i=1; i<=n; i++) fact=0; for(j=1; j<=n; j++) if(i%j==0) fact++; if(fact==2) printf("%d ",i); OUTPUT: Enter the Number50 Prime Numbers are:

11 5a. Write a program to determine following SIN series and find the difference between calculated series value and the value returned by built-in Sin(x) function. ALGORITHM Step 1 : Start Start 2 : Input x Start 3 : from i=1 to 10 Fact=1 Start 4 : for(j=1;j<=i+2;j++) fact=fact*j; sin=sin+(f*pow(x,i+2))/fact; Start 5 :go to step 3 Start 6 : Output sin x Start 7 : Stop FLOWCHART start read X for(i=1;i<10;i+=2) fact=1 i<10 for(j=1;j<=i+2;j++) fact=fact*j; sin=sin+(f*pow(x,i+2))/fact;

12 Print sin x Stop PROGRAM #include<stdio.h> #include<math.h> int main() float sin=0,x,fact; int i,j,f=-1; printf("enter x:"); scanf("%f",&x); for(i=1;i<10;i+=2) fact=1; for(j=1;j<=i+2;j++) fact=fact*j; sin=sin+(f*pow(x,i+2))/fact; if(f>0) f=-1; else f=1; printf("\n\nsinx=%f",x+sin); return 0; OUTPUT: $ gcc 5a.c -lm $./a.out Enter x:3 sinx=

13 6.a Write a program to store 10 elements in an array of numbers and search given number and its position in array. ALGORITHM Step 1 : Start Start 2 : Read array of elements Read element to be searched Found=0 Start 3 : from 0 to n position of the array search the array element=element to be searched Start 4 : if found found =1 else found =0 Start 5 ; if found=1 print the element else print element not found Start 6 : Stop

14 FLOWCHART

15 PROGRAM #include <stdio.h> #define MAX_SIZE 100 // Maximum array size int main() int arr[max_size]; int size, i, tosearch, found; /* Input size of array */ printf("enter size of array: "); scanf("%d", &size); /* Input elements of array */ printf("enter elements in array: "); for(i=0; i<size; i++) scanf("%d", &arr[i]); printf("\nenter element to search: "); scanf("%d", &tosearch); /* Assume that element does not exists in array */ found = 0; for(i=0; i<size; i++) /* * If element is found in array then raise found flag * and terminate from loop. */ if(arr[i] == tosearch) found = 1; break; /* * If element is not found in array */ if(found == 1) printf("\n%d is found at position %d", tosearch, i + 1);

16 else printf("\n%d is not found in the array", tosearch); return 0; OUTPUT: $ gcc 6a.c $./a.out Enter size of array: 6 Enter elements in array: Enter element to search: 8 8 is not found in the array

17 7.a Write a program to sort given random numbers into ascending order using arrays ALGORITHM Step 1: [Start] Begin Step 2: [Input the number of elements in the array] Read n Step 3: [Input the n integer numbers] For i -1 in steps of 1 Read End for Step 4: [Display the original array] For i 0 thru n-1 in steps of End for Step 5: [Repeat step 5 for i varies from 0 thru n-1] For i = 0 thru n-1 in steps of 1 For j = 0 thru n-i-1 in steps of 1 IF ( num[j] > num[j + 1] ) then temp= num[j] num[j] = num[j + 1] num[j+1] = temp End if End for End for Step 6: [Output the sorted array] For i 0 thru n-1 in steps of End for

18 FLOWCHART

19 PROGRAM #include <stdio.h> void main() int i, j, a, n, number[30]; printf("enter the value of N \n"); scanf("%d", &n); printf("enter the numbers \n"); for (i = 0; i < n; ++i) scanf("%d", &number[i]); for (i = 0; i < n; ++i) for (j = i + 1; j < n; ++j) if (number[i] > number[j]) a = number[i]; number[i] = number[j]; number[j] = a; printf("the numbers arranged in ascending order are given below \n"); for (i = 0; i < n; ++i) printf("%d\n", number[i]); OUTPUT: ~$ ^C ~$ ^C ~$ gcc 7a.c ~$./a.out Enter the value of N 5 Enter the numbers The numbers arranged in ascending order are given below

20 8.a Write a program to sort given strings in ascending or descending order. ALGORITHM Step 1: [Start] Begin Step 2: [Input the number of elements in the array] Read n Step 3: [Input string array] For i -1 in steps of 1 Read End for Step 4: [Display the original array] For i 0 thru n-1 in steps of End for Step 5: [Repeat step 5 for i varies from 0 thru n-1] For i = 0 thru n-1 in steps of 1 For j = 0 thru n-i-1 in steps of 1 IF ( num[j] > num[j + 1] ) then temp= num[j] num[j] = num[j + 1] num[j+1] = temp End if End for End for Step 6: [Output the sorted array] For i 0 thru n-1 in steps of End for

21 FLOWCHART PROGRAM #include <stdio.h> #include <string.h> void main()

22 char str[100],ch; int i,j,l; printf("\n\nsort a string array in ascending order :\n"); printf(" \n"); printf("input the string : \n"); fgets(str, sizeof str, stdin); l=strlen(str); /* sorting process */ for(i=1;i<=l;i++) for(j=0;j<l-i;j++) if(str[j]>str[j+1]) ch=str[j]; str[j] = str[j+1]; str[j+1]=ch; printf("after sorting the string appears like : \n"); printf("%s\n\n",str); OUTPUT: $ gcc 8a.c $./a.out Sort a string array in ascending order : Input the string : welcome to pda cse dept After sorting the string appears like : accddeeeelmooppsttw

23 9.a Write a program to print multiplication table of a given number. ALGORITHM Step 1:Start the process. Step 2:Input N, the number for which multiplication table is to be printed. Step 3: For T = 1 to 10 Step 4:Print M = N * T Step 5:End For Step 6: Stop the process FLOWCHART

24 PROGRAM #include <stdio.h> int main() int num, i = 1; printf("enter any Number:"); scanf("%d", &num); printf("multiplication table of %d: ", num); while (i <= 10) printf(" %d x %d = %d\n", num, i, num * i); i++; return 0; OUTPUT: ~$ gcc 9a.c ~$./a.out Enter any Number:9 Multiplication table of 9: 9 x 1 = 9 9 x 2 = 18 9 x 3 = 27 9 x 4 = 36 9 x 5 = 45 9 x 6 = 54 9 x 7 = 63 9 x 8 = 72 9 x 9 = 81 9 x 10 = 90

25 10.a Write a program to read elements of 3x3 matrix and print the elements in matrix form ALGORITHM Step 1: [Start] Begin Step 2: [Input the order of matrix A and matrix B] Read m, n, p, q Step 3: [Check whether two matrices are multplicable] If (n = p) then go to step 4 Else Print ( MULTIPLICATION NOT ALLOWED TRY AGAIN ) Go to step 2 End if Step 4: [Read matrix A] For i 0 thru m-1 in steps of 1 For j0 thru n-1 in steps of 1 Read A[ I ][ j ] End for End for Step 5: [Read matrix B] For i 0 thru p-1 in steps of 1 For j -1 in steps of 1 Read B[ I ][ j ] End for End for Step 7: [Output] Print A[m][n], B[p][q] Step 8: [Stop] End

26 FLOWCHART

27 PROGRAM #include <stdio.h> void main() int arr1[3][3],i,j; printf("\n\nread a 2D array of size 3x3 and print the matrix :\n"); printf(" \n"); /* Stored values into the array*/ printf("input elements in the matrix :\n"); for(i=0;i<3;i++) for(j=0;j<3;j++) printf("element - [%d],[%d] : ",i,j); scanf("%d",&arr1[i][j]); printf("\nthe matrix is : \n"); for(i=0;i<3;i++) printf("\n"); for(j=0;j<3;j++) printf("%d\t",arr1[i][j]); printf("\n\n");

28 OUTPUT: ~$ gedit 10b.c ~$ gcc 10b.c ~$./a.out Read a array of size 3x3 and print the matrix : Input elements in the matrix : element - [0],[0] : 1 element - [0],[1] : 2 element - [0],[2] : 3 element - [1],[0] : 4 element - [1],[1] : 5 element - [1],[2] : 65 element - [2],[0] : 67 element - [2],[1] : 78 element - [2],[2] : 98 The matrix is :

29 11a. Write a program to multiply two matrices and print input and output mattresses in matrix form ALGORITHM Matrix-Multiply(A, B) Step 1: if columns [A] rows [B] then error "incompatible dimensions" Step 2: else for i =1 to rows [A] for j = 1 to columns [B] C[i, j] =0 Step3: for k = 1 to columns [A] C[i, j]=c[i, j]+a[i, k]*b[k, j] Step 4: return C Step 5: Stop FLOWCHART

30 PROGRAM #include<stdio.h> int main() int m, n, p, q, c, d, k, sum = 0; int first[10][10], second[10][10], multiply[10][10]; printf("enter the number of rows and columns of first matrix\n"); scanf("%d%d", &m, &n); printf("enter the elements of first matrix\n"); for ( c = 0 ; c < m ; c++ ) for ( d = 0 ; d < n ; d++ ) scanf("%d", &first[c][d]); printf("enter the number of rows and columns of second matrix\n"); scanf("%d%d", &p, &q); if ( n!= p ) printf("matrices with entered orders can't be multiplied with each other.\n"); else printf("enter the elements of second matrix\n"); for ( c = 0 ; c < p ; c++ ) for ( d = 0 ; d < q ; d++ ) scanf("%d", &second[c][d]); for ( c = 0 ; c < m ; c++ ) for ( d = 0 ; d < q ; d++ ) for ( k = 0 ; k < p ; k++ ) sum = sum + first[c][k]*second[k][d]; multiply[c][d] = sum; sum = 0; printf("product of entered matrices:-\n"); for ( c = 0 ; c < m ; c++ ) for ( d = 0 ; d < q ; d++ ) printf("%d\t", multiply[c][d]); printf("\n");

31 return 0; OUTPUT Enter rows and columns of first matrix:3 3 Enter rows and columns of second matrix:3 3 Enter first matrix: Enter second matrix: The new matrix is:

32 12a. write a program to read a string and perform following operations on input string i. capitalise ii. find length iii. find last letter and first letter PROGRAMS CAPITALISE #include <stdio.h> void upper_string(char []); int main() char string[100]; printf("enter a string to convert it into upper case\n"); scanf(" %[^\n]s", string); upper_string(string); printf("the string in upper case: %s\n", string); return 0; void upper_string(char s[]) int c = 0; while (s[c]!= '\0') if (s[c] >= 'a' && s[c] <= 'z') s[c] = s[c] - 32; c++; FINDING LENGTH #include <stdio.h> int main() char s[1000], i; printf("enter a string: "); scanf("%s", s); for(i = 0; s[i]!= '\0'; ++i);

33 printf("length of string: %d", i); return 0; FIND FIRST AND LAST LETTER #include<stdio.h> #include<string.h> void main() int i, count = 0, pos1, pos2; char str[50], key, a[10]; printf("enter the string\n"); scanf(" %[^\n]s", str); printf("enter character to be searched\n"); scanf(" %c", &key); for (i = 0;i <= strlen(str);i++) if (key == str[i]) count++; if (count == 1) pos1 = i; pos2 = i; printf("%d\n", pos1 + 1); else pos2 = i; printf("%d\n", pos2 + 1);

34 13.a) Write a program to determine factorial of a numbers using recursion techniques ALGORITHM: Step 1: Start Step 2: Read number n Step 3: Call factorial(n) Step 4: Print factorial f Step 5: Stop factorial(n) Step 1: If n==1 then return 1 Step 2: Else f=n*factorial(n-1) Step 3: Return f FLOWCHART:

35 PROGRAM #include <stdio.h> long int multiplynumbers(int n); int main() int n; printf("enter a positive integer: "); scanf("%d", &n); printf("factorial of %d = %ld", n, multiplynumbers(n)); return 0; long int multiplynumbers(int n) if (n >= 1) return n*multiplynumbers(n-1); else return 1; OUTPUT Enter a positive integer: 6 Factorial of 6 = 720

36 14.a) Write a program to read values of three numbers a b c print the values of using pointers and print their memory addresses ALGORITHM: Step 1: Read a,b,c Step 2: [Assign the Address of a to pointer p, b to q, c to r] P=&a; Q=&b; R=&c; Step 3: Print The Value and address of A= *p, p; Print The Value and address of B= *q, q; Print The Value and address of c= *r, r; Stop FLOWCHART Start Read a, b, c p=&a; q=&b; r=&c Print the values and addresses of a,b,c Stop PROGRAM #include<stdio.h> int main()

37 int arr[10]; int *pa; //declare integer array //declare an integer pointer int i; pa=&arr[0]; //assign base address of array printf("enter array elements:\n"); for(i=0;i < 10; i++) printf("enter element %02d: ",i+1); scanf("%d",pa+i); //reading through pointer printf("\nentered array elements are:"); printf("\naddress\t\tvalue\n"); for(i=0;i<10;i++) printf("%08x\t%03d\n",(pa+i),*(pa+i)); return 0; OUTPUT

38 15.a) write a program to read 10 numbers and find sum of all elements of Array access the values of Array using integer pointer with pointer arithmetic ALGORITHM: Step1: Start Step 2: Declare variable Step 3: Take input numbers Step 4: Copy base address of array to pointer variable Step 5: Read array element from one by one Step 6: Calculate Sum Step 7: Array ends then top Start Step 8: Print sum of elements in array Step 9: stop FLOWCHART: Read array[] ptr=array i=0 to10 in steps of 1 sum = sum + *ptr; ptr++; Print sum Stop

39 PROGRAM #include <stdio.h> #include <malloc.h> void main() int i,n,sum=0; int *a; printf("enter the size of array A\n"); scanf("%d", &n); a=(int *) malloc(n*sizeof(int)); /*Dynamix Memory Allocation */ printf("enter Elements of First List\n"); for(i=0;i<n;i++) scanf("%d",a+i); /*Compute the sum of all elements in the given array*/ for(i=0;i<n;i++) sum = sum + *(a+i); printf("sum of all elements in array = %d\n", sum); OUTPUT

40 16a. Create a text file by name my data.txt and store a given file of text into created text file. ALGORITHM FLOWCHART PROGRAMS #include <stdio.h> void main() FILE *fptr; char name[20]; int age; float salary; /* open for writing */ fptr = fopen("emp.rec", "w"); if (fptr == NULL) printf("file does not exists \n");

41 return; printf("enter the name \n"); scanf("%s", name); fprintf(fptr, "Name = %s\n", name); printf("enter the age\n"); scanf("%d", &age); fprintf(fptr, "Age = %d\n", age); printf("enter the salary\n"); scanf("%f", &salary); fprintf(fptr, "Salary = %.2f\n", salary); fclose(fptr);