Skip to main content

Binary Search Tree - Playing with text file data

By

Program Requirements:


  • Read a text file. 
  • Store the words from the text file into a binary search tree. 
  • To make the problem easier, you may assume that each line in the file contains only one word. (See extra credit below.) 
  • Continue prompting the user for names of text files, reading from text files and adding words to the binary search tree until the user exits the program. 
  • When the program closes, the binary search tree is discarded and when the program starts again, the tree starts in an empty state. 
  • Upon request of the user, display the words stored in the binary search tree in alphabetical order along with the number of times each word appeared in the text file. 
  • In addition, display the total number of words in the tree (count includes duplicates) and the total number of unique words in the tree (not including duplicates). 
  • The words should be case insensitive. That is, "Dog" is equivalent to "doG". If both "Dog" and "doG" appear in the text file, your program would report that there are two occurrences of the word "dog". 
  • You must implement the binary search tree data structure and may not use the collection data structures provided in Java libraries. 
  • Use of a graphical user interface for input is required. Do not use pop-ups. You may display your results in the console window. However, the output must be clearly labeled. 
  • The use of the widget which allows a user to browse and select a file is recommended. 
  • Do not hardcode the name of a text file (although you may wish to do this when you test early versions of your program). Do not hard code any pathnames into your program. 
  • Assume the text files contain more than one word per line. Parse the lines of text into words and add each word to the binary search tree. 
  • A word is a sequence of letters. The end of a word is designated by anything that is not an upper or lowercase letter. 
  • Make sure you write your comments in the program explaining methods behaviors. 

Get Project Solution by contacting us

- via WhatsApp: +92-324-7042178
- via email: codelogixstudio@gmail.com
Labels:

Comments

Post a Comment

Popular posts from this blog

The Zoo Management System - entity relationship diagram & MS Access Database

By
Zoo Management System - Project Details: You are the employee of a big, worldwide working Zoo Management Company. Your company is responsible for the Zoo management. Your boss thinks it would be a great idea to store all data for each Zoo in a brand new self-developed ZOO Management System. Up to now, the ZOO management company has maps of each ZOO available. Your boss knows that you took a course in introduction on an ERP system, so he asks you if you could help designing such a system. Each ZOO must have the same organizational structure, which should look like this: Each Zoo has a Zoo-Address. Each Zoo has many visitors (Visitor Ticket Process (VTP). Many Zoo-Attractions belong to a Zoo. Module 1: Entity Relationship Diagram Design a ER (entity-relationship) diagram for your ZOO Management System. Use the information provided below with the entities and its attributes. Put the entities in the correct relationship to each other (organizational structure). Module 2: DB Implem...
1 comment
Read more

Human Physiology by Stuart Ira Fox [PDF] (12th edition) free download

By
21 comments
Read more

Sudoku Game Project in Java with full source code including GUI task

By
Introduction The purpose of the project is to try in practice the use of recursion and object-oriented program design. Please make sure to read this entire note before starting your work. Pay close attention to the sections on deadlines, deliverables, and exam rules. The problem Your task in this part of the project is to write a solver for Sudoku puzzles. Sudoku puzzles are a kind of crossword puzzles with numbers where the following two conditions have to be met: In each row or column, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they must all be different.  For each of the nine non-overlapping 3x3 blocks, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they ust all be different. The following two figures show a Sudoku puzzle and its solution. The input The input of your program, the Sudoku puzzles, is given in text files. More specifically, they are represented as nine lines of nine characters separated by spaces. The characters can be of two...
Post a Comment
Read more