Nov 28 - Solutions to Term Test 2 are available on the
"tests" page. Marks are available through Blackboard, and you can pick up your graded tests during the labs next monday. Concerns about the grading should be addressed directly to Prof. Jacobson.
Nov 5 - Grades for Assignment 2 are now available and can be viewed through blackboard. Concerns about the grading (if any) should be addressed to Brenan (bhmackas@ucalgary.ca). Model solutions are available on the
"Assigment 2" page.
Nov 3 - Complete lecture notes are available for all of last week's
lectures on the course "schedule" page.
Nov 3 - On Assignment 3, you may assume that the data structures in Questions 3 and 4 will not be modified while your iterators are active. In addition, it is not permitted to traverse the entire binary search tree and store a list of keys in ascending order when initializing the iterator, because this makes the initialization step unnecessarily expensive (costs O(n)) and requires O(n) extra storage. Instead, the interator must be incremental in the sense that it must preserve as much state as necessary between successive calls to next() in order to determine the next key to output.
Oct 24 - Assignment 3 has been posted, available through the
"assigments" page.
Oct 21 - Solutions to Term Test 1 are available on the
"tests" page. Marks are available through Blackboard, and you can pick up your graded tests during the lab tomorrow. Concerns about the grading should be addressed directly to Prof. Jacobson.
Oct 20 - Grades for Assignment 1 are now available and can be viewed through blackboard. Concerns about the grading (if any) should be addressed to Brenan (bhmackas@ucalgary.ca).
Oct 10 - Office hours for next week will be on Tuesday from 14:00 - 16:00.
Oct 10 - Model solutions to Assignment 1 are available on the
"Assigment 1" page.
Oct 10 - Sample term tests are available on the
"tests" page, and a sample final is available on
the
"main" page). Note that you will not
be asked to produce Java code on either term test, but some will be requied
on the final exam.
Oct 10 - Term Test 1 (Wednesday, Oct 15 from 18:00 - 19:30 in ICT 121) will cover all material up to and including Lecture 13.
Oct 6 - Assignment 2 has been posted, available through the
"assigments" page.
Oct 2 - On Assignment 1, it will suffice to prove an upper bound
on the worst-case running time function in Question 3 and, in Question 4,
to prove that the worst-case running time is in O(n^d) (as opposed to Θ).
Oct 2 - Complete lecture notes for lectures 1-9 are available on the
"schedule" page. The old partial versions
have been replaced with the complete ones. The remaining lecture notes will in general contain only the partial versions - you are expected to fill in the examples and remaining points during class.
Oct 2 - Solutions to selected exercises from Tutorial 5 are
available through the
"tutorials" page.
Sept 26 - Solutions to selected exercises from Tutorials 2,3, and 4 are
available through the
"tutorials" page.
Sept 20 - Assignment 1 has been posted, available through the
"assigments" page.
This page last modified:
http://www.cpsc.ucalgary.ca/~jacobs/cpsc331/F08/news.html