The programming project involves writing a program that examines a file of polynomials and
determines whether the polynomials in that file are in strictly ascending order using two different methods of
comparison.
Project requirements can be found in Project 2 PDF File
Test Case Expected Output
Test Case
Expected Output
1
Strong Order: True
Weak Order: True
2
Strong Order: True
Weak Order: True
3
Strong Order: False
Weak Order: True
4
Strong Order: False
Weak Order: True
5
Strong Order: False
Weak Order: False
6
Strong Order: False
Weak Order: False
7
8
9
Strong Order: True
Weak Order: True
10
Criteria
Meets
Design
Polynomial class implements Comparable and Iterable interfaces
Polynomial object implemented with a singly linked list
OrderedList class provides required methods and does not duplicate code
Unchecked exception class included
Functionality
Accepts input file as specified and populates array list
Detects polynomials with invalid syntax and correctly displays error
Displays polynomials in the required format as they are read in
Correctly determines whether a polynomial file is sorted by the weak order
Correctly determines whether a polynomial file is sorted by the strong order
Test Plan
Test cases include a file in both strong and weak sorted order
Test cases include a file in weak but not strong sorted order
Test cases include a file in neither strong nor weak sorted order
Test cases include files with both kinds of syntax errors
Test cases include a polynomial with exponents of 0, 1 and 2 or more
Documentation
Correct UML diagram included
Lessons learned included
Comment blocks included with each Java file
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent