Question

Write a program in C to make dictionary to add, delete and search words Using linked lists.
MAKE THE SEARCHING IN THE program like the searching in the online dictionary(if we enter the 1 letter then it will show all the letters starting with the same number and if we enter 2 letters then it will show all the numbers starting with same two letters and so on up to the complete word.)

make the following functions
1. insert
2. delete
3. search
4. display
5. exit

use FILE HANDLING to store words in file

Answer 1

#include <stdio.h>

#include<stdlib.h>

#include<string.h>

struct dict_entry{

char word[20];

char mean[300];

int synonym_count:

struct dict_entry* next;

struct dict_entry* synonym1;

struct dict_entry* synonym2;

struct dict_entry* synonym3;

struct dict_entry* synonym4;

struct dict_entry* synonym5;

struct dict_entry* head =NULL;

int option;

struct dict_entry* createNode(char word[] ,char meaning[]){

struct dict_entry *newNode = malloc(sizeof(struct dict_entry));

strcpy(newNode ->mean,meaning);

newNode -> synonym_count =0;

newNode -> synonym1=NULL;

newNode -> synonym2 =NULL;

newNode -> synonym3 =NULL;

newNode -> synonym4=NULL;

newNode -> synonym5 =NULL;

return newNode;

}

void displayDict(){

int i=1;

struct dict_entry* temp= head;

printf("\t word \t Defination\n*);

while(temp!=NULL){

printf("%d, %s - %s\n",i,temp->word,temp->mean);

i++;

temp =temp-> next:

}

printf("\n\n");

}

void linker2(struct dict_entry* src,struct dict_entry* dest,int number) {

switch (number) {

case 1:

src ->synonym1 =dest;

break;

case 2:

src ->synonym2=dest;

break;

case 3:

src ->synonym3=dest;

break;

case 4:

src ->synonym4=dest;

break;

case 5:

src ->synonym5=dest;

break;

}
}

///

void linker(struct dict_entry* src,struct dict_entry* dest){

if(src -> synonym_count <5){

src -> synonym_count++;

linker2(src,dest,stc -> synonym_count);

}

else{

printf("no space for a synonym");

}

}

void synonym_connecter(struct dict_entry* node,char arr[]){

struct dict_entry* temp=head;

int result = -1;

while(temp !=NULL){

result =strcmp(arr,temp ->word);

if(result ==0){

linker1(node,temp);

break;

}

temp =temp -> next;

}

if (result == -1){

printf("that word not found in dictionary");

}

}

void insert () {

struct dict_entry* temp = head;

char input_word[20]={'\0'};

char arr[300]={'\0'};

printf("enter your word ");

scanf("%s" , input_word);

while(temp!=NULL){

if(strcmp(input_word,temp->word)==0){

printf("same word found in dict\n");

return;

}

temp=temp ->next;

}

struct dict_entry* newN=createNode(input_word,arr);

if(head==NULL){

Ahead =newN;

}

else{

temp= head;

while(temp-> next !=NULL){

temp = temp ->next;

}

temp = temp ->newN;

}

int i;

displayDict():

printf("enter the synonym which are in the list");

//enter f to exit from loop

for(i=0;i<5;i++)

{

scanf("%s", input_word);

if(strcmp(input_word, "f")==0){

break;}

synonym_connector(newN,input_word);

}

return;