#include <stdio.h>
#includ 
Practice Pointers –
#include <stdio.h>
#include <malloc.h>
#define NULL 0
int main(){
struct node{
int data;
struct node *link;
};
struct node *p,*q;
p=(struct node *) malloc(sizeof (struct node));
q=(struct node *) malloc(sizeof (struct node));
p->data=30;
p->link=q;
q->data=40;
q->link=NULL;
printf("%d
",p->data);
p=p->link;
printf("%d
",p->data);
return 0;
}#include <stdio.h>
int m
Practice Structures, Unions, Enums –
#include <stdio.h>
int main() {
struct emp {
char name[20];
int age;
long phone;
};
struct emp e = {"Tiger"};
printf("%s %d %d
", e.name,e.age, e.phone);
return 0;
} The functionmalloc() returns a fl
Practice Memory Allocation –
The functionmalloc() returns a float pointer if the memory is allocated for storing float values and a double pointer if memory is allocated for storing double values.
#include<stdio.h>
#include
Practice Variable Number of Arguments –
#include<stdio.h>
#include<stdarg.h>
void varfun(int n, ...);
int main() {
varfun(3, 7, -11.2, 0.66);
return 0;
}
void varfun(int n, ...) {
float ptr;
int num;
va_start(ptr, n);
num = va_arg(ptr, int);
printf("%d", num);
} #include <stdio.h>
#includ
Practice Functions –
#include <stdio.h>
#include <stdarg.h>
void fun(int n, ...);
int main() {
fun(2, 12, 13, 14);
return 0;
}
void fun(int n, ...) {
va_list p;
va_start(p, n);
n= va_arg(p, int);
printf("%d", n);
}
#include <stdio.h>
int mai
Practice Control Instructions –
#include <stdio.h>
int main(){
char nam[2][10];
int i;
for(i=0;i<=1;i++){
printf("Name=");
scanf("%s",nam[i]);
printf("Name is=%s
",nam[i]);
}
return 0;
} #include<stdio.h>
int
Practice Arrays –
#include<stdio.h>
int main() {
int a[3][4] = {1, 2, 3, 4, 4, 3, 2, 1, 7, 8, 9, 0};
printf("%u, %u
", a+1, &a+1);
return 0;
}
#include<stdio.h>
void fu
Practice Pointers –
#include<stdio.h>
void fun(int **p);
int main() {
int a[3][4] = {1, 2, 3, 4, 4, 3, 2, 8, 7, 8, 9, 0};
int *ptr;
ptr = &a[0][0];
fun(&ptr);
return 0;
}
void fun(int **p) {
printf("%d
", **p);
} What will be the output of the program assuming that the array begi
Practice Pointers –
What will be the output of the program assuming that the array begins at the location 1000 on GCC compiler?
#include <stdio.h>
int main() {
int a[3][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 };
printf("%u, %d, %d
", a[0]+1, *(a[0]+1), *(*(a+0)+1));
return 0;
} In the following program how long will the for
Practice Control Instructions –
In the following program how long will the for loop get executed?
#include<stdio.h>
int main() {
int i;
for(;scanf("%d", &i);printf("%d
", i));
return 0;
} #include<stdio.h>
int main
Practice Control Instructions –
#include<stdio.h>
int main()
{
int i = 0;
for (printf("1st
"); i < 2 && printf("2nd
"); ++i && printf("3rd
"))
{
printf("*
");
}
return 0;
}
#include <stdio.h>
#define
Practice Control Instructions –
#include <stdio.h>
#define PRINT(i, limit) do
{
if (i++ < limit)
{
printf("CrackExams
");
continue;
}
}while(0)
int main()
{
int i = 0;
PRINT(i, 3);
return 0;
}
#include <stdio.h>
#includ
Practice Functions –
#include <stdio.h>
#include <stdarg.h>
void fun(char *msg, ...);
int main() {
fun("Hello", 1, 4, 7, 11);
return 0;
}
void fun(char *msg,...) {
int num;
va_list ptr;
va_start(ptr, msg);
num = va_arg(ptr, int);
num = va_arg(ptr, int);
printf("%d", num);
}int foo(int n) {
if(n == 0)<
Practice Bitwise Operators –
int foo(int n) {
if(n == 0)
return 1;
else {
int sum = 0;
for(int i=foo(n-1); i<n; i++)
sum += foo(i);
}
return sum;
}
#include <stdio.h>
int mai
Practice Bitwise Operators –
#include <stdio.h>
int main(){
int x=12, b=13;
if x>b
printf("larger value");
else
printf("smaller value");
return 0;
}