Create the data structure binary search tree

Assignment Help Computer Engineering

Reference no: EM131850306

Problem

Different authors tend to use different vocabularies and to use common words information retrieval with differing frequencies. Given an essay or other text, it is interesting to find program what distinct words are used and how many times each is used. The purpose of this project is to compare several different kinds of binary search trees useful for this information retrieval problem. The current, first part of the project is to produce a driver program and the information-retrieval package using ordinary binary search trees. Here is an outline of the main driver program:

1. Create the data structure (binary search tree).

2. Ask the user for the name of a text file and open it to read.

3. Read the file, split it apart into individual words, and insert the words into the data structure. With each word will be kept a frequency count (how many times the word appears in the input), and when duplicate words are 345 encountered, the frequency count will be increased. The same word will not be inserted twice in the tree.

4. Print the number of comparisons done and the CPU time used in part 3.

5. If the user wishes, print out all the words in the data structure, in alphabetical order, with their frequency counts.

6. Put everything in parts 2-5 into a do ... while loop that will run as many times as the user wishes. Thus the user can build the data structure with more than one file if desired. By reading the same file twice, the user can compare time for retrieval with the time for the original insertion.

Reference no: EM131850306

Questions Cloud

Proponents of capm have concluded : Proponents of CAPM have concluded that all of the following are correct EXCEPT one:

Discuss the incentive system : At the end of the second week under this arrangement the boys are quarreling with each other and not happy with their dad. All of the disagreements revolve.

Compare required income all time by estimation of five years : compare the required income all the time by the estimation of 5 years ago.

Examine the role of leadership in the organization : Examine the role of leadership in the organization - Transactional Vs Transformational. Building the Adaptive Firm.

Create the data structure binary search tree : Create the data structure (binary search tree). Print the number of comparisons done and the CPU time used in part 3.

Write function build-tree for case when supply is a queue : Write function build_tree for the case when supply is a queue. Write function build_tree for the case when the input structure is a binary search tree.

Give a recap of your competitor profile for your business : Based on the results of your competitor search, give a recap of your Competitor Profile for your business.

Identify the federal income tax filing requirement : ACCT 408 - LUC Corporation Tax Return Problem. Identify the Federal Income Tax filing requirement. Prepare the required Federal Income Tax Return

Find which one of the five binary search trees : Find which one of the five binary search trees corresponds to each of the six possible ordered sequences of 1, 2, 3.

User Account

All Pages