1
Summer 2017
Assignment 4 Individual Assignment - Due June27, 2017
(400 Points)
Part I (200 points)
In this assignment, you will be performing some important data-processing
operations, specifically sorting a large database file. Sorting data is a very
important operation in computing for many reasons. One of those reasons is that it
makes the data more accessible to humans once it is printed (imagine trying to use
a telephone directory in which the names do not appear in any particular order).
Another reason is that it makes the data more quickly searchable by the computer.
There are many large data files to use for this assignment, but you will
only need the first one until you get on to the advanced parts. They are all
available on blackboard, and are named people1.txt, people2.txt, people3.txt,
people5.txt, people10.txt, people20.txt, people30.txt, people50.txt, and
people100.txt.
Look at the file "people1.txt" with a text editor. You will see that it
contains data about a number of people. Each line contains exactly five items: a
person’s social security number, their first name, their last name, their date of
birth, and state of residence. The five items are separated by spaces, but no item
will ever contain a space. Here is a sample from the middle of thefile:
320990814 Arthur Farmer 19560424 NV
322230050 Eros Crandon 19250819 TX
324640114 Lusitania Lissom 19440104 IN
325400784 Rose Terwilliger 19260122 WI
327640597 Jeffrey Stone 19760801 DE
327950765 Mary Emmett 19290224 CO
328610085 Heironymous Inchworm 19661102 CA
329310410 William McCormick 19550819 WV
329320248 Nicola Birchmore 19230107 IA
330270343 Pauline McTaggart 19290402 MN
331130693 Jim Trombone 19411222 NE
331960453 Abraham Larch 19750901 WY
332040687 Trixie Underwood 19200516 UT
As you may have noticed, the date of birth is provided as a single integer, in the format
yyyymmdd; Arthur Farmer was born on the 24th of April 1956. The 1 in the filename
people1.txt indicates that it contains exactly one thousand lines.
2
1. Read the Data
Write a program that creates a list large enough to hold all the data, then reads all the data
from the file into that list. Of course, it will have to be a list of structs that you will also
need to define. Make your program close the file, then print out the first 10 items of data from
the list, so that you can make sure everything was read correctly.
2. Basic Search
Make your program ask the user to enter a name. It should then search through the data in
the list (don’t read the file again), finding any entry with a matching name. Correct matches
with either first or last name should be accepted. For every matching entry that is found, print
out all four data items: the social security number, first and last names, and date of birth of
each matching person.
Remember that if you use the == operator to compare strings, the test is case-sensitive.
The user (i. ...
1. 1
Summer 2017
Assignment 4 IndividualAssignment - Due June27,
2017
(400 Points)
Part I (200 points)
In this assignment, you will be performing some important data-
processing
operations, specifically sorting a large database file. Sorting
data is a very
important operation in computing for many reasons. One of
those reasons is that it
makes the data more accessible to humans once it is printed
(imagine trying to use
a telephone directory in which the names do not appear in any
particular order).
Another reason is that it makes the data more quickly
searchable by the computer.
There are many large data files to use for this assignment,
but you will
only need the first one until you get on to the advanced parts.
They are all
available on blackboard, and are named people1.txt,
people2.txt, people3.txt,
people5.txt, people10.txt, people20.txt, people30.txt,
people50.txt, and
people100.txt.
2. Look at the file "people1.txt" with a text editor. You will see
that it
contains data about a number of people. Each line contains
exactly five items: a
person’s social security number, their first name, their last
name, their date of
birth, and state of residence. The five items are separated by
spaces, but no item
will ever contain a space. Here is a sample from the middle of
thefile:
320990814 Arthur Farmer 19560424 NV
322230050 Eros Crandon 19250819 TX
324640114 Lusitania Lissom 19440104 IN
325400784 Rose Terwilliger 19260122 WI
327640597 Jeffrey Stone 19760801 DE
327950765 Mary Emmett 19290224 CO
328610085 Heironymous Inchworm 19661102 CA
329310410 William McCormick 19550819 WV
329320248 Nicola Birchmore 19230107 IA
330270343 Pauline McTaggart 19290402 MN
331130693 Jim Trombone 19411222 NE
331960453 Abraham Larch 19750901 WY
332040687 Trixie Underwood 19200516 UT
As you may have noticed, the date of birth is provided as a
single integer, in the format
yyyymmdd; Arthur Farmer was born on the 24th of April 1956.
The 1 in the filename
people1.txt indicates that it contains exactly one thousand
lines.
3. 2
1. Read the Data
Write a program that creates a list large enough to hold all the
data, then reads all the data
from the file into that list. Of course, it will have to be a list of
structs that you will also
need to define. Make your program close the file, then print out
the first 10 items of data from
the list, so that you can make sure everything was read
correctly.
2. Basic Search
Make your program ask the user to enter a name. It should then
search through the data in
the list (don’t read the file again), finding any entry with a
matching name. Correct matches
with either first or last name should be accepted. For every
matching entry that is found, print
out all four data items: the social security number, first and last
names, and date of birth of
each matching person.
Remember that if you use the == operator to compare strings,
the test is case-sensitive.
The user (i.e. you) will have to type the name exactly correctly,
with capital letters in the right
places.
Important: Good clean design will make this lab much easier.
Write a separate function
that searches the list, do not put all the work in main.
4. 3. Find the Oldest
Modify your program so that after closing the file, instead of
printing the first ten items of
data, it searches through all of them to find the oldest person
represented. It should print the
social security number, first and last names, date of birth, and
state of the oldest person found.
Important: As for part two, good clean design will make this lab
much easier. Write a
separate function that searches the list to find the oldest person,
do not put all the work in
main.
4. Promote the Oldest
For some unfathomable reason, the management wants the
oldest person to occupy the
first position in the list. Modify your program so that after
finding the oldest person, it swaps
his or her data with the data already occupying the first position
in the list. Remember that the
first position in a list is numbered zero, not one.
5. Now Promote the Second Oldest.
The management has now decided not only that the oldest
person must occupy the first
position in the list, but also that the second-oldest person must
occupy the second position in
the list. So, after searching for the oldest and moving their data
to the front of the list, now
search the remainder of the list (all except the first element),
5. and move the oldest person you
find (which must be the second oldest of all) into the second
position of the list. Make sure
you swap data, so that whoever was originally in the second
position is not lost.
3
6. More of the Same.
The management are going to keep on adding requirements like
this, next putting the third-
oldest in the third position, then the fourth, then the fifth. There
is no knowing when they will
grow out of this petty obsession, so make things easier for
yourself. Modify your search
function so that it can be told how much of the list to search.
That is, give it two int
parameters (let’s call them a and b); its job is now to search
only the portion of the list
between position a and position b, to find the oldest person
therein. This makes it very easy to
search the remainder of the list to find the second and third
oldest.
7. The Ultimate Demand.
Now the management make their final demand. You are to
repeat the process of moving
the nth-oldest person into the nth position 1000 times. (please
remember, 1000 is the number
of data records in the whole file).
6. This will result in the list being completely sorted. Do it, and
check that it worked. Make
your program print the contents of the list after it has finished.
Look at the output to make sure
that everyone is printed in order of their age.
Try to implement your own selection sort function – instead of
using the Python sort.
8. Sorting the File.
Once you have sorted the contents of the list, it might be a good
idea to save the sorted
data in a file. Make your program create a new file, and write
all the contents of the list into
that file in a sensible format. Use a text editor to look at the file
and verify that it has the same
format as the original file, and all the data is properly sorted.
9. How Fast Is It?
It is important to know how long computer operations are going
to take when they have to
work on a large amount of data.
Use a function (twice) to time how long it takes the computer to
sort the list of 1000 data
items. Do not include the time it takes to read the file or the
time it takes to write the new file,
just the pure sorting time. Note the time that you observe.
7. Now you know how long it takes to sort a database of 1000
items. How long do you
think it would take to sort a database of 2000 names? 3000
names? 10,000 names?
Think about those questions, and work out what you believe the
answer is. Then find out
what the real answer is. The other files have exactly the same
format as people1.txt, but are
longer. PeopleN.txt contains N thousand data records. If your
program was nicely
written, it will be a few seconds’ work to change the list size
and make it read a different
file.
See how long it takes to sort these larger files, and compare the
results to your
predictions. If your predictions weren’t substantially correct,
make sure you understand
4
why. You have just demonstrated a very important phenomenon
of computing.
10. Friendships (Extra Credit Only – 200 Points)
8. a. Copy your code to a separate program.
b. You will work with the list of persons.
c. Implement or use a function random_in_range(int a, int b)
function to choose a
random integer number between two integers.
d. Add a friends list for your PersonType class.
e. For each person in the person list choose a number of friends
(minimum is zero and
maximum is Size/200). Assume this number is x. Now you need
to generate x
locations of the friends and add them as friends to the list of
friends of the current
person.
f. Write or use a function that will sort the list now by the
number of friends in a
descending order.
g. For each person, find other people who have common friends
with that person and
who those common friends are.
h. For each person, find all the people who have that person as a
friend.
i. Repeat part e to randomly unfriend people (unfriending is
zero to half of the number
of friends).
j. Repeat part f after you have run the unfriend part.
9. 5
Part II (200 points)
In this assignment you will use clean structured design to solve
a
problem that is normally considered to be very difficult, and
find that it is
in fact surprisingly easy. Look before you leap: think about
how your
program is going to be organized, don’t just start typing. A
rational design
will give you a working program quite easily; an unplanned
design will not.
You need to make sure that your program will flow smoothly
and your
functions are designed with the right parameters and appropriate
data types
(you should put very little in main().
The assignment is to create a nicely formatted calendar for any
month of any year.
1. Length of a Month
Design a function that takes two parameters: year and month,
and returns an
integer indicating how many days long that month is. January
2009 was 31 days long,
February 2009 was 28 days long, February 2008 was 29 days
long, and so on.
10. Remember that for February, leap years must be taken into
account.
For this first part, we are only interested in the 21st century.
Between the years
2000 and 2099 the leap year rule is very simple: a year is a leap
year if it is divisible
by four.
Incorporate your function into a simple program that allows you
to test it
conveniently, and then test it conveniently. Each stage of this
lab assignment depends
on the previous stage, so you won’t do any good by going ahead
with an incorrect
function.
2. Day of the Year.
Design a function that takes three parameters: year, month, and
day, and returns
an integer indicating which day of the year that date is. For
example, the 1st of
January is day 1 of the year, the 2nd of January is day 2, the 1st
of February is day 32,
and so on.
Incorporate your function into a simple program that allows you
to test it
conveniently, and then test it thoroughly.
3. Day of the Century.
Now make a function that tells you what day of the century it is.
Forget about
11. foolish arguments about whether the century starts in 2000 or
2001. If you take 1st
January 2000 as day 1, everything works out nicely. So 31st
December 2000 was day
366, and 1st January 2001 was day 367, and so on. You still
only need to be
concerned with this century, 2000 to 2099.
6
4. Day of Forever.
You knew this part was coming. Now we want a function that
again takes three
parameters, representing year, month, and day, but this time, the
year could be any
positive number. This raises two issues: where to start counting
(i.e. what date shall
we choose to be day number 1?), and how to handle leap years.
Although pedantic folk will argue that there is no such thing as
the year 0,
pretending that there was makes for a very simple solution. Day
1 will be 1st January
of the year 0 regardless of whether or not that date ever existed.
It makes the counting
easy.
The true rules for leap years are slightly more complex than just
divisibility by
four. The exact rules are given on the last page if you don’t
already know them, but in
summary:
12. Any year that is divisible by 400 is a leap year,
any other year that is divisible by 100 is not a leap year,
any other year that is divisible by 4 is a leap year, and
any other year is not a leap year.
Here are some pre-calculated samples to help with testing:
1st January 2000 was day number 730486
4th July 1776 was day number 648857
2nd, 3rd, and 4th of October 2012 are days 735144, 735145, and
735146
27th November 2737 will be the millionth day
1st January of the year 10 A.D. was day 3654
Give some serious thought to testing. If you are getting the
wrong number for a date,
try some very close dates, and you are likely to spot a pattern in
the error that will
give you a big clue about where your program may be wrong.
5. Day of the Week.
Now make a function that takes year, month, and day as
parameters, and tells you
what day of the week that date was. In some strange and wild
countries, such as
Czechoslovakia, the week starts on a Monday. We’ll keep them
happy. Make your
function return the answer as an int, using 0 for Monday, 1 for
Tuesday, ..., and 6 for
Sunday. This is very easy if you think of the modulo %
operator and remember how
many days there are in a week. Also, make it flexible so that
you could start the
calendar on any day and you could then sell it in any strange
and wild countries.
13. 6. A Calendar for a Month.
Use that function in a program that allows the user to enter two
integers,
representing year and month, and then prints a correctly
formatted calendar for that
day and month. Like this, which would come from an input of
2014 2:
Mo Tu We Th Fr Sa
1
Su
2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28
continued..
7
You certainly know how to print out a list of numbers starting
from 1. To make those
numbers come out looking like a calendar, you need to work out
how many spaces to
print before the “1”, and how to tell when it is time to start a
new line. You also need to
take a little care to get the alignment of one and two digit
numbers right.
14. 7. A solid Product.
Make sure that your calendar works for any year, not just in the
21st Century,
And enable the user to print a calendar that starts on any day
not just
Monday.
8. For A Little Extra Credit.
Write a function that works out how many sundays any given
year has.
8
Only For Reference:
Rules for Leap Years
Under the Gregorian calendar system, which is what we use
now, the rules for
working out whether a particular year is a leap year or not are
If the year number is divisible by 4, it is normally a leap year,
except that if it is divisible by 100, it is not a leap year after all,
except that if it is divisible by 400, it really is a leap year again.
So, the years...
1600, 2000, 2400, 2800 are leap years
1800, 1900, 2100, 2200 are just ordinary years
15. 1904, 1908, 2004, 2008 are leap years
1901, 1999, 2001, 2009 are ordinary years.
The Gregorian calendar was only introduced in the English-
speaking world and all
the British colonies on 14th September 1752. Before that, the
Julian calendar had been
in use since roman times. Under the Julian calendar, a leap year
is simply any year
whose number is divisible by 4. The major European countries
had switched to the
Gregorian calendar in 1582, so there was a long period of
international confusion.
Florida was a Spanish colony until 1763, British from 1763 to
1784, Spanish
again from 1784 to 1810, independent from 1810 to 1811, then
Spanish again, until it
was finally taken over by the United States in 1821. There isn’t
much to be gained by
trying to take all of those changes into account. Throughout the
United States, the
date for the change is taken to have been 14th September 1752
even in places where it
wasn’t really.
1752 was a very confusing and tempestuous year. All of a
sudden 11 leap years
that had contributed an extra 29th of February didn’t count as
leap years any more,
and those 11 days had to be given back. The chosen solution
was that the 3rd to 13th
days of September just didn’t happen that year. This is the
correct calendar for the
period:
16. August 1752 September 1752 October 1752
Su Mo Tu We Th Fr Sa
1
Su Mo Tu
1
We
2
Th
14
Fr
15
Sa
16
Su
1
Mo
2
Tu
3
We
4
Th
5
Fr
6
Sa
17. 7
2 3 4 5 6 7 8 17 18 19 20 21 22
23 8 9 10 11 12 13 14
9 10 11 12 13 14 15 24 25 26 27 28 29
30 15 16 17 18 19 20 21
16 17 18 19 20 21 22 22 23 24 25 26 27
28
23 24 25 26 27 28 29 29 30 31
30 31
You do not need to make your calendar program take account of
the Julian period in
any way. Just pretend that the current system has always been in
place.
9
Submission
• You MUST submit the following items to BB:
üOne Word file for the assignment – the whole thing is ONE
word file
with the code for each of the 2 problems above and the next
part.
üAll Output files
üScreenshots of all your outputs in the same word document (If
you don’t
include it, you get a zero for the assignment)
• One upload of all files together is allowed
• No email submissions will be accepted under any
circumstances
18. • Emails saying the wrong files were submitted will be
completely
ignored. You should know how to do this by now!
• Please be careful – your code will be checked against code of
other students
and internet code (I have the tools) – you must do this on your
own (don’t
risk it)
• If I suspect that you submitted code that is not yours, you will
receive a zero
for the assignment, and will be invited to my office to make
changes to the
code before I would give a score for the assignment.
RULES FOR ANSWERING SPECIAL DISCUSSION BOARD
QUESTIONS:
1) Remember, you need to demonstrate an understanding of
events--not only in terms of what happened but also why it
happened and what effect it had on society. Remember to
answer each part of your question as well.
2) Stay on target—answer the questions as fully as possible and
don’t wander off the subject—doing so will hurt your grade.
3) Be aware that you are required to use resources other than
your textbook in composing your answers to Special Discussion
Board Questions. You are also required to cite those sources at
the end of your posting. This means you may need to take a trip
to your local library or conduct an online search or two before
you have the information necessary for you to compose your
posting. DO NOT use any of the following as sources: your
textbook, films or television programs (so no You Tube), blogs,
19. Twitter posts, or Facebook pages. DO NOT use endnotes,
footnotes, or any other form of source citation within the body
of your post. You will lose points for each instance if you do.
4) Express yourself clearly. Use good grammar and spelling.
Write in complete sentences. Do not use any of those
abbreviations so commonly used on blogs and text messages. I
suggest you compose your contribution on a word processing
program with a spell-checker. Then cut and paste—or type it in.
This may help you get out everything you want to say before
you hit “submit.” Be sure to use at least 12 point type for your
response so it can be read. And, no, you cannot edit your
contributions after they are posted.
5) Your contributions should have real substance to them.
Contributions such as “Yeah, what she said.” or “I do so totally
agree with what everyone has said” will receive zero (0) points.
Most questions can be answers in 1,000 - 1,500 words--
sometimes more, sometimes less. The best rule of thumb is to
make sure you answer each part of the question in detail.
6) Be polite—no name calling, no long-winded attempts to
dominate the discussion, no profanity, no threats. If you
disagree with someone, you may say so and then present YOUR
argument—spending your time tearing down THEIR argument
will hurt your grade and could get you thrown off the
Discussion Board.
7. Be sure the paper is Plagiarism Free.
Write an essay on the Black Death in which you answer all
of the following questions:
The Black Death (a combination of diseases including the
Bubonic Plague) hits Europe in 1348 and kills off
approximately 75% of the human population. So, let's test your
Black Death IQ. DO NOT write a list of answers to the
questions--I am looking for your ability to tell me what it all
means, too. Also, be as specific and detailed with your
information as possible.
1) The best guess is that the Black Death was spread by the bite
20. of infected fleas that live on the Black Rat. Why were there so
many rats? Why were there so few cats to kill the rats? And
what other roles did humans play in rat overpopulation?
2) In any given town where the Black Death hit, it counted the
members of which two occupations among its first victims?
Why is it that those individuals would be especially vulnerable?
3) In searching for a cause for their suffering, who did
Europeans blame for the Black Death and how did they seek
revenge? Name at least two of these groups and give at least
two detailed examples of this persecution.
4) What changes in social customs and attitudes came about in
Europe as a result of the Black Death?
5) What changes in literature and art came about in Europe as a
result of the Black Death?
6) How did the Black Death affect the Muslim world? In
particular, who was blamed for the disease; and how did the
treatment of Muslim victims differ from the treatment of
victims in Europe? Most important here, how does the course
of scientific inquiry in the Middle East diverge from that in
Europe in the wake of the Black Death?
7) What did an "innocent" nursery rhyme like Ring Around the
Rosie have to do with the Black Death? (in your research you
may run across a school of thought that says it didn't...ignore
that school of thought)
Be sure to include your list of sources with your post.