@Shobh89

#include<stdio.h> int main() { int i=5; int *ptr=&i; int**pptr=&ptr; printf("%d\n",**pptr); return 0;

#include<stdio.h> int main() { int x; int *ptr; ptr=&x; *ptr= 0; //x=0 printf(" x=%d\n",x);//0

#include <stdio.h> int main() { int n=4; printf("%f",pow(n,2)); return 0; }

// C program for the above approach #include <math.h> #include <stdio.h> // Function to find the square-root of N double findSQRT(double N) { return sqrt(N); } // Driver Code int main() {

// C program to compute sum of digits in // number. #include <stdio.h> /* Function to get sum of digits */ int getSum(int n) { int sum = 0; while (n != 0) { sum = sum + n % 10;

#include <stdio.h> #include<math.h> int calcpercentage(int science, int maths, int sanskrit); int main() { int science = 88; int maths = 84; int sanskrit = 99;

#include<stdio.h> int fib(int n); int main() { printf("%d",fib(6)); return 0; } int fib(int n) {

#include<stdio.h> float convertTemp(float celsius); int main() { float far=convertTemp(0); printf("far : %f",far); return 0; }

#include<stdio.h> int fact(int n); int main() { printf(" factorial is : %d",fact(5)); return 0; } int fact(int n) {

#include<stdio.h> int sum(int n); int main() { printf("sum is : % d",sum(5)); return 0; } //recursive function