Arrangement and make sure no error and run smoothly by using Phyton Software. Implement all the functions of a dictionary (ADT) using hashing. Data: Set of (key, value) pairs. Keys are mapped to values. Keys must be comparable. Keys must be unique. Standard Operations: Insert(key, value) Find(key), Delete(key) ====== CPE 204L Dictionar
Arrangement and make sure no error and run smoothly by using Phyton Software.
Implement all the functions of a dictionary (ADT) using hashing.
Data:
Set of (key, value) pairs.
Keys are mapped to values.
Keys must be comparable.
Keys must be unique.
Standard Operations:
Insert(key, value)
Find(key),
Delete(key)
====== CPE 204L Dictionary =====
[1] : Insert Word
[2] : Find Word
[3] : Delete Word
[4] : Exit
============================
Enter your choice : 1
Enter word: pretty
Enter meaning: beautiful
Pretty is successfully inserted into dictionary
====== CPE 204L Dictionary =====
[1] : Insert Word
[2] : Find Word
[3] : Delete Word
[4] : Exit
These is the sample output of the
============================
Enter your choice : 1
Enter word: pretty
Enter meaning: beautiful
Duplicate Word! Pretty is not successfully inserted into dictionary.
====== CPE 204L Dictionary =====
[1] : Insert Word
[2] : Find Word
[3] : Delete Word
[4] : Exit
============================
Enter your choice : 2
Enter word: pretty
Word is Present in Dictionary
pretty = beautiful
====== CPE 204L Dictionary =====
[1] : Insert Word
[2] : Find Word
[3] : Delete Word
[4] : Exit
============================
Enter your choice : 3
Enter word: pretty
Word is successfully deleted
====== CPE 204L Dictionary =====
[1] : Insert Word
[2] : Find Word
[3] : Delete Word
[4] : Exit
============================
Enter your choice : 2
Enter word: pretty
Word not Found.
====== CPE 204L Dictionary =====
[1] : Insert Word
[2] : Find Word
[3] : Delete Word
[4] : Exit
============================
Enter your choice : 4
Thank you for using the dictionary program.
Step by step
Solved in 4 steps with 3 images
