CS 14 - Lab 6
CS 14
Homepage
First Task - Lab Practical
Complete the lab practical as assigned by the TAs. You will have 1 hour and
30 minutes
to complete the practical. You will turn in your lab using the electronic
turnin.
WATCH THE TIME! The electronic turnin will be gone 1 hour and 30 minutes after
the scheduled start time of your lab section and ASBOLUTELY NO LATE LAB
PRACTICALS WILL BE ACCEPTED NO MATTER WHAT THE REASON.
You may not use ANY reference material at all.
Second Task - Mid-Quarter Evaluations
Please fill out an anonymous review of the course. The
link is available here. We would like you to answer the following questions, so that
we can put on a better course for you:
- Comments for/about the instructor (Ann Gordon-Ross)
- Comments for/about your TA (Titus Winters, Xiao Zhang, or Keri Nishimoto).
Please include your TAs name in your response.
- Comments about the in-lab exercises
- Comments about the programming assignments
- Comments about the quizzes
- Comments about the lecture homeworks
- Comments about the in-class exercises
- Give the first names of 6 people in the course.
- When did you take CS 12 / attempt CS 14 before.
- If you took CS 12 at another school, tell us what programming
language and development platform was used, and whether it was
difficult to make the transition.
When you are done, show your TA the "Thank you page" and you'll be marked
down for 1 point. The evaluation must be completed during lab time.
Third Task - Templatized Insertion Sort
For this lab you will be working alone. There is alot to do during this lab
section and if you do not finish during lab time, you may finish outside
of lab. The lab is due 24 hours after your lab section ends. However,
try to finish during your scheduled lab time and demo your program during
lab.
You will be writing a templatized version of the insertion sort algorithm.
You will then use your sorting function to sort arrays of ints, floats,
chars, and a user defined class (obtainable here).
The user defined class will consist of
a first name and a last name string. Instances of the class will be sorted
by last name and then by first name. You will need to overload one or more
operators to accomplish the sorting of the class instances.
You will also need the print functions obtainable in
print.cc. Please note that I could have used a template function instead
of giving you 4 different instances of the print function, one for each
type sorted. .25 extra credit points will be available for replacing the print
function with a templatized print function and implementing any necessary
overloaded functions to acheive this.
Point Breakdown For Lab Assignment
You may demo your program in lab or it will be
graded from your electronic submission (due 24 hours after the end of your
lab section). Please show the output
from main.cc to the TA if you complete the lab.
The TA will also
look at your code for correctness when checking out. Remember, to
receive credit for this lab, you MUST turn the code in online even if
you have already demoed in lab If you do not turn in your code online,
you will lose points for your lab. All code must be turned in online for
archival purposes.
Remeber to compile your code using the flags "-g -Wall -W -Werror -pedantic".
You must use a makefile.
- 2 points - Attendance - Lab attendance will be 20% of the grade for each
lab. You will receive 1 point when the lab begins and 1 point when the lab
ends. Attendance will be taken during the first and last 5 minutes of the
lab period
- 1 point - Completing mid-quarter evaluations (must be done during lab)
- 6 point - Correctly sorting ints, doubles, and chars using one templatized
insertion sort function
- 1 point - Correctly sorting the Name class instances using the same
templatized insertion sort function used for ints, doubles, and chars.
- Deductions:
- -1 point - not logically seperating your code into seperate files
- -1 point - no makefile
- +.25 Extra Credit - Templatizing the print function to work for
ints, chars, doubles, and Name class instances.