Applications of the Trie Data Structure - IT Assignment Help

Assignment Task

# Assignment 1: Applications of the Trie Data Structure 
The aim of this assignment is to use the Trie data structure in two practical contexts. In the first context, **Task 1 (40%)**, you will make use of a standard Trie that allows us to look up words in a dictionary and use them for a predictive text function. In the second context, **Task 2 (60%)** you will extend the Trie to be a Suffix Trie, and apply the data structure to search for particular strings in a text (i.e. exact string matching). The skeleton code provided for this assignment includes the three Java files
provided for Practical 2 (and a number of other files). Please note that **you will need to have completed Checkpoints 10 and 11 of Practical 2** in order to have a
foundation to work from in completing this Assignment. For those checkpoints, you are asked to implement the basic functions of:
- inserting data into a Trie,
- searching for a string, and
- searching for a prefix of a string.
This Assignment assumes that these functions have already been implemented. The table below gives an indication as to the breakdown of the assessable components.
|Assignment 1 | | % | 15 |
|---------------|----:|-------:|-------:|
|**Task 1** | 100| 40 |6 |
Create Dictionary | 20 |8| 1.2|
Most Frequent Word |60 |24| 3.6|
TextAreaDemo |10| 4| 0.6|
Code quality |10| 4| 0.6|
||||
|**Task 2** |100 |60| 9 |
read/insert | 40| 24| 3.6 |
get/getNode |10| 6 |0.9 |
Code quality | 10 |6| 0.9 |
Testing |20 |12| 1.8
Extension | 20| 12| 1.8
Note that 10% of each task is dedicated to code quality/style and documentation of the coding choice you have made (e.g. why a TreeMap over a HashMap?). The documentation should be in a separate document (PDF) and is submitted via FLO.
## Task 1: Predictive Text (40%)
For this task, you will make use of the classes `Trie`, `TrieNode`,
`TrieDriver`, `TrieData` and `TextAreaDemo` (the last file is taken directly from the Oracle Java Trail for Java and modified for our purposes). Skeleton code has been provided for the first two classes and you will already have modified them in order to create a working Trie data structure in Practical
2. You may optionally modify `TrieData` if you wish, but you should **not**
modify `TextAreaDemo`.
[`TextAreaDemo`](src/cp3/ass01/trie/TextAreaDemo.java)

This IT Assignment has been solved by our IT experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.