A dictionary stores keywords & its meanings. Write a program for adding new keywords, deleting keywords, updating values of any entry. Provide facility to display whole data sorted in ascending/ Descending order. Also find how many maximum comparisons may require for finding any keyword. Use Hashing technique and find the complexity for finding a keyword.
Implement Dictionary ADT in two ways for the word-line concordance application.
- Using Binary Search Tree
- Using AVL Tree Also further compute the execution time (in seconds) taken by both dictionary ADT implementations and represent it graphically. Required Files: 1. The textual information to be examined is in the file: “data.txt” 2. The stop words are in the file “stop_words.txt”
[Hint:
- The word-concordance application code and each dictionary ADT should be developed and tested separately.
- A linked list implementation of the queue ADT can be useful to store the lines-of-occurrence for each word.
- use a regular expression to define a word can be studied at: https://docs.python.org/dev/howto/regex.html ]
The goal of this assignment is to process a textual, data file (data.txt) to generate a word concordance with line numbers for each main word. A dictionary ADT is perfect to store the word concordance with the word being the dictionary key and a list of its line numbers being the associated value with the key. Since the concordance should only keep track of the “main” words, there will actually be a second stop-words file (stop_words.txt). The stop-words file will contain a list of stop words (e.g., “a”, “the”, etc.) -- these words will not be included in the concordance even if they do appear in the data file. The output of the program should be a text file containing the concordance words printed out in alphabetical order along with their corresponding line numbers.
Implemented Dictionary ADT using Hashing, Binary Tree, AVL Tree for the above tasks.
Run make file
make