CSE2ALG / CSE5ALG: Algorithms and Data Structures Question Part 2, 2022…

CSE2ALG / CSE5ALG: Algorithms and Data Structures Question Part 2, 2022…
CSE2ALG / CSE5ALG: Algorithms and Data Structures
Assignment Part 2, 2022
Department of Computer Science and IT, La Trobe University
Assessment This part of the assignment is worth 15% of the final mark.
Deadline 12 May 2022THRUSDAY, at 23:59 PM.
Delays caused by computer downtime cannot be accepted as a
valid reason for a late submission without penalty. You must plan
to allow for both scheduled and unscheduled downtime. Late
submission policy does NOT apply to this assessment.
As this part of the assignment is worth 15% of the final mark for
this subject, please apply for Assessment Extension (Request for an
extension of time to submit an assessment task, Student administration,
La Trobe University) if you need request an extension of time for
submission.
Plagiarism Plagiarism refers to submitting somebody else’s work in a manner
that gives the impression that the work is your own, which is an
academic misconduct. The CSIT Department treats academic
misconduct seriously. When it is detected, penalties will be strictly
imposed.
Submission Assignment submission should be made through the subject site on
LMS. In the Assessment folder, there is an assignment submission
chute for Assignment Part 2.
Return of Result You will be notified with your mark soon after marking.
Restriction You are NOT allowed to use ANY of the classes in the Java
Collections Frameworks (JCF); the only exceptions are the
ArrayList class and the LinkedList class.
More details about the JCF can be found via the following link
(https://docs.oracle.com/javase/8/docs/technotes/guides/collection
s /overview.html).
Violating this restriction will lead to a mark of ZERO for this
part of assignment.
Marking Criteria You mark for this part of the assignment relates to the program’s
capability (i.e., whether being compiling and executing), the
program’s efficiency (i.e., how fast it produces the result), the
code’s quality (i.e., whether being reasonable and in good style),
and the submission’s accomplishment (i.e., whether satisfying the
task requirements).
Description of Tasks
This part of the assignment is an extension of the part 1. Whereas for part 1 we
considered the correctness only, we are concerned with the efficiency for this part.
Specifically, you are required to accomplish the tasks described below. Besides the
description below, please refer to the instruction of part 1 for any information you need.
Task 1 Design and implement the program LexiconTester.java. This program will
1. Read one text file using the first command-line argument and
construct a lexicon that contains words from the file. Suppose the
input the file is in.txt, the command will execute as follows: java
LexiconTester in.txt
2. Write the words, including spellings, frequencies and neighbors,
from the lexicon to the text file out.txt. The format must be the
same as in the part 1 of the assignment.
3. Include only one solution. It is entirely up to you which data
structure(s) and/or sorting algorithm(s) will be used, as long as
they are included in the subject; however, you must take the
program’s efficiency in consideration, as the test file is much
larger in this part.
4. In principle, you program MUST accomplish the task less than 60
seconds on the latcs8 server.
Task 2 Write a report LexiconReport.pdf in the PDF format. This report will
1. Describe which data structure(s) and/or sorting algorithm(s) are
selected; if they are different from those in the part 1, describe the
reason for your choice.
2. Describe the time complexities (i.e., the Big-Oh) of the involved
data structure(s) and/or sorting algorithm(s) in the best, worst and
average cases.
3. Describe any strategies or tricks from you to improve the
program’s efficiency in addition to the choice on data structure(s)
and/or sorting algorithm(s).
Note Submitting additional Java files as auxiliaries is allowed, as long as these
files are created originally by you and can compile on the latcs8 server.
CSE2ALG / CSE5ALG Assignment Part 2: Marking Sheet
Semester 1, 2021
Mark Max
1 Use any of the classes in the JCF, other than the ArrayList class and the
LinkedList class.
-100
Task 1: LexiconTester.java (Max Mark: 85)
Section 1: Blackbox Testing (Max Mark: 70, If the program takes more than 60 seconds to
accomplish the task, the mark given in Section 1 will NOT exceed 30.)
2 javac LexiconTester.java
No error occurs when the program compiles. If other java files are
submitted, then all files must compile.
10
3 java LexiconTester in.txt
No error occurs when the program runs, and out.txt is created.
(If the program takes more than 60 seconds to accomplish the task, the
rest criteria in Section 1 will be skipped.)
5
4 The program accomplishes the task and terminates efficiently.
Suppose the time usage is denoted by t (seconds),
• If t=10, the mark is 40;
• If 10
If 30
• If 50
• If t>60, the mark is 0.
40
5 In out.txt, words and neighbours are all available and ascendingly
sorted. Each exception results in deduction of 1 mark.
5
6 In out.txt, word frequencies are all available and calculated correctly.
Each exception results in deduction of 1 mark.
5
7 In out.txt, neighbours are all available and selected correctly. Each
exception results in deduction of 1 mark.
5
Section 2: Code Checking (Max Mark: 15)
9 Code is reasonably written (i.e., it contains necessary classes and
functions, indicating the author made efforts to accomplish).
8
10 Code is in a good programming style (i.e., it helps one to read and
understand code and to avoid introducing errors).
7
Task 2: LexiconReport.pdf (Max Mark: 15)
11 The report describes the involved data structure(s) and/or algorithm(s)
(including their time complexity).
8
12 The report describes strategies or tricks to improve the program’s
efficiency in addition to the involved data structure(s) and/or sorting
algorithm(s).
7
Total 100
Attachments: alg-2022-assi….pdfMay 16 2022 12:38 PM

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
Open chat
1
You can contact our live agent via WhatsApp! Via + 1 (409) 205-8984

Feel free to ask questions, clarifications, or discounts available when placing an order.

Order your essay today and save 30% with the discount code DISCOUNT