WAP 10. WAP 11. WAP 12. WAP 13. WAP 14. WAP 15. WAP 16. WAP 1. : 17. WAP 18. WAP 19. WAP 20. WAP 21. WAP 22. WAP 23. WAP & 24. WAP

Size: px

Start display at page:

Download "WAP 10. WAP 11. WAP 12. WAP 13. WAP 14. WAP 15. WAP 16. WAP 1. : 17. WAP 18. WAP 19. WAP 20. WAP 21. WAP 22. WAP 23. WAP & 24. WAP"

Daniella Anderson
6 years ago
Views:

1 Contents 1. WAP to accept the value from the user and exchange the values WAP to check whether the number is even or odd WAP to Check Odd or Even Using Conditional Operator WAP to Check Whether a Number is Positive or Negative WAP check if a Number is Positive or Negative Using Nested if WAP to Check Leap Year WAP to check whether the given integer is a Palindrome WAP to find the Largest number among Three Numbers WAP using switch case to perform addition multiplication subtraction and division operation WAP to print multiplication table WAP to count number of digits in an integer WAP to count the number of vowels, consonants WAP to print fibonacci sequence WAP to print factors of a positive integer WAP to Find Factorial of a Number WAP to make a pyramid with numbers increased by 1. The pattern is as follows : WAP to accept the string from the user and print it WAP to compare two strings WAP to display largest element of an array WAP to add two matrix using multi-dimensional arrays WAP to multiply to matrix using multi-dimensional arrays WAP to find transpose of a matrix WAP to accept two Strings & Compare them WAP to find the Fibonacci number using recursion Anuradha Bhatia 1

2 1. WAP to accept the value from the user and exchange the values. int num1, num2, temp; printf("enter first number: "); scanf("%d", &num1); printf("enter second number: "); scanf("%d",&num2); temp = num1; num1 = num2; num2 = temp; printf("\nafter swapping, firstnumber = %d\n", num1); printf("after swapping, secondnumber = %d", num2); 2. WAP to check whether the number is even or odd. int number; printf("enter an integer: "); scanf("%d", &number); // True if the number is perfectly divisible by 2 if(number % 2 == 0) printf("%d is even.", number); printf("%d is odd.", number); Anuradha Bhatia 2

3 3. WAP to Check Odd or Even Using Conditional Operator int number; printf("enter an integer: "); scanf("%d", &number); (number % 2 == 0)? printf("%d is even.", number) : printf("%d is odd.", number); 4. WAP to Check Whether a Number is Positive or Negative int number; printf("enter a number: "); scanf("%d", &number); if (number <= 0) if (number == 0) printf("you entered 0."); printf("you entered a negative number."); printf("you entered a positive number."); Anuradha Bhatia 3

4 5. WAP check if a Number is Positive or Negative Using Nested if... int number; printf("enter a number: "); scanf("%d", &number); if (number < 0) printf("you entered a negative number."); if ( number > 0) printf("you entered a positive number."); printf("you entered 0."); 6. WAP to Check Leap Year int year; printf("enter a year: "); scanf("%d",&year); if(year%4 == 0) if( year%100 == 0) if ( year%400 == 0) printf("%d is a leap year.", year); printf("%d is not a leap year.", year); printf("%d is a leap year.", year ); Anuradha Bhatia 4

5 printf("%d is not a leap year.", year); 7. WAP to check whether the given integer is a Palindrome int n, rev = 0, rem, num; printf("enter an integer: "); scanf("%d", &n); num = n; while( n!=0 ) rem = n%10; rev = rev*10 + rem; n /= 10; if (num == rev) printf("%d is a palindrome.", num); printf("%d is not a palindrome.", num); 8. WAP to find the Largest number among Three Numbers int n1, n2, n3; printf("enter three different numbers: "); scanf("%d %d %d", &n1, &n2, &n3); if( n1>=n2 && n1>=n3 ) printf("%d is the largest number.", n1); Anuradha Bhatia 5

6 if( n2>=n1 && n2>=n3 ) printf("%d is the largest number.", n2); if( n3>=n1 && n3>=n2 ) printf("%d is the largest number.", n3); 9. WAP using switch case to perform addition multiplication subtraction and division operation #include<stdio.h> #include<conio.h> int choice, a, b; int sum, div, mul, sub; char c= 'y'; while(c=='y') printf("\naddition -> 1\nSubtraction -> 2 \nmultiplication -> 3 \ndivision -> 4\n"); printf("\aenter your choice of operation to perform -: \n"); scanf("%d",& choice); printf("\a\nenter two number :- \n"); scanf("%d%d",&a,&b); switch(choice) case 1: sum = a + b; printf("\a\n Sum = %d", sum); break; case 2: sub = a - b; printf("\a\n Difference = %d", sub); break; case 3: mul = a * b; printf("\a\n Multiplication = %d", mul); break; case 4: div = a - b; Anuradha Bhatia 6

7 printf("\a\n Division = %d", div); break; default : printf("\awrong CHOICE"); printf("\ndo you want to continue [y / n]"); c=getch(); getch(); 10. WAP to print multiplication table. int n, i; printf("enter an integer: "); scanf("%d",&n); for(i=1; i<=10; ++i) printf("%d * %d = %d \n", n, i, n*i); 11. WAP to count number of digits in an integer long long n; int count = 0; printf("enter an integer: "); scanf("%lld", &n); while(n!= 0) // n = n/10 ++count; Anuradha Bhatia 7

8 printf("number of digits: %d", count); 12. WAP to count the number of vowels, consonants. char line[150]; int i, vowels, consonants, digits, spaces; vowels = consonants = digits = spaces = 0; printf("enter a line of string: "); scanf("%[^\n]", line); for(i=0; line[i]!='\0'; ++i) if(line[i]=='a' line[i]=='e' line[i]=='i' line[i]=='o' line[i]=='u' line[i]=='a' line[i]=='e' line[i]=='i' line[i]=='o' line[i]=='u') ++vowels; if((line[i]>='a'&& line[i]<='z') (line[i]>='a'&& line[i]<='z')) ++consonants; if(line[i]>='0' && line[i]<='9') ++digits; if (line[i]==' ') ++spaces; printf("vowels: %d",vowels); Anuradha Bhatia 8

9 printf("\nconsonants: %d",consonants); printf("\ndigits: %d",digits); printf("\nwhite spaces: %d", spaces); 13. WAP to print fibonacci sequence int i, n, t1 = 0, t2 = 1, nextterm; printf("enter the number of terms: "); scanf("%d", &n); printf("fibonacci Series: "); for (i = 1; i <= n; ++i) printf("%d, ", t1); nextterm = t1 + t2; t1 = t2; t2 = nextterm; 14. WAP to print factors of a positive integer int number, i; printf("enter a positive integer: "); scanf("%d",&number); printf("factors of %d are: ", number); for(i=1; i <= number; ++i) if (number%i == 0) Anuradha Bhatia 9

10 printf("%d ",i); 15. WAP to Find Factorial of a Number int n, i; unsigned long long factorial = 1; printf("enter an integer: "); scanf("%d",&n); // show error if the user enters a negative integer if (n < 0) printf("error! Factorial of a negative number doesn't exist."); for(i=1; i<=n; ++i) factorial *= i; // factorial = factorial*i; printf("factorial of %d = %llu", n, factorial); Anuradha Bhatia 10

11 16. WAP to make a pyramid with numbers increased by 1. The pattern is as follows : void main() int i,j,gap, rows, k,t=1; printf("input number of rows : "); scanf("%d",&rows); gap=rows+ 4-1; for(i=1;i<=rows; i++) for(k= gap;k>=1;k--) printf(" "); for(j=1;j<=i;j++) printf("%d ",t++); printf("\n"); gap--; Anuradha Bhatia 11

12 17. WAP to accept the string from the user and print it. char array[100]; printf("enter a string\n"); scanf("%s", array); printf("you entered the string %s\n",array); 18. WAP to compare two strings. #include <string.h> char a[100], b[100]; printf("enter the first string\n"); gets(a); printf("enter the second string\n"); gets(b); if (strcmp(a,b) == 0) printf("entered strings are equal.\n"); printf("entered strings are not equal.\n"); Anuradha Bhatia 12

13 19. WAP to display largest element of an array int i, n; float arr[100]; printf("enter total number of elements(1 to 100): "); scanf("%d", &n); printf("\n"); // Stores number entered by the user for(i = 0; i < n; ++i) printf("enter Number %d: ", i+1); scanf("%f", &arr[i]); // Loop to store largest number to arr[0] for(i = 1; i < n; ++i) // Change < to > if you want to find the smallest element if(arr[0] < arr[i]) arr[0] = arr[i]; printf("largest element = %.2f", arr[0]); 20. WAP to add two matrix using multi-dimensional arrays. int r, c, a[100][100], b[100][100], sum[100][100], i, j; printf("enter number of rows (between 1 and 100): "); scanf("%d", &r); printf("enter number of columns (between 1 and 100): "); scanf("%d", &c); printf("\nenter elements of 1st matrix:\n"); for(i=0; i<r; ++i) Anuradha Bhatia 13

14 for(j=0; j<c; ++j) printf("enter element a%d%d: ",i+1,j+1); scanf("%d",&a[i][j]); printf("enter elements of 2nd matrix:\n"); for(i=0; i<r; ++i) for(j=0; j<c; ++j) printf("enter element a%d%d: ",i+1, j+1); scanf("%d", &b[i][j]); // Adding Two matrices for(i=0;i<r;++i) for(j=0;j<c;++j) sum[i][j]=a[i][j]+b[i][j]; // Displaying the result printf("\nsum of two matrix is: \n\n"); for(i=0;i<r;++i) for(j=0;j<c;++j) printf("%d ",sum[i][j]); if(j==c-1) printf("\n\n"); Anuradha Bhatia 14

15 21. WAP to multiply to matrix using multi-dimensional arrays. int a[10][10], b[10][10], result[10][10], r1, c1, r2, c2, i, j, k; printf("enter rows and column for first matrix: "); scanf("%d %d", &r1, &c1); printf("enter rows and column for second matrix: "); scanf("%d %d",&r2, &c2); // Column of first matrix should be equal to column of second matrix and while (c1!= r2) printf("error! column of first matrix not equal to row of second.\n\n"); printf("enter rows and column for first matrix: "); scanf("%d %d", &r1, &c1); printf("enter rows and column for second matrix: "); scanf("%d %d",&r2, &c2); // Storing elements of first matrix. printf("\nenter elements of matrix 1:\n"); for(i=0; i<r1; ++i) for(j=0; j<c1; ++j) printf("enter elements a%d%d: ",i+1, j+1); scanf("%d", &a[i][j]); // Storing elements of second matrix. printf("\nenter elements of matrix 2:\n"); for(i=0; i<r2; ++i) for(j=0; j<c2; ++j) printf("enter elements b%d%d: ",i+1, j+1); scanf("%d",&b[i][j]); // Initializing all elements of result matrix to 0 for(i=0; i<r1; ++i) for(j=0; j<c2; ++j) Anuradha Bhatia 15

16 result[i][j] = 0; // Multiplying matrices a and b and // storing result in result matrix for(i=0; i<r1; ++i) for(j=0; j<c2; ++j) for(k=0; k<c1; ++k) result[i][j]+=a[i][k]*b[k][j]; // Displaying the result printf("\noutput Matrix:\n"); for(i=0; i<r1; ++i) for(j=0; j<c2; ++j) printf("%d ", result[i][j]); if(j == c2-1) printf("\n\n"); 22. WAP to find transpose of a matrix int a[10][10], transpose[10][10], r, c, i, j; printf("enter rows and columns of matrix: "); scanf("%d %d", &r, &c); // Storing elements of the matrix printf("\nenter elements of matrix:\n"); for(i=0; i<r; ++i) for(j=0; j<c; ++j) printf("enter element a%d%d: ",i+1, j+1); Anuradha Bhatia 16

17 scanf("%d", &a[i][j]); // Displaying the matrix a[][] */ printf("\nentered Matrix: \n"); for(i=0; i<r; ++i) for(j=0; j<c; ++j) printf("%d ", a[i][j]); if (j == c-1) printf("\n\n"); // Finding the transpose of matrix a for(i=0; i<r; ++i) for(j=0; j<c; ++j) transpose[j][i] = a[i][j]; // Displaying the transpose of matrix a printf("\ntranspose of Matrix:\n"); for(i=0; i<c; ++i) for(j=0; j<r; ++j) printf("%d ",transpose[i][j]); if(j==r-1) printf("\n\n"); 23. WAP to accept two Strings & Compare them. void main() int count1 = 0, count2 = 0, flag = 0, i; char string1[10], string2[10]; Anuradha Bhatia 17

18 printf("enter a string:"); gets(string1); printf("enter another string:"); gets(string2); /* Count the number of characters in string1 */ while (string1[count1]!= '\0') count1++; /* Count the number of characters in string2 */ while (string2[count2]!= '\0') count2++; i = 0; while ((i < count1) && (i < count2)) if (string1[i] == string2[i]) i++; continue; if (string1[i] < string2[i]) flag = -1; break; if (string1[i] > string2[i]) flag = 1; break; if (flag == 0) printf("both strings are equal \n"); if (flag == 1) printf("string1 is greater than string2 \n", string1, string2); if (flag == -1) printf("string1 is less than string2 \n", string1, string2); Anuradha Bhatia 18

19 24. WAP to find the Fibonacci number using recursion. int fibo(int); int num; int result; printf("enter the nth number in fibonacci series: "); scanf("%d", &num); if (num < 0) printf("fibonacci of negative number is not possible.\n"); result = fibo(num); printf("the %d number in fibonacci series is %d\n", num, result); int fibo(int num) if (num == 0) if (num == 1) return 1; return(fibo(num - 1) + fibo(num - 2)); Anuradha Bhatia 19

BCSE1002: Computer Programming and Problem Solving LAB MANUAL

LABMANUAL BCSE1002: Computer Programming and Problem Solving LAB MANUAL L T P Course Type Semester Offered Academic Year 2018-2019 Slot Class Room Faculty Details: Name Website link Designation School