Linux
TERM PAPER
Of
FOUNDATION OF COMPUTING
Topic: - TELEPHONE DIRECTORY
Submitted To: - Submitted By:- MOHIT JAIN MR.VIJAY KUMAR
SOURCE CODE
//TETEPHONR DIRECTORY.
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#include<alloc.h>
#include<string.h>
#include<graphics.h>
struct entry
{
char name[50]; char nick[50]; char email[50]; char address[50]; char city[50]; char cont[50]; char pin[50]; struct entry *lptr; struct entry *rptr;
}*temp,*newe,*l,*r;
typedef struct entry *list; void newentry(); void display(char n[50]); void deletentry(char n[50]); void displayall(); void makempty(); int isempty(); void saventry(); void loadentry(); void deleteall(); void newentry()
{
char a[50],b[50],f[50],g[50],c[50],d[50],e[50]; int i,k=0; printf("Enter the Datas for the New Entry:"); printf("Name :"); scanf("%s",a); printf("Nick name :"); scanf("%s",b); printf("E-mail ID :"); scanf("%s",c); printf("Address :"); scanf("%s",d); printf("City :"); scanf("%s",e); printf("Contact No:"); scanf("%s",f); printf("Pincode :"); scanf("%s",g); newe=(struct entry*)malloc(sizeof(struct entry)); for(i=0;i<50;i++) { newe->name[i]=' '; newe->nick[i]=' '; newe->email[i]=' '; newe->address[i]=' '; newe->city[i]=' '; newe->cont[i]=' '; newe->pin[i]=' ';
}
for(i=0;i<50;i++)
{
newe->name[i]=a[i]; newe->nick[i]=b[i]; newe->email[i]=c[i]; newe->address[i]=d[i]; newe->city[i]=e[i]; newe->cont[i]=f[i]; newe->pin[i]=g[i];
}
if(isempty())
{
newe->lptr=newe->rptr=NULL; l=r=newe; printf("Your Entry is Added");
}
else { temp=l; while(temp!=NULL) { i=stricmp(newe->name,temp->name); if(i<0) break; else if(i>0) temp=temp->rptr; else if(i==0) { printf("Name Already Exists.Entry cannot be Added");
Of
FOUNDATION OF COMPUTING
Topic: - TELEPHONE DIRECTORY
Submitted To: - Submitted By:- MOHIT JAIN MR.VIJAY KUMAR
SOURCE CODE
//TETEPHONR DIRECTORY.
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#include<alloc.h>
#include<string.h>
#include<graphics.h>
struct entry
{
char name[50]; char nick[50]; char email[50]; char address[50]; char city[50]; char cont[50]; char pin[50]; struct entry *lptr; struct entry *rptr;
}*temp,*newe,*l,*r;
typedef struct entry *list; void newentry(); void display(char n[50]); void deletentry(char n[50]); void displayall(); void makempty(); int isempty(); void saventry(); void loadentry(); void deleteall(); void newentry()
{
char a[50],b[50],f[50],g[50],c[50],d[50],e[50]; int i,k=0; printf("Enter the Datas for the New Entry:"); printf("Name :"); scanf("%s",a); printf("Nick name :"); scanf("%s",b); printf("E-mail ID :"); scanf("%s",c); printf("Address :"); scanf("%s",d); printf("City :"); scanf("%s",e); printf("Contact No:"); scanf("%s",f); printf("Pincode :"); scanf("%s",g); newe=(struct entry*)malloc(sizeof(struct entry)); for(i=0;i<50;i++) { newe->name[i]=' '; newe->nick[i]=' '; newe->email[i]=' '; newe->address[i]=' '; newe->city[i]=' '; newe->cont[i]=' '; newe->pin[i]=' ';
}
for(i=0;i<50;i++)
{
newe->name[i]=a[i]; newe->nick[i]=b[i]; newe->email[i]=c[i]; newe->address[i]=d[i]; newe->city[i]=e[i]; newe->cont[i]=f[i]; newe->pin[i]=g[i];
}
if(isempty())
{
newe->lptr=newe->rptr=NULL; l=r=newe; printf("Your Entry is Added");
}
else { temp=l; while(temp!=NULL) { i=stricmp(newe->name,temp->name); if(i<0) break; else if(i>0) temp=temp->rptr; else if(i==0) { printf("Name Already Exists.Entry cannot be Added");