Question

write a C program to make the dictionary USING LINKED LISTS and STORE DATA in File HANDLING..... you have to create functions
1. insert
2. delete
3. search(if we search with any letter then the words with same first letter have been shown)
4. display
6. exit
Appearance should be like proper dictionary.

Answer 1

code

solution

//output

//copyable code

#include<stdio.h>

#include<string.h>

#include<stdlib.h>

struct node

{

char word[30];

struct node *nextpointer;

};

struct node *add(struct node* headnode,char n[40])

{

struct node *nnode;

nnode=(struct node*)malloc(sizeof(struct node));

strcpy(nnode->word,n);

nnode->nextpointer=NULL;

if(headnode==NULL)

{

headnode=nnode;

return headnode;

}

struct node *tempvalue=headnode;

while(tempvalue->nextpointer!=NULL)

tempvalue=tempvalue->nextpointer;

tempvalue->nextpointer=nnode;

return headnode;

}

struct node *delete(struct node *headnode,char n[40])

{

int foundvalue=0;

if(strcmp(headnode->word,n)==0)

{

foundvalue=1;

struct node *p=headnode;

headnode=headnode->nextpointer;

free(p);

}

else

{

struct node *curr=headnode->nextpointer;

struct node *prev=headnode;

while(curr!=NULL)

{

if(strcmp(curr->word,n)==0)

{

prev->nextpointer=curr->nextpointer;

free(curr);

foundvalue=1;

break;

}

prev=curr;

curr=curr->nextpointer;

}

}

if(foundvalue==0)

printf("Word not foundvalue\n");

else

printf("Word deleted successfully\n");

return headnode;

}

void search(struct node *headnode,char c)

{

struct node *tempvalue=headnode;

int cnt=0;

printf("Words in dictionary\n");

while(tempvalue!=NULL)

{

if(tempvalue->word[0]==c)

{

cnt++;

printf("%s\n",tempvalue->word);

}

tempvalue=tempvalue->nextpointer;

}

printf("\n");

if(cnt==0)

printf("No word foundvalue\n");

else

printf("Total words= %d\n",cnt);

}

void PrintList(struct node *nnode)

{

    while(nnode != NULL)

    {

        printf("%s \n",nnode->word);

       nnode= nnode->nextpointer;

   }

}

int main()

{

FILE *fpvalue;

fpvalue=fopen("dictionary.txt","r");

char name[30];

struct node *headnode=NULL;

while(fgets(name,sizeof name,fpvalue) != NULL)

{

headnode=add(headnode,name);

}

fclose(fpvalue);

while(1)

{

printf("1: Insert word in dictionary\n");

printf("2: Delete word from dictionary\n");

printf("3: Search word from dictionary \n");

printf("4: display word \n");

printf("5: Exit\n");

printf("Enter choice: ");

int n;

scanf("%d",&n);

if(n==1)

{

printf("Enter the word: ");

char n[30];

scanf("%s",n);

headnode=add(headnode,n);

printf("Word added successfully\n");

}

else if(n==2)

{

printf("Enter the word to delete: ");

char n[30];

scanf("%s",n);

headnode=delete(headnode,n);

}

else if(n==3)

{

printf("Enter the starting letter of the word: ");

char ch;

scanf(" %c",&ch);

search(headnode,ch);

}

else if(n==4)

{

printf("Enter the display word: ");

PrintList(headnode);

}

else if(n==5)

{

FILE *f;

f=fopen("dictionary.txt","w");

struct node *tempvalue=headnode;

while(tempvalue!=NULL)

{

fputs(strcat(tempvalue->word,"\n"),f);

tempvalue=tempvalue->nextpointer;

}

printf("Data saved in file successfully\n");

break;

}}

return 0;

}