COMP$-10205$ Data Structure and Algorithms

Assignment#$1$

The Thin Ice of Planet Clara

Arrays and Multi$-$dimensioned Arrays

$5\%$ of course grade

May $2023$

Submission Requirements

Complete the following assignment and submit electronically in the assignments folder on myCanvas

as an IntelliJ Project $$ Zip the entire folder $($Assignment$1.$zip$)$ and also submit the java source code

separately as a txt file $($Assignment$1.$java.txt$).$ This assignment must be completed individually.

Background

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

is represented as rectangular $2$D 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

$810//$ Rows and Columns of the first Ice Sheet

$600867797790716343255631252886$

$128259770951210444965545884581$

$647386310322442790918773217264$

$205399108100277987774525243368$

$617523226140470891533163669907$

$457779280446669391821960373773$

$800108826845150290545516217473$

$707929200543713899151948678200$

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.