1. Implement the appropriate ADT (Abstract Data Type) to represent a dictionary. 2. Load the dictionary (given as a file) into memory. 3. Test if a word is present in the dictionary.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Project description Using C language
In this project, you have to represent a dictionary by a binary search tree. Each node contains, no
longer a simple integer, but a pair formed of a string, representing a word from the dictionary, and
a list of strings, each element of the list representing a synonym of the word.
Required work
1. Implement the appropriate ADT (Abstract Data Type) to represent a dictionary.
2. Load the dictionary (given as a file) into memory.
3. Test if a word is present in the dictionary.
4. Given a word found in the dictionary, print all the synonyms for that word.
5. Given a wvord m and one of its synonyms s, add to the dictionary the synonym of the word
m (if it is already present, add a synonym among its synonyms, if it is not present, then add
it to dictionary, with the synonym s as the only synonym).
6. You must also suggest other operations such as:
a. Find the word with the highest number of synonyms
b. Given a wword m, find the dictionary words for which m is a synonym.
c. Find the most repeated word as a synonym in the dictionary
d. Balance the dictionary to improve complexity.
7. Given a dictionary represented as a binary search tree, store the dictionary in a file, further
ensuring that the words are arranged in alphabetical order.
Transcribed Image Text:Project description Using C language In this project, you have to represent a dictionary by a binary search tree. Each node contains, no longer a simple integer, but a pair formed of a string, representing a word from the dictionary, and a list of strings, each element of the list representing a synonym of the word. Required work 1. Implement the appropriate ADT (Abstract Data Type) to represent a dictionary. 2. Load the dictionary (given as a file) into memory. 3. Test if a word is present in the dictionary. 4. Given a word found in the dictionary, print all the synonyms for that word. 5. Given a wvord m and one of its synonyms s, add to the dictionary the synonym of the word m (if it is already present, add a synonym among its synonyms, if it is not present, then add it to dictionary, with the synonym s as the only synonym). 6. You must also suggest other operations such as: a. Find the word with the highest number of synonyms b. Given a wword m, find the dictionary words for which m is a synonym. c. Find the most repeated word as a synonym in the dictionary d. Balance the dictionary to improve complexity. 7. Given a dictionary represented as a binary search tree, store the dictionary in a file, further ensuring that the words are arranged in alphabetical order.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY