Write a Java program called WordMatch.java. This program takes four command-line arguments. For example: java WordMatch in1.txt out1.txt in2.txt out2.txt
1. The ﬁrst is the name of a text ﬁle that contains the names of AT LEAST TWO text ﬁles (each per line) from which the words are to be read to build the lexicon (The argument is to specify the input ﬁles). 2. The second is the name of a text ﬁle to which the words in the lexicon are to be written (The argument is to specify the ﬁle containing the words and the neighbors in the lexicon). 3. The third is the name of a text ﬁle that contains ONLY ONE matching pattern (The argument is to specify the file containing the matching pattern). 4. The fourth is the name of the text ﬁle that contains the result of the matching for the given pattern (The argument speciﬁes the ﬁle containing the output).
For this version, the efﬁciency with which the program performs various operations is a major concern, i.e. the sooner the program performs (correctly), the better. For example, the ﬁles read in can be quite long and the lexicon of words can grow to be quite lengthy. Time to insert the words will be critical here and you will need to carefully consider which algorithms and data structures you use. You can use any text ﬁles for input to this program. A good source of long text ﬁles is at the Gutenberg project (www.gutenberg.com) which is a project aimed to put into electronic form older literary works that are in the public domain. The extract from Jane Austen’s book Pride and Prejudice used as the sample text ﬁle above was sourced from this web site. You should choose ﬁles of lengths suitable for providing good information about the efﬁciency of your program. A selection of test ﬁles have been posted on LMS for your efﬁciency testing. You can consider additional test ﬁles if you wish. As expected, the deﬁnition of a word, and the content of a query’s result and display of this result are exactly the same as what described in Assignment Part 1. All the Java ﬁles must be submitted. The program will be marked on correctness and efﬁciency. Bad coding style and documentation may have up 5 marks deducted.
Task 2 (CSE5ALG students only)
Consider the B-trees of order M . Assume that we have the following result, which we will refer to as Lemma 1.
⌉.Lemma 1: The barest B-tree of height H contains N = 2K H − 1 elements, where K = ⌈M 2
Determine the height’s upper bound for a B-tree of order 23 which has 10, 000, 000 = 107 elements. You must give an integer value as the height’s upper bound for the B-tree. You are not allowed to use the result given in the lecture regarding the upper bound for Btree’s height. Instead, you must work out the answer using Lemma 1 above.
Note: The total mark for Part 2 will be 100 for CSE2ALG students and 125 (100 for Task 1 and 25 for Task 2) for CSE5ALG students. The percentage of contribution to the ﬁnal will be the same, i.e. 20%.
In your solution to Task 2, as well as in every Java class, you must include your student ID and name, and the subject code.
How to submit your solution to Task 2: Your solution should be a PDF ﬁle named Task2.pdf, and be submitted using the same command submit ALG, i.e. submit ALG Task2.pdf
We value our customers and so we ensure that what we do is 100% original..
At Custom Writing, we believe in exemplary services that are fully geared toward customer satisfaction. That is why we don’t shy away from giving you the following guarantees;
Trusting us with your work is the best decision you have made, our pleasure lies in seeing you satisfied at 100%. If in the rear chance it happens that you are not satisfied, then know that we will equally not be satisfied. But worry not, our 30 days- Money back guarantee is all you need and that is what we promise you..Read more
We utilize profoundly equipped and gifted writers who produce unique papers liberated from any form of plagiarism. To guarantee this, we run all papers finished by our scholars through a Plagiarism checker to ensure uniqueness and originality. In any case, on the off chance that you have vulnerabilities about the originality or falsification of any paper we have finished and conveyed to you, please get in touch with us straight away. We will quickly investigate, and if the paper is seen as counterfeited, we will take suitable actions including but not limited to, revising the paper for free and in extreme cases we will activate the money back guarantee.Read more
We have an obligation deliver great and specially composed assignments. Our revision strategy endeavors to ensure total client satisfaction, comfort, and a genuine feelings of serenity. We make minor updates and corrections to the underlying request as part of our continuous assistance. However, revisions should just incorporate changes and alterations that were not effectively met, in the underlying request and that are inside the rules as per the current request structure..Read more
Our client's Data is an Integral part of our business but clearly, we are not in the business of offering our clients' very own data to others. We realize that you care how your online data is utilized and shared, we equally value your trust that we will do so cautiously and sensibly. We Promise to ensure the security of your own data during transmission by utilizing encryption conventions and programming. Likewise assist us with securing your information by not sharing your passwords and usernames.Read more
In submitting a request with us, you consent to the services we give. We will strive to take the necessary steps to convey a far reaching paper according to your prerequisites. Equally we depend on your cooperation to guarantee that we convey on this order.Read more