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
Why Work with Us
Top Quality and Well-Researched Papers
We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.
Professional and Experienced Academic Writers
We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.
Free Unlimited Revisions
If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.
Prompt Delivery and 100% Money-Back-Guarantee
All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.
Original & Confidential
We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.
24/7 Customer Support
Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.
No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.
No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.
Admission Essays & Business Writing Help
An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.
Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.
If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.