How do you do the last page?. How do you make the picture with the trail. I\'ve coded everything but that need help with how to change the numbers in the matrix to produce the correct trail. Coded in C please. How Do u code the function ask of on the last page? CS 100 Project Six-Fall 2016 Project Ovenicy: The world is not flat, despite what the Flat Earth Society hupsLAww:a.theflatearthsociety.org) says. There are lots of hills and valleys out there. Given this, mankind has spent considerable time and effort measuring the exactelevation above sea level for each on the earth You can view these elevation maps as a two- dimensional grid. A sample elevation shown below: 100 110 120 105 115 100 105 115 110 100 105 115 95 120 120 98 95 110 125 130 135 100 110 120 130 135 145 Obviously, elevations get higher in the mountains, and approach zero as you near the ocean. This program reads a set of elevation data and: 1. Generates a simple image from this clevation data, a black-and-white image where higher clevations have a darker shade than lower elevations. 2. Identifies a path across this grid. The path can be North-to-South, South-to-North, East-to-West, or West- to East. To find this path, you vant to minimize your clevation gain (climb). In other words, you don\'t want to walk uphill any more than necessary. Instead, you want to go as much as possible, a steep downhill path is viewed as optimal. You will generate a second image file with the recommended trail. To generate a black-and-white (grayscale) picture of this elevation data, we will use a graphics format that uses ASCII (text files. Most graphics programs use binary files (gif,jpeg, etc) which promote smaller fle sizes. Since this is just CS 100, well stick with ASCII (text) files, even though they take more space. The ASCII format we use is called pgm, and is shown P2 at the right. The first line is always P2. After that, you width inpix have three values (width, height, grayscale levels that pixels value (always 2SS for this project) maximum grayscale can be on a single line or separate lines. Finally, you pixel-11- intensity pixel-1-2-intensity pixel-1-3-intensity have the actual pixel values for each pixel in the image. pixel-2-1-intensity pixel2-2-intensity pixel-2-3-intensity A pixel with a value of 0 is black (absence of light and a pixel with a value of 255 is white (all light pielN-1 intensity pixelN-2- intensity pixel-N-3intensity This project involves taking a set of elevations and making a grayscale image from these elevations, and then drawing a second image that includes a trail across the grid. You are crcating two PEm images. Both of these images will use 255 as the maximum grayscale value (values range from 0-255) The first image is simply a map of the clevations. So that we can mark a visible trail on this map part two), we will map all the clevations in our input file to a value in the range of 55255. By doing this, placing a trail of color 0 (black) is easily visible o.

1. How do you do the last page?. How do you make the picture with the trail. I've coded
everything but that need help with how to change the numbers in the matrix to produce the
correct trail. Coded in C please. How
Do u code the function ask of on the last page? CS 100 Project Six-Fall 2016 Project Ovenicy:
The world is not flat, despite what the Flat Earth Society hupsLAww:a.theflatearthsociety.org)
says. There are lots of hills and valleys out there. Given this, mankind has spent considerable
time and effort measuring the exactelevation above sea level for each on the earth You can view
these elevation maps as a two- dimensional grid. A sample elevation shown below: 100 110 120
105 115 100 105 115 110 100 105 115 95 120 120 98 95 110 125 130 135 100 110 120 130 135
145 Obviously, elevations get higher in the mountains, and approach zero as you near the ocean.
This program reads a set of elevation data and: 1. Generates a simple image from this clevation
data, a black-and-white image where higher clevations have a darker shade than lower
elevations. 2. Identifies a path across this grid. The path can be North-to-South, South-to-North,
East-to-West, or West- to East. To find this path, you vant to minimize your clevation gain
(climb). In other words, you don't want to walk uphill any more than necessary. Instead, you
want to go as much as possible, a steep downhill path is viewed as optimal. You will generate a
second image file with the recommended trail. To generate a black-and-white (grayscale) picture
of this elevation data, we will use a graphics format that uses ASCII (text files. Most graphics
programs use binary files (gif,jpeg, etc) which promote smaller fle sizes. Since this is just CS
100, well stick with ASCII (text) files, even though they take more space. The ASCII format we
use is called pgm, and is shown P2 at the right. The first line is always P2. After that, you width
inpix have three values (width, height, grayscale levels that pixels value (always 2SS for this
project) maximum grayscale can be on a single line or separate lines. Finally, you pixel-11-
intensity pixel-1-2-intensity pixel-1-3-intensity have the actual pixel values for each pixel in the
image. pixel-2-1-intensity pixel2-2-intensity pixel-2-3-intensity A pixel with a value of 0 is black
(absence of light and a pixel with a value of 255 is white (all light pielN-1 intensity pixelN-2-
intensity pixel-N-3intensity This project involves taking a set of elevations and making a
grayscale image from these elevations, and then drawing a second image that includes a trail
across the grid. You are crcating two PEm images. Both of these images will use 255 as the
maximum grayscale value (values range from 0-255) The first image is simply a map of the
clevations. So that we can mark a visible trail on this map part two), we will map all the
clevations in our input file to a value in the range of 55255. By doing this, placing a trail of color
0 (black) is easily visible on our map The second image is the same as the first, with the addition
of a trail (seriesofpixelswith a value of 0-black) that illustrates the trail to take across the grid
Nonh-South or South-North or East-West or West-East). As an example of how this project

2. works, consider the 5x6 grid shown below on the left, named data. The first two values are the
number of rows and columns in the grid (file). Typing ./a.out data W-E first converts this grid to
the data file shown in blue (middle, and then generates the vest-to-cast' data-trail file shown in
red (right 255 255 100 110 120 115 105 115 235 195 155 175 215 175 235 195 155 175 0 175
100 105 115 110 115 110 235 215 175 195 175 195 235 215 175 0 175 95 100 105 115 120 120
255 235 215 175 155 155 0 235 0175 155 155 98 95 110 125 130 135 243 0 195 135 115 243
255 195 135 115 95 95 100 110 120 130 135 145 235 195 155 115 95 55 235 195 155 115 95 55
Solution
A non-redundant disk array, or RAID level zero, has very cheap price of any RAID organization
as a result of it doesn't use redundancy the least bit. This theme offers the most effective
performance since it ne'er must update redundant info. astonishingly, it doesn't have the most
effective performance. Redundancy schemes that duplicate information, like mirroring, will
perform higher on reads by by selection programming requests on the disk with the shortest
expected request and movement delays. Without, redundancy, any single disk failure can lead to
data-loss. Non-redundant disk arrays ar wide utilized in super-computing environments wherever
performance and capability, instead of dependability, ar the first issues.
The traditional resolution, referred to as mirroring or shadowing, uses doubly as several disks as
a non-redundant disk array. whenever information is written to a disk identical information is
additionally written to a redundant disk, in order that there ar forever 2 copies of the knowledge.
once information is browse, it is retrieved from the disk with the shorter queuing, request and
movement delays. If a disk fails, the opposite copy is employed to service requests. Mirroring is
often utilized in information applications wherever handiness and dealings time ar additional
necessary than storage potency.A non-redundant disk array, or RAID level zero, has very cheap
price of any RAID organization as a result of it doesn't use redundancy the least bit. This theme
offers the most effective performance since it ne'er must update redundant info. astonishingly, it
doesn't have the most effective performance. Redundancy schemes that duplicate information,
like mirroring, will perform higher on reads by by selection programming requests on the disk
with the shortest expected request and movement delays. Without, redundancy, any single disk
failure can lead to data-loss. Non-redundant disk arrays ar wide utilized in super-computing
environments wherever performance and capability, instead of dependability, ar the first issues.
The traditional resolution, referred to as mirroring or shadowing, uses doubly as several disks as
a non-redundant disk array. whenever information is written to a disk identical information is
additionally written to a redundant disk, in order that there ar forever 2 copies of the knowledge.

3. once information is browse, it is retrieved from the disk with the shorter queuing, request and
movement delays. If a disk fails, the opposite copy is employed to service requests. Mirroring is
often utilized in information applications wherever handiness and dealings time ar additional
necessary than storage potency.