The main goal of this assignment is to develop a Java application based on the S
ID: 3575883 • Letter: T
Question
The main goal of this assignment is to develop a Java application based on the SWING framework and the APIs for 2D Graphics. On this application a user will be able to choose between 2 books and view all the statistics related to words that are outlined below. Users should be allowed to select each book separately. The result of the analysis should be displayed using 2D representations.
The application should be built using 2 panels:
the first one, based on SWING, responsible to select a book and run the various statistics
the second one responsible to show the results of the data using custom graphics representations. The visualization of the data should be based on at least 2 symbols (e.g. a bar is a symbol)
When building the layout of the application make sure to outline an interface that is as user friendly as possible. No third party libraries are allowed in this project.
Words Statistics
The following statistics should be calculated after you removed the “stop words” (i.e. the most common words that are not relevant to the analysis). Please use this list of “stop words” for this task.
Statistics:
length (# of words) of each chapter
word count (i.e. both total and unique) and density
new words that appear in each chapter
most common words
Note: word density can be calculated as the percentage of times that word appears in the book compared to the total number of words
Sources for books
https://www.gutenberg.org/
https://archive.org/details/texts
Explanation / Answer
A cut is most if the scale of the cut isn't smaller than the scale of the other cut. The illustration on the correct shows a most cut: the scale of the cut is adequate five, and there's no cut of size vi, or |E| (the variety of edges), as a result of the graph isn't bipartite (there is Associate in Nursing odd cycle).
In general, finding a most cut is computationally exhausting.[2] The max-cut downside is one amongst Karp's twenty one NP-complete issues.[3] The max-cut downside is additionally APX-hard, that means that there's no polynomial-time approximation theme for it unless P = NP.[4] but, it is approximated to inside a continuing approximation magnitude relation exploitation semidefinite programming.[5]
Note that min-cut and max-cut don't seem to be twin issues within the applied mathematics sense, even if one gets from one downside to different by ever-changing min to goop within the objective operate. The max-flow downside is that the twin of the min-cut downside
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.