diff --git a/PPS (1).html b/PPS (1).html new file mode 100644 index 0000000..e86ef74 --- /dev/null +++ b/PPS (1).html @@ -0,0 +1,778 @@ + + + + + + + + + + + + + PPS - CodiMD + + + + + + + + + + + + + + + + + + +

PPS

My Details

Name - khushboo kumari
+CRN -1915325
+Branch - CSE

1) To print name using puts.

/* Program to print your name */

#include<stdio.h>
+int main() {

puts(“");
+puts(“khushboo kashyap”);
+puts("
”);

return 0;
+output:

##2) To print College address

/* College Address */

#include<stdio.h>
+int main() {

printf("\n\t\t\tGuru Nanak Dev Engineering College,");
+printf("\n\t\t\tGill Road,");
+printf("\n\t\t\tLudhiana , Punjab");

return 0;
+}
+output:

3) Program to add two integers .

/* To add two integers */

#include <stdio.h>
+int main() {

int a,b;

printf("\nEnter the numbers…");

printf("\nA:");
+scanf("%d",&a);

printf("\nB:");
+scanf("%d",&b);

a=a+b;

printf("\n Sum of the number is %d ",a);

return 0;

}
+output:

4) Program to find quotient and remainder.

/* To find quotient and remainder */

#include <stdio.h>

int main() {

int a,b,r,q;

printf("\nEnter the Dividend:");
+scanf("%d",&a);

printf("\nEnter the divisor:");
+scanf("%d",&b);

r=a%b;
+q=a/b;

printf("\nRemainder: %d",r);
+printf("\nQuotient: %d",q);

return 0;
+}
+output:

5) Program to swap two variables without 3rd variable.

/* Swapping without 3rd variable */

#include <stdio.h>
+int main() {

int a,b;

printf("\nEnter the value of A:");
+scanf("%d",&a);

printf("\nEnter the value of B:");
+scanf("%d",&b);

a = a + b;
+b = a - b;
+a = a - b;

printf("\nA: %d",a);
+printf("\nB: %d",b);

return 0;
+}
+output:

6) Program to check even odd number.

/* To find whether number is even or odd */

#include<stdio.h>
+int main() {

int num,temp;

printf(“Enter the Number:”);
+scanf("%d",&num);

if(num%2==0)
+printf("\nNumber is Even…");

else
+printf("\nNumber is Odd…");

printf("\n\n");
+return 0;
+}
+ouyput:

7) Finding greteast of two numbers.

/* Largest one in two */

#include<stdio.h>

int main() {
+int a,b;
+printf(“Enter any two number(A and B): “);
+scanf(”%d%d”, &a, &b);

if(a>b)
+printf("\nA is largest…");
+else
+printf("\nB is largest…");

return 0;
+}
+output:

8) Find greatest of three number .

/* Largest of three number */

#include<stdio.h>
+int main() {
+int x, y, z, large;

printf(" Enter any three integer numbers for x, y, z : ") ;

scanf("%d %d %d", &x, &y, &z) ;

large = (x > y ? ( x > z ? x : z) : (y > z ? y : z)) ;

printf("\n\n Largest or biggest or greatest or maximum among 3 numbers using Conditional ternary Operator : %d", large) ;

return 0;
+}
+output:

9) Program to assign grade to student according to percentage.

/* To find grade of a student by marks */

#include<stdio.h>
+int main() {

int s1,s2,s3,s4,s5,agg;
+float perc;

printf(“Enter the Marks in 5 Subjects Respectively:\n”);

scanf("%d%d%d%d%d",&s1,&s2,&s3,&s4,&s5);

agg=s1+s2+s3+s4+s5; // Aggregate Marks

perc=agg/500.0*100; // Perc Marks

if(perc>=90)
+{
+printf("\nA");

}

else if (perc>=80 && perc<90)
+{
+printf("\nB");

}

else if(perc>=70 && perc<80)
+{
+printf("\nC");

}

else if(perc>=60 && perc<70)
+{
+printf("\nD");
+}
+else if(perc>=50 && perc<60)
+{
+printf("\nE");
+}
+else
+{
+printf("\nScope of Improvement…");
+}
+return 0;
+}
+output:
+

11) Program to check year is leap or not.

/* To find whether year is leap or not */

#include<stdio.h>
+int main() {

int year,temp;

printf(“Enter teh year:”);
+scanf("%d",&year);

temp=year%4;

if(year%1000)
+{
+if(year%400
0)
+printf("\nLeap year…");
+}

else
+{
+if(year%4==0)
+printf("\nLeap year…");

else
+printf("\nNot a Leap year…");
+}

return 0;
+}
+output:

12) Program to print table of 5.

/* Table of 5 */

#include<stdio.h>

int main() { int res;

for(int i=1;i<=10;i++) {

res=5*i;

printf("\n5*%d=%d",i,res);
+}

return 0;
+}
+output:

13) To make simple calculator using switch case.

/* C Program to Create Simple Calculator using Switch Case */

#include <stdio.h>

int main() {
+char Operator;
+float num1, num2, result = 0;

printf("\n Please Enter an Operator (+, -, *, /) : “);
+scanf(”%c", &Operator);

printf("\n Please Enter the Values for two Operands: num1 and num2 : “);
+scanf(”%f%f", &num1, &num2);

switch(Operator)
+{
+case ‘+’:
+result = num1 + num2;
+break;
+case ‘-’:
+result = num1 - num2;
+break;
+case ‘*’:
+result = num1 * num2;
+break;
+case ‘/’:
+result = num1 / num2;
+break;
+default:
+printf("\n You have enetered an Invalid Operator ");
+}

printf("\n The result of %.2f %c %.2f = %.2f", num1, Operator, num2, result);

return 0;
+}
+output:

14) To calculate reverse of a number.

/* To find reverse of a Number*/

#include<stdio.h>
+int main() {

int num,rev=0;

printf("\nEnter the Number:");
+scanf("%ld",&num);

while(num!=0)
+{
+rev = rev * 10;
+rev = rev + num%10;
+num = num/10;
+}

printf("\nReversed number:%d",rev);

printf("\n\n");
+return 0;
+}
+output:

15) To check whether number is palindrome or not.

/* Palindrome */

#include<stdio.h>
+int main() {

int n,rev=0,check,rem;

printf("\nEnter the number:");
+scanf("%d",&n);
+check=n;

while( n!=0 )
+{
+rem = n%10;
+rev = rev*10 + rem;
+n /= 10;
+}

if(rev==check)
+printf("\nReversed number is equal to entered number…");

else
+printf("\nReversed number is not equal to entered number…");

printf("\n\n");
+return 0;
+}
+output:

16) To check whether a number is prime or not.

/* Program to check prime no. */

#include <stdio.h>
+#include <stdlib.h>

int main() {

int num, j, flag;

printf(“Enter a number \n”);
+scanf("%d", &num);

if (num <= 1)
+{
+printf("%d is not a prime numbers \n", num);
+exit(1);
+}
+flag = 0;
+for (j = 2; j <= num / 2; j++)
+{
+if ((num % j) == 0)
+{
+flag = 1;
+break;
+}
+}
+if (flag == 0)
+printf("%d is a prime number \n", num);
+else
+printf("%d is not a prime number \n", num);

return 0;

}
+output:![](https://)

17) Program to print prime number to 100.

/* Prime number from 1 to 100 */

#include<stdio.h>

int main(){

int numbr,k,remark;

printf(" The prime numbers between 1 and 100 : \n");

for(numbr=2;numbr<=100;++numbr)

{

remark=0;

for(k=2;k<=numbr/2;k++){

if((numbr % k) == 0){

remark++;

break;
+}

}

if(remark==0)
+printf("\n %d ",numbr);

}

return 0;
+}
+output:

18) Program to check whether a number is armstrong or not.

/* To check armstrong number */

#include <stdio.h>
+int main()
+{
+int number, originalNumber, remainder, result = 0;

printf(“Enter a three digit integer: “);
+scanf(”%d”, &number);

originalNumber = number;

while (originalNumber != 0)
+{
+remainder = originalNumber%10;
+result += remainderremainderremainder;
+originalNumber /= 10;

}

if(result == number)
+printf("%d is an Armstrong number.",number);
+else
+printf("%d is not an Armstrong number.",number);

return 0;
+}
+output:![](https://)

19) Print Different Patterns.

i)

/* Pattern 1*/

#include <stdio.h>
+int main() {

int i,j,r;

printf(“Enter number of rows: “);
+scanf(”%d”,&r);

for(i=1; i<=r; ++i)
+{
+for(j=1; j<=i; ++j)
+{
+printf("%d “,j);
+}
+printf(”\n");
+}
+return 0;
+}
+output:![](https://)

ii)

/* Pattern 2*/

#include <stdio.h>
+int main() {

int r,i,j,num= 1;
+printf(“Enter number of rows: “);
+scanf(”%d”,&r);
+for(i=1;i<=r;i++)
+{
+for(j=1;j<=i;++j)
+{
+printf("%d",num);
+++num;
+}
+printf("\n");
+}
+return 0;
+}
+output:
+

20) Program to find largest from 1 dimensional array.

/* Largest in 1 dimensional array */

#include <stdio.h>
+int main() {

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]);
+return 0;
+}
+output:

21) To find sumof the N natural numbers in an array.

/* Sum of N no.s in array */

#include<stdio.h>

int main() {
+printf("\n\n\t\tStudytonight - Best place to learn\n\n\n");
+int n, sum = 0, c, array[100];

printf(“Enter the number of integers you want to add: “);
+scanf(”%d”, &n);

printf("\n\nEnter %d integers \n\n", n);

for(c = 0; c < n; c++)
+{
+scanf("%d", &array[c]);
+sum += array[c]; // same as sum = sum + array[c]
+}

printf("\n\nSum = %d\n\n", sum);
+return 0;
+}
+output:

22) Program to add two matrices .

/* Addition of matrix */

#include <stdio.h>

int main() {

int m, n, c, d, first[10][10], second[10][10], sum[10][10];

printf(“Enter the number of rows and columns of 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 elements of second matrix\n”);

for (c = 0; c < m; c++)
+for (d = 0 ; d < n; d++)
+scanf("%d", &second[c][d]);

printf(“Sum of entered matrices:-\n”);

for (c = 0; c < m; c++) {
+for (d = 0 ; d < n; d++) {
+sum[c][d] = first[c][d] + second[c][d];
+printf("%d\t", sum[c][d]);
+}
+printf("\n");
+}

return 0;
+}
+output:

23) Program to multiply two matrices .

#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 number of rows and columns of first matrix\n”);
+scanf("%d%d", &m, &n);

printf(“Enter elements of first matrix\n”);

for (c = 0; c < m; c++)
+for (d = 0; d < n; d++)
+scanf("%d", &first[c][d]);

printf(“Enter number of rows and columns of second matrix\n”);
+scanf("%d%d", &p, &q);

if (n != p)
+printf(“The matrices can’t be multiplied with each other.\n”);

else
+{
+printf(“Enter 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 the matrices:\n”);

for (c = 0; c < m; c++) {
+for (d = 0; d < q; d++)
+printf("%d\t", multiply[c][d]);

printf("\n");
+}
+}

return 0;
+}
+output:

24) Program to check whether a string is palindrome or not .

#include<stdio.h>
+#include <string.h>

int main() {
+char s[1000];
+int i,n,c=0;

printf("Enter the string : ");
+gets(s);
+n=strlen(s);

for(i=0;i<n/2;i++)
+{
+if(s[i]==s[n-i-1])
+c++;

}
+

if(c==i)
+printf(“string is palindrome”);
+else
+printf(“string is not palindrome”);

return 0;
+}
+output:

25 Programs to swap two numbers using call by value and call by refernce.

call by refernce:-

#include <stdio.h>
+void swap(int*, int*);

int main() {

int x, y;

printf(“Enter the value of x and y\n”);
+scanf("%d%d",&x,&y);

printf(“Before Swapping\nx = %d\ny = %d\n”, x, y);

swap(&x, &y);

printf(“After Swapping\nx = %d\ny = %d\n”, x, y);

return 0;
+}

void swap(int *a, int *b)
+{
+int temp;

temp = *b;
+*b = *a;
+*a = temp;
+}
+output:

call by value:-

#include <stdio.h>

void swap(int, int);

int main() {

int x, y;

printf(“Enter the value of x and y\n”);
+scanf("%d%d",&x,&y);

printf(“Before Swapping\nx = %d\ny = %d\n”, x, y);

swap(x, y);

printf(“After Swapping\nx = %d\ny = %d\n”, x, y);

return 0;
+}

void swap(int a, int b) {
+int temp;

temp = b;
+b = a;
+a = temp;
+printf(“Values of a and b is %d %d\n”,a,b);
+}
+output:

27) Program to calculate factorial of a number with and without recursion both.

Recursion:-

#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:

without recrsion:-

#include <stdio.h>

int main() {

int c, n, fact = 1;

printf(“Enter a number to calculate its factorial\n”);
+scanf("%d", &n);

for (c = 1; c <= n; c++)
+fact = fact * c;

printf(“Factorial of %d = %d\n”, n, fact);

return 0;
+}
+output:

28) Program to print fibonacci series with and without recursion both.

Without recursion:-

/* Program to print fibonaci series */

#include<stdio.h>
+void series(int); //prototype

int main() {

int n;

printf("\n\nEnter the number of terms you wish…");
+scanf("%d",&n);
+printf("\n\n");

series(n); // function call
+printf("\n\n\n");

return 0;
+}

void series(int n) // definition

{
+int t1=0,t2=1,next;

for(int i=0;i<=n;i++)
+{
+printf("%d\t",t1);

next=t1+t2;
+t1=t2;
+t2=next;
+

}
+}
+output:

with recursion:-

#include <stdio.h>
+int fibo(int);

int main() {

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”);
+}
+else
+{
+result = fibo(num);
+printf(“The %d number in fibonacci series is %d\n”, num, result);
+}
+return 0;
+}
+int fibo(int num)
+{
+if (num == 0)
+{
+return 0;
+}
+else if (num == 1)
+{
+return 1;
+}
+else
+{
+return(fibo(num - 1) + fibo(num - 2));
+}
+}
+output:

29) Program to calculate average of 5 numbers using function.

/* program to find average of 5 numbers */

#include<stdio.h>
+int avg(int,int,int,int,int); // prototype

int main() { int a1,a2,a3,a4,a5,res;

printf("\nEnter the numbers respectiively…");
+scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);

res=avg(a1,a2,a3,a4,a5); // function call
+printf(“Average of the numbers %d”,res);

return 0;
+}

int avg(int a1,int a2,int a3,int a4,int a5) // definition

{ int p;
+p=(a1+a2+a3+a4+a5)/5;
+return p;
+}
+output:

30) Program to implement linear serach and binary.

/* Program to implement linear search and Binary search */

#include <stdio.h>
+#include <stdlib.h>

int main() {

/* Declare variables - array_of_number,search_key,i,j,low,high*/

int array[100],search_key,i,j,n,low,high,location,choice;

void linear_search(int search_key,int array[100],int n);

void binary_search(int search_key,int array[100],int n);

clrscr();

/* read the elements of array */

printf(“ENTER THE SIZE OF THE ARRAY:”);

scanf("%d",&n);

printf(“ENTER THE ELEMENTS OF THE ARRAY:\n”);

for(i=1;i<=n;i++)
+{
+scanf("%d",&array[i]);

}

/* Get the Search Key element for Linear Search */

printf(“ENTER THE SEARCH KEY:”);

scanf("%d",&search_key);

/* Choice of Search Algorithm */

printf("___________________\n");

printf(“1.LINEAR SEARCH\n”);

printf(“2.BINARY SEARCH\n”);

printf("___________________\n");

printf(“ENTER YOUR CHOICE:”);

scanf("%d",&choice);

switch(choice)
+{
+case 1:
+linear_search(search_key,array,n);
+break;

case 2: binary_search(search_key,array,n);
+break;

default:

exit(0);

}

return 0;

}

/* LINEAR SEARCH */

void linear_search(int search_key,int array[100],int n)
+{

/*Declare Variable */

int i,location;

for(i=1;i<=n;i++)
+{

if(search_key == array[i])
+{

location = i;

printf("______________________________________\n");

printf(“The location of Search Key = %d is %d\n”,search_key,location);

printf("______________________________________\n");

}

}

}

/* Binary Search to find Search Key */

void binary_search(int search_key,int array[100],int n)
+{

int mid,i,low,high;

low = 1;

high = n;

mid = (low + high)/2;

i=1;

while(search_key != array[mid])
+{

if(search_key <= array[mid])
+{

low = 1;

high = mid+1;

mid = (low+high)/2;

}
+else
+{

low = mid+1;
+high = n;

mid = (low+high)/2;
+}

}

printf("__________________________________\n");

printf(“location=%d\t”,mid);

printf(“Search_Key=%d Found!\n”,search_key);

printf("__________________________________\n");

}
+output:

31) Program to implement bubble sort.

/* Bubble sort implementation */

#include <stdio.h>

int main()
+{
+int array[100], n, c, d, swap;

printf(“Enter number of elements\n”);
+scanf("%d", &n);

printf(“Enter %d integers\n”, n);

for (c = 0; c < n; c++)
+scanf("%d", &array[c]);

for (c = 0 ; c < n - 1; c++)
+{
+for (d = 0 ; d < n - c - 1; d++)
+{
+if (array[d] > array[d+1]) /* For decreasing order use < */
+{
+swap = array[d];
+array[d] = array[d+1];
+array[d+1] = swap;
+}
+}
+}

printf(“Sorted list in ascending order:\n”);

for (c = 0; c < n; c++)
+printf("%d\n", array[c]);

return 0;
+}
+output:

32) Program to store information of 10 students using array of structures.

#include<stdio.h>
+struct student
+{
+char name[20],address[30];
+int grade,roll,dob;
+};

int main()
+{
+struct student s[10];
+int i;
+for(i=0;i<10;i++)
+{
+printf("\nEnter records for student[%d]\n",i+1);
+printf(“Enter name: “);
+gets(s[i].name);
+printf(“Enter address: “);
+gets(s[i].address);
+printf(“Enter class, roll number and date of birth(year): “);
+scanf(”%d%d%d”,&s[i].grade,&s[i].roll,&s[i].dob);
+}
+printf(“Records of the 10 students are here”);
+for(i=0;i<10;i++)
+{
+printf(”\nStudent %d”,i+1);
+printf(”\nName: %s”,s[i].name);
+printf("\nAddress: %s",s[i].address);
+printf("\nClass: %d",s[i].grade);
+printf("\nRoll No.: %d",s[i].roll);
+printf("\nDOB: %d",s[i].dob);
+printf("\n");
+}
+return 0;
+}
+output:

33) Programs to compute the transpose of a matrix.

#include <stdio.h>
+int main()
+{
+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);
+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");
+}
+return 0;
+}
+output:

34) Program to print the address of variable using pointer.

#include <stdio.h>
+int main() {
+int a;
+int *pt;

a = 10;
+pt = &a;

printf("\n[&a ]:Address of A = %p", &a);

return 0;
+}
+output:
+

35) Program to access array using pointer.

#include <stdio.h>
+int main()
+{
+int data[5],i;
+printf(“Enter elements: “);
+for(i = 0; i < 5; ++i)
+scanf(”%d”, data + i);
+printf(“You entered: \n”);
+for(i = 0; i < 5; ++i
+printf("%d\n", *(data + i));
+return 0;
+}
+output:

+ + + + + + + + +