Notes

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

struct node
{
char usn[10],name[10],branch[5],phno[10];
int sem;
struct node *link;
};
typedef struct node *NODE;
NODE temp, FIRST=NULL;

/**********************************/
NODE getnode()
{
NODE x;
x=(NODE)malloc(sizeof(struct node));
return x;
}

/**********************************/
void read()
{
temp=getnode();
temp->link=NULL;
gets(temp->usn);
printf("Enter USN:");
gets(temp->usn);

printf("Enter Name:");
gets(temp->name);

printf("Enter Branch:");
gets(temp->branch);

printf("Enter phno");
gets(temp->phno);

printf("Enter SEM");
scanf("%d",&temp->sem);
}

void Create_SLL()
{
int n,i=0;

printf("enter the number of students n");
scanf("%d",&n);
while(i!=n)
{
i++;
printf("Enter the details of the %d studentn", i);
read();

if(FIRST==NULL)
FIRST=temp ;

else
{
temp->link=FIRST;
FIRST=temp;
}

} //end of while
printf("Craetion of SLL for %d is donen",i);
}


/**Display the status and count the number****/
void display_count(NODE FIRST)
{
NODE temp1=FIRST;
int count=1;

printf("the student details n");

if(temp1==NULL)
{
printf("the student detail is NULL and count is %dn",count-1);
}

else
{
while(temp1->link!=NULL)
{
count++;
printf("%st%sn",temp1->usn,temp1->name);
temp1=temp1->link;
}

printf("%st%sn",temp1->usn,temp1->name);
printf("the student count is %dn",count);
}


return;
}
/********************Insertionfront();********/
void Insertionfront()
{
printf("enetr the details of the studentn");
read();
if(FIRST==NULL)
FIRST=temp ;

else
{
temp->link=FIRST;
FIRST=temp;
}
}

NODE Insertionend( NODE FIRST)
{
NODE last=FIRST;
temp=getnode();
temp->link=NULL;
printf("enter the deatils of the new studentn");
read();
if(last!=NULL)
{
while(last->link!=NULL)
{
last=last->link;
}
last->link=temp;
}
else
{
FIRST=temp;
}
return FIRST;
}
/******/

void Deletionfront()
{
NODE temp2 = FIRST;
if(temp2==NULL)
{
printf("List is emptyn");
}
else
{
printf("deleted element is %sn", temp2->usn);
FIRST =temp2->link;
free(temp2);
}
return;
}
void Deletionend()
{
NODE temp2 = FIRST,pre=NULL;
if(temp2==NULL)
{
printf("List is emptyn");
}
else if (temp2->link==NULL)
{ printf("deleted element is %sn", temp2->usn);
free(temp2);
FIRST =NULL;
}

else
{
while(temp2->link!=NULL)
{
pre=temp2;
temp2=temp2->link;
}
pre->link=NULL;
printf("deleted element is %sn", temp2->usn);
free(temp2);
}

return ;
}

void main()
{

NODE temp,first = NULL;
int choice;
while(1)
{
printf("1.Create SLL t2.Display SLL t3.Insertion at frontn4.Insertion at endt5.deletion at frontt6.deletion at end n7.Exit");
printf("nnntEnter Your Choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1: Create_SLL();break;
case 2:display_count(FIRST);break;
case 3: Insertionfront(); break;
case 4:Insertionend(FIRST); break;
case 5:Deletionfront();break;
case 6:Deletionend();break;
case 7:exit(0);
default: printf("nnntEnter proper Choice....");
}
}



}