COMP – 10205 – Data Structures and Algorithms

Description

You are to develop a program that will analyzedata collected from ice sheets on Planet Clara. The data

Don't use plagiarized sources. Get Your Custom Assignment on
COMP – 10205 – Data Structures and Algorithms
From as Little as $13/Page

is represented as rectangular 2D readings of a combined integer value that represents ice hardness and
thickness. We call these values ht values. The higher the individual readings the more stable the ice is
at that location. An example data set representing a single Ice Sheet is shown below:
1 // Number of Ice Sheets
8 10 // Rows and Columns of the first Ice Sheet
600 867 797 790 716 343 255 631 252 886
128 259 770 951 210 444 965 545 884 581
647 386 310 322 442 790 918 773 217 264
205 399 108 100 277 987 774 525 243 368
617 523 226 140 470 891 533 163 669 907
457 779 280 446 669 391 821 960 373 773
800 108 826 845 150 290 545 516 217 473
707 929 200 543 713 899 151 948 678 200
Part A: Fracture Points
We are concerned with the possibility of the ice sheets cracking and have determined that any ht value
less than or equal to 200 and evenly divisible by 50 is a potential fracture point in an ice sheet. In the
example shown above there are 4 fracture points.
Find all of the fracture points on all of the ice sheets provided in ICESHEETS.TXT. There are 13 sheets of
various sizes. Report the total number of potential fracture points for all sheets and also report the
number of fracture points on the ice sheet that has the most fracture points and the sheet number
with the most fracture points.

Part B: Cracks
Now that all of the fracture points have been determined we want to know which fracture points could
lead to a crack. Further research has determined that any connecting point to a fracture point that is
evenly divisible by 10 could potentially lead to a crack. A connecting point can be connected to the
left, right, top or bottom and also includes any point connected diagonally. Any point not on an edge
will have 8 connecting points, while edges will have 5 and corners 3.
How many fracture points could lead to a crack in the ice? For the example data set we are showing
these points with a Red Highlighted background with the point that is divisible by 10 highlighted in
yellow. In the example data set there are two fracture points that could lead to a crack in the ice.
Provide a summary of each Crack Point by providing the sheet # and the crack point location. What is
the fraction of fracture points that are also a crack. For example, if there are 50 total fracture points
and 15 of these are crack points the fraction of cracks point would be 0.300. Report your result to 3
decimal places.
1
8 10
600 867 797 790 716 343 255 631 252 886
128 259 770 951 210 444 965 545 884 581
647 386 310 322 442 790 918 773 217 264
205 399 108 100 277 987 774 525 243 368
617 523 226 140 470 891 533 163 669 907
457 779 280 446 669 391 821 960 373 773
800 108 826 845 150 290 545 516 217 473
707 929 200 543 713 899 151 948 678 200
Solution guidelines:
• You may only use Arrays (single, multi-dimensional) as the data structure for your solution. No
ArrayLists, Hashmaps or other data structures may be used.
• You are expected to use modular programming (static methods) to break up the program into
multiple parts.
• You are expected to document your code including javadoc for each of the methods provided.

NOTE: Please provide me the solution of the following problem using JAVA code. DO NOT use any AI tools to write the program. Use basic JAVA programming as it is a college-level project. The code must be handwritten. Send me the JAVA file only.