MARINE BIOLOGY CASE STUDY LAB - PART 2 Analysis 1. By running the programming with a fish. dat file containing the information for a 2 x 2 tank size, and changing the starting positions for fish A, B, and C, according to the problem, I was able to evaluate the random sequence of steps taken by each fish. The fish move in sequence of A, B, and then C. Then they move according to open slots. If a fish is covered on both sides by another fish, it is unable to move and, therefore, stays in that exact position.

Analysis 2. The following is a diagram of what we predicted for the outcome of the default configuration: A C E B HD F GAnd this is a diagram of where the fish actually moved to when running the program with the current configuration: A C ED B HF G My prediction was inaccurate because I did not move the fish in their correct order. Instead, I proceeded to move the fish in the order of whichever came closer to an open space. Analysis 3. The 1000 x 1000 matrix was unable to display any data visible to the user on the console. It exceeds the screens limit of display.

I discovered that the largest matrix possible for the console would be a matrix with the size of 23 x 79. Every time that I ran the program with these specifications, I found that the fish always traveled the first step down (a total of 10 tries). Analysis 4. When that data file contains two fish located within the same spot, the executable displays at the top of the console error, attempt to create fish at non-empty: (4, 4), and then goes on to only display the first fish, A. Analysis 5. The sequence of fish positions does matter when you want certain fish names at certain locations within the tank.

For example, in these different data files, B will be located at (1, 1) in the first file, and (2, 1) in the second. Also, the sequence determines which fish travels within the tank first. Therefore, if it is pertinent that the names of certain fish be in exact locations, the sequence of initialization does matter. Analysis 6. SEE PROGRAM.