cs102 lab5
http://www.maths.nuigalway.ie/~gettrick/teach/cs102/labs/l5.html
-
For this lab you must submit all source code (python
files), and, if applicable, the result(s) of running the program on (a few)
test cases.
This should be sent in via BLACKBOARD (not directly by email).
The source code must
be well presented (indenting, spaces, reasonable variable/function names,
etc.) and must include comments (as a rough guideline - aim to have nearly as
many comments as lines of code). Any questions asked should be answered
by typing the answers into the relevant box on the
BLACKBOARD upload form.
-
This material should be uploaded
before
the deadline of 5pm
Friday March 7th, 2014. You will lose 20% for each day
(or part of day) the lab is late. If you have a genuine reason for
submitting a late lab, please contact Lucas before the lab
due date/time.
-
Plagiarism (the unattributed copying of work from other sources
(internet, fellow students,....)) will not be tolerated. Please see
http://www.nuigalway.ie/engineering/documents/plagiarism_guide_students
_v4.pdf. You risk getting zero for your lab if it is found to be
plagiarized.
Consider the (20x20) array of numbers here.
Lets say this represents a matrix A of distances (in kilometers) between
cities. Note that A is symmetric A(i,j) = A(j,i) and all its diagonal
elements are zero. Suppose Vladimir from city i and Petra from city j want
to meet up in some third city k (i, j and k are all different).
Conscious about their carbon footprint (!), they want k to be as near as
possible: specifically the sum of the distances both has to travel
should be minimum. Given i and j, write a program in PYTHON that
determines what k should be. (In PYTHON you can store the matrix as
a list of lists). Do not worry in your program about
"reading in" A: Just hard-wire it in to the code.
You should read in from the user the
two cities (i and j) where Vladimir and Petra live.
From your program, calculate the answer for
©
NUI, Galway