Western Oregon University Page 1 of 2 CS-161.docx

Western Oregon University Page 1 of 2
CS-161 Assignment #7
General
Submit this lab using the Moodle system by the beginning of lab
on the due date.
solution.
(see Assignment 1).
not ask for extra input.
If a program says something like “ask the user for their name
and the number of hours they worked”
you MUST read in the name first, then the number of hours and
not prompt for any other input.
formatting, confusing variable names,
unnecessarily complex code, etc… will all result in deductions
to your score.
Climb Stats
Filename : assign7.cpp

Elevation information about a hike is recorded like the table
shown below indicating that the
hike starts at 1200 feet, after 1 mile is at 3000 feet, etc… This
hike is 8 miles and consists of 9
data points:
Mile 0 1 2 3 4 5 6 7 8
Elevation 1200 3000 3450 2800 2900 1550 1750 1110 1200
Write a program that declares in main:
const int HIKE_LENGTH = 9;
This will represent the number of data points in the hike (not
the number of miles). Then
declares an array of ints of size HIKE_LENGTH. (I should be
able to change the number of
elevation points your code is working with by changing that one
const.)
You should then read in HIKE_LENGTH elevations into the
array (assume we always input the
data in order: mile 0, then 1, then 2…). After doing so, print:
point in the second half of the
hike and the highest point overall in the hike. (If there are an
odd number of elevation
readings, count the middle point as being in the first half).
- mile markers higher than the markers
before and after it. (The first
and last markers will never be considered peaks).

- ones with an
elevation change over 1000
ft (going up or down)
change between each marker
and the next. Note that both up and down count as elevation
change here: going up 800
ft and then down 300 ft would be a total change of 1100 ft.)
Sample run:
Enter elevations: 1200 3000 3450 2800 2900 1550 1750 1110
1200
Highest points:
First half: 3450
Second half: 1750
Overall: 3450
Average elevation: 2106.67
Peaks: 3
Difficult segments: 2
Elevation change: 5280
Make sure to read the
required functions
below.

You should write and use the following functions to help do
your work. You can add
others as you see fit.
a) void getData(int heights[], int size)
Read elevation data into the array from the console.
Hint… while testing you might want to not use this function and
just hard code
some numbers into main:
int elevations[] = {1200, 3000, 3450, 2800, 2900, 1550, 1750,
1110,
1200};
Once you are done with the other functions or about to turn in
the assignment,
remove the hard coded array and call this function instead.
b) int getHighestPointBetween(const int heights[], int startMile,
int endMile)
Return the highest elevation between the two mile markers
(inclusive).
For the data shown above, asking for highest between 3 and 5
should result in
2900. Asking for the highest between 0 and 8 should result in
3450.
c) double getAverage (const int heights[], int size)
Return the average elevation.
d) int getNumPeaks(const int heights[], int size)
Return the number of peaks in the hike

e) int getNumSteepSegments(const int heights[], int size)
Return the number of segments that end with a change of more
than 1000 feet.
For the numbers shown above, there would be 2 steep segments
(from 0-1 and
4-5).
f) int getTotalChange(const int heights[], int startMile, int
endMile)
Return the total elevation change over the range from startMile
to endMile
(inclusive). Note that any change (uphill or downhill) is
positive change.
For example, using the sample data from earlier in the
document,
getTotalChange(elevations, 1, 3) should return 1100
From 1 to 2 we go from 3000 up to 3450 : a change of 450
From 2 to 3 we go from 3450 to 2800 : a change of 650
A solution without
these functions will take
a significant penalty
even if it produces the
correct output.

General
on the due date.
s with your
solution. Each program should be in a
separate file - they MUST be named exactly as specified in each
problem. Do not attach any other
files.
(see Lab1 or 2).
into all programs in the specified order. Do
to your score.
Concepts
Upon completion of this lab the student will be able to use
multidimensional arrays.
Assignment Instructions

WordSearch
Filename : assign8.cpp (This is the file name you MUST use
for the file you submit for this problem.)
OR
assign8.cpp, WordSearch.cpp, WordSearch.h (main in assign8
and helper functions in other files)
A word search is a puzzle where you try to find words hidden in
a large grid of characters like the one
below. The hidden words below are: double, heap, int, main,
program, stack, void
H B G Q W R G X X I
E Y U A S L J A W J
A X D V A B I N T H
P R O G R A M H A A
K L U O B M F J L W
P M B O M O M V T Q
J Z L V D N A Z H D
G Y E D V O I D F D
X L D M N M N O P A
S T A C K U V M J P
Write a menu driven program to help build a word search. Your
program should start with an empty

character grid and allow the user to build a puzzle. It should
have a menu with the following options:
1: Print key
2: Print puzzle
3: Add horizontal word
4: Add vertical word
5: Check horizontal fit
6: Space count
8: Quit
(7 is reserved for the optional challenge).
You MUST use these menu
options. Do not change the
order.
Do not worry about bad
input.
Hint: You can get your
menu system working
without worrying about
the rest of the problem.

Your program should ask the user for a number representing an
option, then perform that option. After
performing any option (other than 8), the user should get to
enter a new option. Below are descriptions
of the options. Each menu item should be implemented as a
separate function. It is fine to add other
functions, but you must have at least one function per option.
If you do not get a particular option working, just print out a
message to that effect (“Sorry, option 3 is not
available”) and allow the user to choose a new option.
Option 1:
Print out the current puzzle grid in a format like (blank squares
are shown as _ here, you can just print
spaces if you want or some other special character to indicate
blanks):
H _ _ _ _ _ _ _ _ _
E _ _ _ _ _ _ _ _ _
A _ D _ _ _ I N T _
P R O G R A M _ _ _
_ _ U _ _ _ _ _ _ _
_ _ B _ _ _ M _ _ _
_ _ L _ _ _ A _ _ _
_ _ E _ V O I D _ _
_ _ _ _ _ _ N _ _ _

S T A C K _ _ _ _ _
Option 2:
Print out the current puzzle grid, but fill empty spaces with
random characters:
H B G Q W R G X X I
E Y U A S L J A W J
A X D V A B I N T H
P R O G R A M H A A
K L U O B M F J L W
P M B O M O M V T Q
J Z L V D N A Z H D
G Y E D V O I D F D
X L D M N M N O P A
S T A C K U V M J P
Continues…
Do not actually modify the
puzzle grid, just print out
random chars instead of
_’s

Note – your grid should
start with all _’s. This is
what a partially filled grid
should look like.
Option 3:
Ask the user for a starting row (1-10), column (1-10) and a
word. If the word is too long to fit, print an
error message and return to the main menu. Otherwise, place it
in the grid going to the right starting from
the indicated location. You do not have to worry about
overlapping words, if the user tries to place one
word on top of another, go ahead and add the word and assume
they know what they are doing.
Initial State:
H _ _ _ _ _ _ _ _ _
E _ _ _ _ _ _ _ _ _
A _ _ _ _ _ _ _ _ _
P _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _

_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
Sample input 1:
Enter row: 3
Enter col: 1
Enter word: ENUM
Result (should NOT be automatically printed):
H _ _ _ _ _ _ _ _ _
E _ _ _ _ _ _ _ _ _
E N U M _ _ _ _ _ _
P _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _

_ _ _ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _ _ _
Sample input 2:
Enter row: 1
Enter col: 5
Enter word: PARAMETER
Result:
Print “Error, does not fit”
“assume the user knows
what they are doing” is a
bad idea in the real world
Option 4:
word. This should work just like placing a
horizontal word, but should place it going down starting from

the indicated location. Once again, if the
word is too long to fit, just print an error message and return to
the main menu. Also, do not worry about
existing words, overwrite anything that is there.
Option 5:
word. Verify if the given word can fit
horizontally in the indicated location. To “fit” a word needs to
physically fit and all the letters in the word
need to not change existing words in the grid.
Print either “Fits” or “Does not fit”. Do not actually place the
word.
Given this starting grid (colors to show areas):
H _ _ _ _ _ _ _ _ _
E _ _ _ _ _ _ _ _ _
A _ D _ _ _ I N T _
P R O G R A M _ _ _
_ _ U _ _ _ _ _ _ _
_ _ B _ _ _ M _ _ _
_ _ L _ _ _ A _ _ _
_ _ E _ V O I D _ _
_ _ _ _ _ _ N _ _ _
S T A C K _ _ _ _ _

Sample input 1 (Placing “MEMORY” in the green area. It
overlaps “MAIN”, but so that the “M”s match):
Enter row: 6
Enter col: 5
Enter word: MEMORY
Result:
Fits
Sample input 2 (placing “MEMORY” in the orange area where
it overlaps “MAIN” but letters do not match
up):
Enter row: 9
Enter col: 5
Enter word: MEMORY
Result:
Does not fit
Option 6:
Print out how many blank spaces there are in the current puzzle.
Given the grid shown in Option 5, your
program should print 70.
Option 8:
The program should end. Ideally, it should just exit normally by
finishing main. But you can also use this

line to kill the program:
exit(0);
Optional challenge:
Add an option 7. It should print out the size and location of the
largest horizontal opening in each row. If
there is a tie, print the first of the larges gaps. For the grid in
option 5 you would print:
Row Gap Size Start Col
1 9 2
2 9 2
3 3 4
4 3 8
5 7 4
6 3 4 (This ties with the gap at 7)
7 3 4 (Another tie)
8 2 1 (Another tie)
9 6 1
10 5 6
Debugging Tip:
Although your grid in the final program should start out with all
_ characters, it will probably make it
easier to test your program if you start it with some data. Use

something like this to initialize your 2D
array while testing:
{
{"H","_","_","_","_","_","_","_","_","_"},
{"E","_","_","_","_","_","_","_","_","_"},
{"A","_","D","_","_","_","I","N","T","_"},
{"P","R","O","G","R","A","M","_","_","_"},
{"_","_","U","_","_","_","_","_","_","_"},
{"_","_","B","_","_","_","M","_","_","_"},
{"_","_","L","_","_","_","A","_","_","_"},
{"_","_","E","_","V","O","I","D","_","_"},
{"_","_","_","_","_","_","N","_","_","_"},
{"S","T","A","C","K","_","_","_","_","_"}
};
Then when you are done, comment out or delete that code and
replace it with something to initialize the
grid to a totally empty one.
CS-161 Lab #5
General
on the due date.
solution. It MUST be named exactly as
specified in each problem. Do not attach any other files.

mment at the top
(see assignment 1).
to your score.
Assignment Instructions
Write a program that extracts information from a text file
containing information about images on a
website.
Your program should read from a file called Images.txt which
will consist of an unknown number of lines.
Each line consists of an image URL (web address), an MD5
hash identifying the image, and a file size in
bytes. Here is what a line might look like:
http://smugmug.com/thumbs/Lacus.jpeg?170x330
44cf8edbd53cf75be874604b39a7694c 21990
Note that the URL consists of “http://smugmug.com/thumbs/”
followed by a filename (“Lacus.jpeg”)
including extension, then a question mark and the width (170)

and height (330) of the image.
A sample data file is provided below this assignment link named
Images.txt
Note that this file has 5 lines, but when I test your program I
will not use this exact file. You cannot count
on there always being exactly 5 images. The file will end with
an empty line (like the sample file). Make
sure to test your program with more/less lines than 5.
Your program should print out an organized table that for each
image shows: the filename, image type
(the file extension), the width, the height and the size in kB
(1024 bytes in a kB) rounded to one decimal
place. It should then display the total size in kB of the images.
Something like:
Name Type Width Height Size
Lacus.jpeg jpeg 170 330 21.5
Vel.jpeg jpeg 300 220 10.4
ElementumNullam.png png 270 280 58.6
MontesNasceturRidiculus.jpeg jpeg 180 220 101.5
AtLorem.jpeg jpeg 200 240 21.6
Total Size: 213.6
Hints:
numbers, but if you
do, here is how to do so:

string foo = "123";
int x = stoi(foo); //convert string to int
string bar = "123.5";
double y = stod(bar); //convert string to double
Make sure that you read
the right input file name.
Capitalization counts!
DO NOT USE A HARD
CODED PATH to a
particular directory like:
"C:StuffImages.txt" Your
code must open a file that
is JUST called " Images.txt"
Do not submit the test file,
I will use my own.
General
on the due date.
(see Lab1).

all programs in the specified order. Do
to your score.
Concepts
Upon completion of this lab the student will be able to write
functions to break up a program into
reusable blocks.
Background
The last digit of a credit card number is always chosen to
provide a checksum of the other digits. (The
scheme used is called the Luhn algorithm:
http://en.wikipedia.org/wiki/Luhn_algorithm). If one digit in a
credit card is changed, or they are typed in the wrong order, the
checksum should detect the data entry
mistake.
To check a credit card number, you need to:
the digits, BUT for every second
digit, do the following to the digit

o If the number ends up being two digits, add the two digits (i.e.
that as the number
visible by 10, the number is valid. If
not, the number is invalid.
Samples:
Given the number "79927398713", we would start on the right
with the 3 - it would not be doubled, but
the 1 would be. Then 7 is not doubled, but 8 is…
Digit 7 9 9 2 7 3 9 8 7 1 3
Doubled 18 4 6 16 2
One
9 7 Sum
Digits added 7 9 9 4 7 6 9 7 7 2 3 70
Since 70 is divisibly by 10, it is possibly a valid credit card
number.
Given the number "12345671234567", we would start from the
7 on the right, it is not doubled, but the 6
is. Then 5 is not doubled, but 4 is…
Digit 1 2 3 4 5 6 7 1 2 3 4 5 6 7
Doubled 2 6 10 14 4 8 12

One
1 5 3 Sum
Digits added 2 2 6 4 1 6 5 1 4 3 8 5 3 7 57
Since 57 is not divisibly by 10, it is NOT a possibly valid credit
card number.
Also, you can use identify the issuer of a credit card with the
beginning digit(s):
http://en.wikipedia.org/wiki/Luhn_algorithm
Problem : Credit Card Checker
Write a program that reads in a string representing a credit card
number. It should then print out if the
number is valid and what kind of card it is.
Sample runs:

Run 1:
Enter card number: 79927398713
Valid number, unknown issuer
Run 2:
Enter card number: 43214321
Not a valid number, Visa
Required Functions:
You MUST create and use the following functions in your code:
Takes in a string as a parameter - prints that to the console, then
gets a string of input from the
console and returns the input.
Turns a char like '3' into the number it represents (3). Behavior
is undefined for chars that do not
representing digits.
er);
Processes a number to be doubled according to the rule for a
doubled digit in the Luhn
algorithm. Double the number and either return this value if the
number is still single digits, or
return the sum of the digits if it is a double digit number.
Calling doubledDigitValue(4) should
give 8. Calling doubledDigitValue(8) should give 7.
Sums the digits of a credit card number according to the Luhn
algorithm. i.e. Calling

sumOfDigits("79927398713") should result in 70. (This should
make use of charToInt and
doubledDigitValue.)
Hint: the algorithm is supposed to work from right to left. Start
by just printing out the string one
char at a time in reverse order. Then worry about actually
adding up their values. Don't forget
that every second one gets doubled.
Returns true/false indicating if a credit card number is
potentially a valid number according to
Luhn algorithm. (This should use a call to sumOfDigits!)
Returns a string representing the type of credit card a number
is: Visa, MasterCard, American
Express, or Unknown.
Each function (other than main) MUST be preceded by a
doxygen style comment consisting of at least:
@brief
@param for each parameter
@return (unless void)
A program that works but
does not use functions will
receive 0 pts.
Feel free to add more
functions, but you must at
least create and use the
listed ones.

Strategy:
You can and should build functions one by one and test them in
main. For example, to test getInput you
might write in your main function:
string card = getInput("Enter card number:");
cout << card << endl; //should be whatever you enter
Once you are sure that function is working correctly, you can
delete (or comment out) those tests and
start working on the next function – testing it as you go. Once
they are all written, you can write the "real"
main function… it should only take a few lines of code to
express.
Here is a diagram of how the functions should relate to each
other. It shows that main should at some
point call isValid and give it a string like "43214368". isValid
will do some work with that string and
eventually return true or false. As part of doing its work,
isValid should call sumOfDigits and pass it the
string representing the card number. sumOfDigits will return an
int like 45 based on doing the

Optional challenge:
Break out all your functions other than getInput into a file
"CreditFunctions.cpp". Declare them all in a file
"CreditFunctions.h" that is included from assign6.cpp.
assign6.cpp should now just have the getInput and
main functions. Submit all three files.
Do NOT worry about
solving the "problem" until
all your functions are
working.
You can and should make
use of functions to build
other functions!
Sample parameter/return
values are just SAMPLES –
do not try to hard code in
these values!!!

http://smugmug.com/thumbs/Lacus.jpeg?170x330
44cf8edbd53cf75be874604b39a7694c 21990
http://smugmug.com/thumbs/Vel.jpeg?300x220
3a5414349bd34657e58bd0603f6cdf0d 10689
http://smugmug.com/thumbs/ElementumNullam.png?270x280
ae4619f06272cb0b87d1eca49a84698b 59995
http://smugmug.com/thumbs/MontesNasceturRidiculus.jpeg?180
x220 00bb01dc4ea0c7bd929111c8f8511970 103889
http://smugmug.com/thumbs/AtLorem.jpeg?200x240
2042f0e5b7fc38c239b5f4ca447f6574 22108

Western Oregon University Page 1 of 2 CS-161.docx

Recommended

Recommended

More Related Content

Similar to Western Oregon University Page 1 of 2 CS-161.docx

Similar to Western Oregon University Page 1 of 2 CS-161.docx (19)

More from aryan532920

More from aryan532920 (20)

Recently uploaded

Recently uploaded (20)

Western Oregon University Page 1 of 2 CS-161.docx