ASSIGNMENT 3 Assignment 3 tests your knowledge of trees (Chapters 25 and 26), hashing structures (Chapter...

Transcribed Image Text:

ASSIGNMENT 3 Assignment 3 tests your knowledge of trees (Chapters 25 and 26), hashing structures (Chapter 27) and graphs (Chapters 28). You can and should start with the examples from the textbook/presentation and adapt them to the assignment at hand and use the appropriate names and requirements bellow. Design a program/project/driver class YourNameAssignment3 and the following classes (with exact² names, replace YourName_with your actual name or the name you go by, no spaces): Class Exact Name Description YourNameBinarySearch Tree The complete version of user-defined binary search tree BST class from Chapter 25. YourNameAVLTree YourNameMap YourNameHashMap YourNameHashSet YourNameGraph The complete version of the user-defined self-balancing binary search tree AVLTree class from Chapter 26 that uses YourNameBinarySearchTree instead of the BTS. The complete version of the user-defined MyMap from Chapter 27. The complete version of the user-defined MyHashMap from Chapter 27 that uses the YourNameMap instead of the MyMap. The complete version of the user-defined MyHashSet from Chapter 27 The complete version of the user-defined Graph from Chapter 28. YourNameUnweightedGraph The complete version of the user-defined UnweightedGraph from Chapter 28 that uses the YourNameGraph instead of the Graph. YourNameAssignment3 The driver class main method processes the Assignment3DataFile.txt file (line format is: "City1 City2 Distance" separated by tabs; representing the distance between City 1 and City2 and City2 and City1) and build instances of the classes above as requested bellow: Read the Distance part of the Assignment3DataFile.txt file and build instances of the user- defined YourNameBinarySearch Tree and YourNameAVLTree above called MyYourNameBST and MyYourNameAVLT and test/demonstrate ALL functionality/methods for both (meaning it will call all methods to show that they work correctly). Read the City1 part of the Assignment3DataFile.txt file and build an instance of the user- defined YourNameHashSet class above called MyYourNameHS and test/demonstrate ALL functionality/methods for it. Read the City2 and Distance part of the Assignment3DataFile.txt file and build an instance of the user-defined YourNameHashMap class above called MyYourNameHM and test/demonstrate ALL functionality/methods for it. ■ Read the City1 and City2 part from the Assignment3DataFile.txt file and build instance of the user-defined YourName UnweightedGraph class above called MyYourNameUG and test/demonstrate ALL functionality/methods for it. You can optimize this method and build all the structures in one reading of the file. I do ask for exact names and exact/precise spelling of the classes and instances (that include your actual name in them) to show me that you understood and wrote the classes and methods, and you did not just type, or copied and pasted them from somewhere. Thus, if you do not name them accordingly and your actual name is not in the name of classes and instances, you are not going to earn credit for them. Create a Microsoft Word screenshots document called YourNameAssignment3-Screenshot.docx (replace YourName with your actual name) that contains screenshots of the entire JAVA source code files in the editor window for each one the classes and the entire output (from the driver class). If the entire class JAVA source code or the output does not fit in one screenshot, create multiple screenshots, and add them to the document. Please add the screenshots in order, to make reading and understanding your work easier and earn full credit for your work. ASSIGNMENT 3 Assignment 3 tests your knowledge of trees (Chapters 25 and 26), hashing structures (Chapter 27) and graphs (Chapters 28). You can and should start with the examples from the textbook/presentation and adapt them to the assignment at hand and use the appropriate names and requirements bellow. Design a program/project/driver class YourNameAssignment3 and the following classes (with exact² names, replace YourName_with your actual name or the name you go by, no spaces): Class Exact Name Description YourNameBinarySearch Tree The complete version of user-defined binary search tree BST class from Chapter 25. YourNameAVLTree YourNameMap YourNameHashMap YourNameHashSet YourNameGraph The complete version of the user-defined self-balancing binary search tree AVLTree class from Chapter 26 that uses YourNameBinarySearchTree instead of the BTS. The complete version of the user-defined MyMap from Chapter 27. The complete version of the user-defined MyHashMap from Chapter 27 that uses the YourNameMap instead of the MyMap. The complete version of the user-defined MyHashSet from Chapter 27 The complete version of the user-defined Graph from Chapter 28. YourNameUnweightedGraph The complete version of the user-defined UnweightedGraph from Chapter 28 that uses the YourNameGraph instead of the Graph. YourNameAssignment3 The driver class main method processes the Assignment3DataFile.txt file (line format is: "City1 City2 Distance" separated by tabs; representing the distance between City 1 and City2 and City2 and City1) and build instances of the classes above as requested bellow: Read the Distance part of the Assignment3DataFile.txt file and build instances of the user- defined YourNameBinarySearch Tree and YourNameAVLTree above called MyYourNameBST and MyYourNameAVLT and test/demonstrate ALL functionality/methods for both (meaning it will call all methods to show that they work correctly). Read the City1 part of the Assignment3DataFile.txt file and build an instance of the user- defined YourNameHashSet class above called MyYourNameHS and test/demonstrate ALL functionality/methods for it. Read the City2 and Distance part of the Assignment3DataFile.txt file and build an instance of the user-defined YourNameHashMap class above called MyYourNameHM and test/demonstrate ALL functionality/methods for it. ■ Read the City1 and City2 part from the Assignment3DataFile.txt file and build instance of the user-defined YourName UnweightedGraph class above called MyYourNameUG and test/demonstrate ALL functionality/methods for it. You can optimize this method and build all the structures in one reading of the file. I do ask for exact names and exact/precise spelling of the classes and instances (that include your actual name in them) to show me that you understood and wrote the classes and methods, and you did not just type, or copied and pasted them from somewhere. Thus, if you do not name them accordingly and your actual name is not in the name of classes and instances, you are not going to earn credit for them. Create a Microsoft Word screenshots document called YourNameAssignment3-Screenshot.docx (replace YourName with your actual name) that contains screenshots of the entire JAVA source code files in the editor window for each one the classes and the entire output (from the driver class). If the entire class JAVA source code or the output does not fit in one screenshot, create multiple screenshots, and add them to the document. Please add the screenshots in order, to make reading and understanding your work easier and earn full credit for your work.

Answer rating: 100% (QA)

In the context of the assignment requirements provided the correct answer option C YourNameBinarySearchTree is the class that should be used in the AV... View the full answer