in sculls do we have to make a linked representation of a queue and then insert elements into that queue by changing the rear pointerie that rear pointer will subsequently point to the location of the node of the linked … Continue reading
In 2.6 kernel the gendisk is at the core of the block subsystem; if you need to work with or find something out about a disk, struct gendisk probably has what you need. The best way of looking at the … Continue reading
#include #define MONTHS 12 int main() { int days[MONTHS]={31,28,[4]=31,30,31,[1]=29}; int i; for(i=0;i<MONTHS;i++) printf("%2d %d\n",i+1,days[i]); return 0; }
#include<stdio.h> int main() { int x=1,y=1,z; if(y<0) if(y>0) x=3; else x=5; printf(“%d\n”,x); printf(“%d\n”,y); return 0;
i=l=f=d=100/3; printf(“%.8g\t”,(double)i); printf(“%.8g\t”,(double)f); printf(“%.8g\t”,(double)d); d=f=l=i=100/3; printf(“%.8g\t”,(double)i); printf(“%.8g\t”,(double)f); printf(“%.8g\t”,(double)d);
#include<stdio.h> int main() { int x,y,z; x=y=z=1; ++x||++y&&++z; printf(“%d\t%d\t%d\n”,x,y,z); return 0; }
#include<stdio.h> int main() { int x=2,y,z; x*=3+2; printf(“%d\n”,x); x*=y=z=4; printf(“%d\n”,x); x=y==z; printf(“%d\n”,x); return 0; }
We have implemented multiple client server through message queues.
client server architecture implemented through message queues………almost done……(multiple clients editing remaining)
shell script assignment 1 is completed and uploaded.
float a,b; b=2.0e20+1; a=b-2.0e20;
completed and uploaded 1,2 and 3 assignment on nas…
#include<stdio.h> int main() { int a,i; printf(“enter a number”); scanf(“%d”,&a); for(i=a;i<=a(a+10);i++); { printf(“%d “, i); } printf(“\n”); }