Programming assignments are typically due about two weeks after they are assigned, at 11:30pm, typically on a Tuesday night (but look for exceptions). To turn in programs, and verify the submission, use the Checkmate Homework Dropoff system: it is also available on the standard frame index on the course website: it uses UCInetID Secure Web Login.
Ensure that you submit the code you wrote, not empty files, nor the original files that you downloaded. Ensure that your code runs the googletests correctly. This is your responsibility. Be very careful and double-check what you submit to avoid any mistakes: if you are not sure that you submitted the correct code, resubmit it.
You receive NO POINTS for late submissions, unless you have discussed the matter with me and gotten my official permission (typically, granted well-prior to the due date -not at the last minute- always via email, not just orally; contact me as soon as possible).
IN ALL CASES, you must submit (on time) whatever part of the program you have written, if you are to receive any partial credit for a submission (either on time or late with permission); if you submit no files, I must assume that you have done no work on the assignment (which will result in a grade of 0 for it). If you are still programming the day that an assignment is due, you have planned poorly; if you are still programming an hour before it is due, you have planned very poorly.
Given Extra Points for Submitting Early and No Late Submissions, you should immediately start working on your programs when they are assigned. You should plan to finish them early, both to receive extra credit and to avoid missing a deadline. Expect that you will run into a few big "bugs" during each assignment, which will take a day to figure out and fix; plan to finish early to garner the extra credit (in the best scenario) or still finish on time (in the worst scenario).
You can keep the same partner for multiple assignments or switch. Try to find a partner in your lab who has approximately your skill level and study habits (e.g., working evening vs. weekends, work ethic to submit programs early); try to find someone who lives near you (or with whom you can easily meet outside lab) because I expect partners will need time outside labs to finish the programs. You may partner with someone in a different lab, but you both must be able to attend (and actually attend) one of your labs for 4 hours/week. I recommend finding a partner when you are attending your lab, but there is also a MessageBoard Forum for this task.
// Submitter: romeo1(Montague, Romeo) // Partner : jcapulet(Capulet, Juliet) // We certify that we worked cooperatively on this programming // assignment, according to the rules for pair programmingIf you do not know what the terms cooperatively and/or rules for pair programming mean, please read about Pair Programming before starting this assignment.
If the names do not appear at the top of all your submissions in exactly this form, points will be deducted. If you are submitting by yourself, you may omit all lines but the first (Submitter).
Students are responsible for submitting their solutions on time. In the past, individual students and pairs have submitted the wrong files; in other cases, one student has submitted the wrong file for the pair. In all these cases, what is submitted will be graded. I suggest that you carefully double-check what you submit to avoid these mistake. After submitting (the correct file) to Checkmate, ensure that it shows the assignment's status as completely submitted.
Program | Assigned/Released | Due | Description | Pairing? |
---|---|---|---|---|
#0 | 9/26 | 10/3 | CLion/Clang C++, Course/GoogleTest Libraries, and Checkmate | Prohibited |
#1 | 10/3 | 10/15 |
Programming using the ICS-46 Template Library Stack, Queue, Priority Queue, Set, and Map | Recommended |
#2 | 10/15 | 10/29 | Implementing Queue/Priority Queue/Set with Linked Lists | Recommended |
#3 | 10/29 | 11/12 | Implementing Priority Queues and Maps with Binary Trees | Recommended |
#4 | 11/12 | 11/26 | Implementing Maps and Sets via Hash Tables | Recommended |
#5 | 11/26 | 12/8 | Implementing Graphs and Dijkstra's Algorithm | Prohibited |