Skip to main content

ENTER DETAILS OF A STUDENT USING STRUCTURE WITHIN A STRUCTURE


LIST OF PROGRAMS


#include<stdio.h>
#include<conio.h>
struct stu2
{
char add[50];
long int pin;
char city[50];
}s3;
struct stu
{
char student[20];
struct stu2 s3;
}s2[3];
void main()
{int i;
clrscr();
printf("\nENTER DETAILS OF  STUDENT:  ");
for( i=0;i<3;i++)
{
printf("\nENTER STUDENT NAME");
  gets(s2[i].student);
printf(" Enter Address:\n");
  gets(s2[i].s3.add);
printf("Enter Pin Code\n");
  scanf("%ld",&s2[i].s3.pin);
printf("Enter City Name");
  fflush(stdin);
  gets(s2[i].s3.city);
}

printf("DETAILS OF  STUDENT ARE : ");
for(i=0;i<3;i++)
{
printf("\nSTUDENT NAME ");
puts(s2[i].student);
printf("\n ADDRESS IS:  ");
puts(s2[i].s3.add);
printf("\nPINCODE IS : %ld \n",s2[i].s3.pin);
printf("CITY NAME  \n");
puts(s2[i].s3.city);
}
getch();
}

LIST OF PROGRAMS

Comments

Anonymous said…
all programs are not here only question are there not answers

Popular posts from this blog

PROGRAM TO FIND OCTAL OF A NUMBER

LIST OF PROGRAMS #include<stdio.h> #include<conio.h> void main() { long int n,oct=0,r=1,pow=1;  clrscr(); printf("Enter a number "); scanf("%ld",&n); if(n<0) printf("WRONG INPUT"); else {  if(n<=7&&n>=0)  oct =n;  else  {  while(n>0)  { r=n%8; oct=oct+(r*pow); n=n/8; pow=pow*10;  }  }  printf("OCTAL = %ld",oct);  getch(); } } LIST OF PROGRAMS

PROGRAM TO PERFORM BINARY SEARCH USING RECURSION

LIST OF PROGRAMS #include<stdio.h> #include<conio.h> int binary(int ,int ); int a[10],md,s,c=0; void main() { int n,i; clrscr(); printf("ENTER LIMIT \n"); scanf("%d",&n); printf("ENTER ARRAY\n"); for(i=0;i<n;i++) { fflush(stdin); scanf("%d",&a[i]); } printf("ENTER NUMBER TO BE SEARCHED"); scanf("%d",&s); c=binary(0,n-1); if(c==-1) printf("NOT FOUND"); getch(); } int binary(int f,int l) {  md=(f+l)/2; if(f>l) { return(-1); } else if (a[md]<s) return(binary(md+1,l)); else if(a[md]==s) {printf("Found AT LOCATION %d IN WHICH 0 IS THE STARTING ADDRESS",md); return (1); } else return(binary(f,md-1)); } LIST OF PROGRAMS