[Solved] ADS Project 5-Text concordance using BST

$25

File Name: ADS_Project_5-Text_concordance_using_BST.zip
File Size: 376.8 KB

SKU: [Solved] ADS Project 5-Text concordance using BST Category: Tag:
5/5 - (1 vote)

Rate this product

1 Project description

See the description of this problem in the book for further details.

Write a cross-reference program that constructs a binary search tree (any type, including splay tree) with all words included from a text file and records the positions (word or line numbers) on which these words were used. These line numbers should be stored on linked lists associated with the nodes of the tree. After the input file has been processed, print in alphabetical order all words of the text file along with the corresponding list of numbers of the lines in which the words occur.

2 What to turn in

You will turn in

1. a short written report containing: A description of the significant choices/issues in the design of your code.

2. Thesourcecodeofyourprogram.You may turn in the document via elearning.e-uvt.ro (Class moodle).

3 Coding standards

Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Shopping Cart
[Solved] ADS Project 5-Text concordance using BST
$25