CSC B63: Assignments

Assignment Schedule

Announcements, clarifications, corrections and revisions to assignment specifications are posted to the Announcements page. Please read this page regularly.

Assignment 5

• Assignment handout (PDF) (PS) and the programming question
• Due by 1:10 pm on Wednesday, April 4. Please submit the written questions directly to your instructor, preferably at the start of lecture.
• For the programming question, please submit all required files electronically using the submit command:
  submit -N PGM5 cscb63s Mst.java GraphTraversal.java DeltaTSP.java
  or (if you've previously submitted and want to submit a new version):
  submit -N PGM5 -f cscb63s Mst.java GraphTraversal.java DeltaTSP.java
• Sample solutions: PDF or PS
• Programming question tester

Assignment 4

• Assignment handout (PDF) (PS) and the programming question
• Due by 1:10 pm on Wednesday, March 21. Please submit the written questions directly to your instructor, preferably at the start of lecture.
• For the programming question, please submit all required files electronically using the submit command:
  submit -N PGM4 cscb63s AdjMatrixGraph.java AdjListsGraph.java ConnectedComponents.java
  or (if you've previously submitted and want to submit a new version):
  submit -N PGM4 -f cscb63s AdjMatrixGraph.java AdjListsGraph.java ConnectedComponents.java
• Sample solutions: PDF or PS
• Programming question tester

Assignment 3

• Assignment handout (PDF) (PS) and the programming question
• Due by 1:10 pm on Wednesday, March 7. Please submit the written questions directly to your instructor, preferably at the start of lecture.
• For the programming question, please submit all required files electronically using the submit command:
  submit -N PGM3 cscb63s Set.java Element.java
  or (if you've previously submitted and want to submit a new version):
  submit -N PGM3 -f cscb63s Set.java Element.java
• Hints and clarifications:
  • Q4: Read the comments carefully so you correctly implement the disjoint sets data structure according to our specifications. It must work correctly with our (secret) tester or you won't receive credit (just like in the "real world")!
• Sample solutions: PDF or PS
• Comments from the marker (and a few notes from me)
• Programming question tester

Assignment 2

• Assignment handout (PDF) (PS) and the programming question
• Due by 1:10 pm on Wednesday, February 14. Please submit the written questions directly to your instructor, preferably at the start of lecture.
• For the programming question, please submit all required files electronically using the submit command:
  submit -N PGM2 cscb63s Heap.java HeapSort.java
  or (if you've previously submitted and want to submit a new version):
  submit -N PGM2 -f cscb63s Heap.java HeapSort.java
• Hints and clarifications:
  • Q2b should ask how to implement the above FOUR operations (not three, as it was originally written). This has been corrected.
  • The AVL trees handout the assignment refers to can be found on the Lectures page in the week 3 readings.
  • Q2: A few clarifications to keep you on track.

    The database D stores a set of ship records for all the ships that are already moored in the port.

    Each ship record in D is represented by some pair (p,c), where p is the pier location of the ship, and c is the ship's present capacity.

    During an INSERT, you are given a pointer x to a ship record (p,c) and your task is just to insert this new record into the database D.

    Note that in this question you are NOT concerned about how a pier is assigned to a ship when it docks (this assignment is done by some procedure that is external to this database): As far as you are concerned, when a ship of capacity c docks, it already has a given pier number p (that you cannot change). So all you have to do for an INSERT is to enter the new ship record (p,c) into the database D.

    The pier number of ship record is fixed and never changes (because a docked ship does not change pier).

    Do not assume that there is a small number of pier locations, or of ship capacities (a ship capacity can be any real number).

• Sample solutions: PDF or PS
• Programming question tester

Assignment 1

• Assignment handout (PDF) (PS) and the programming question
• Due by 1:10 pm on Wednesday, January 31. Please submit the written questions directly to your instructor, preferably at the start of lecture.
• For the programming question, please submit all required files electronically using the submit command:
  submit -N PGM1 cscb63s Heap.java
  or (if you've previously submitted and want to submit a new version):
  submit -N PGM1 -f cscb63s Heap.java
• Hints and clarifications:
  • Q2b: Note that this question is asking about the worst case cost of doing k insertions. Attempting to compute the average case cost of an insertion will not help you. (Why not?)
• Sample solutions: PDF or PS
• Programming question tester

Submission instructions

Assignments will consist of a number of "pen-and-paper" questions (the "written" portion, whose solution involves no computer programming and can be handwritten or typed) and a number of "programming" questions (whose solution is entirely computer programming).

The written portion must be handed in using the cover sheet for assignments (Adobe PDF document) (PS). If you are working in a group (of at most two students), only submit one copy of your solutions and write both students' names on the cover sheet. All written portions must be submitted directly to the instructor by the beginning of class on the specified due date. Late assignments will not be accepted (including assignments submitted after the first 5 minutes of class) except in truly unusual circumstances. (See the policy on special consideration for how to request an individual extension for unusual circumstances).

The programming portion must be handed in electronically using the UTSC submit command. Hardcopies (such as computer printouts) will not be accepted, as your code will be executed to determine your mark. If you are working in a group (of at most two students), only submit one copy of your programming solutions and include both students' names in the file headers. Though your programming portion is due at the same time as the written portion, we will not collect the electronic submissions until Thursday at 5:30pm (so you may think of this as an automatic extension). It is your responsibility to ensure your programming solution is submitted on time, as we cannot automatically disable acceptance through submit at a predetermined time. Ensure your programs work correctly on the UTSC computer system; if they do not, you will not receive any credit.

Frequently solved problems:

• I need a computer account. How do I get one?
  Go to the website: https://www.utsc.utoronto.ca/~accounts/newaccount.cgi
• How do I submit my files?
  Make sure you're in the directory that contains the file(s) you want to submit, and use the command:
  submit -N <assignment> cscb63s <files>
  replacing <assignment> with the assignment name (PGM1, PGM2, ...) and replacing <files> with the list of files you are submitting.
• I tried to submit and got the error: "submit: You're not in the cscb63s group." What do I do?
  The computer system doesn't know you're in the class. Make sure that you're officially enrolled in the course. In general, if you enrolled in the class recently, you might have to wait a couple of days before the system administrators give you permission to submit files to our course.
• I submitted an old version of my file, and now I want to resubmit my new version. How do I do it?
  First of all, good idea! Submitting early and often makes sure the submit system is working for you, and if anything happens (you sleep in, your computer crashes, etc.), you already have a copy submitted for marking. We only keep the most recent copy that you submitted. To submit a new version, use the "-f" option for submit to overwrite the old version:
  submit -N <assignment> -f cscb63s <files>