COP3538 Data Structures Using OOP Homework 7 complete solutions correct answers key

COP3538 Data Structures Using OOP
Homework 7 complete solutions correct answers key 
Purpose
Practice using a Priority Queue implemented as a Doubly-Linked Lists to manage and access data.
Instructions
Create a Java program that performs the following tasks:
1. Read the Crypto.Input.txt input data file into a the Priority Queue (doubly-linked list)
A. Each record in the Crypto.Input.txt file contains two pieces of information
1. Index – An integer number between 0 and 99
2. Symbol – A symbol in the form of a letter, number or a space
2. Display the contents of the Priority Queue (see Example Output section)
Note: Display the contents in the manner Index – Symbol (i.e., 1 – F 2 – I 5 – D 6 – E).
A. First, display the contents from the front to the rear of the Priority Queue
B. Then, display the contents from the rear to the front of the Priority Queue
3. Read the Words.Input.txt input data file into the program
A. Each record contains a set of integers that represent an encrypted word or phrase
B. Use the integers in each record to decrypt the word or phrase using the Priority Queue
1. Find each integer in the Priority Queue (the Index value)
2. Display the Symbol associated with that Index value
3. Keep track of the current node
a. Find the next integer in the word starting from the current node
1. Be Careful! Do not start at the front of the Doubly-Linked List each time
2. Keep track of how many moves was required to decrypt a word
C. Once a word is fully decrypted and displayed
1. Report the total number of moves at the end of the decrypted word
2. Move to the next line of output
4. Report the overall total number of moves required to decrypt the all of the words