April 18 - Complete versions of all lectures notes are available on the
"Schedule" page.
April 18 - Additional office hours during the exam period will be:
April 19: 13:00 - 14:00
April 18 - Some information about the final exam:
The exam is cummulative (everything covered in class is examinable)
Similar in style and length to the sample exam.
You will not be asked for any complete proofs of partial correctness.
Summary of topics:
Analysis of algorithms:
Correctness: definitions, loop invariants, proof of termination
(no complete proofs of partial correctness)
Testing: definitions and principles, designing test cases
Asymptotic analysis: definitions, proving results based on the
definitions, runtime analysis of iterative algorithms, expressing
running times of recursive algorithms using recurrence relations.
Data structures and algorithms:
Give specification of requirements for an algorithm.
Define ADTs (spec. of requirements for the ADTs methods).
Know examples of applications.
Be able to trace examples for algorithms, give pseudocode, give
key loop invariants, prove termination.
Know running time results (worst and average case, best case where
relevant). Proofs for iterative algorithms, give recurrence
relations for recursive algorithms.
Be able to handle some variations (eg. kMerge question on sample
exam) and different applications (eg. TreeSort question on sample
term test).
You are responsible for all data structures and algorithms covered in class.
One exception: you are not expected to memorize all the cases and
subcases of insertion and deletion for red-black trees.
April 18 - Model solutions to Assignment 4 are available on the
"Assigment 4" page.
April 4 - Model solutions to Assignment 3 are available on the
"Assigment 3" page.
April 4 - Grades for Assignment 3 are now available and can be viewed through blackboard. Concerns about the grading (if any) should be addressed to
Edouard (edpelchat@gmail.com).
March 30 - Solutions to Term Test 2 are available on the
"tests" page. These will be covered in the lab on Monday, April 2.
March 16- Term Test 2 (Monday, March 26 from 17:00 - 18:30 in SB 142) will cover all material up to and including the Lecture 24-26 notes (heap sort and priority queues).
March 16 - Grades for Assignment 2 are now available and can be viewed through blackboard. Concerns about the grading (if any) should be addressed to
Edouard (edpelchat@gmail.com).
March 16 - Model solutions to Assignment 2 are available on the
"Assigment 2" page.
Feb 14 - Grades for Assignment 1 are now available and can be viewed through blackboard. Concerns about the grading (if any) should be addressed to
Kushan (kahmadia@ucalgary.ca).
Feb 14 - Solutions to Term Test 1 are available on the
"tests" page. These will be covered in the lab on Monday, Feb 27.
Feb 13 - Complete notes for the lectures on Stacks and Queues are now available (old
version from the schedule page has been replaced).
Feb 10 - Extra office hours before Term Test 1 will be on Monday, Feb 13, 15:00 - 16:00.
Feb 10 - Model solutions to Assignment 1 are available on the
"Assigment 1" page.
Feb 6- Term Test 1 (Monday, Feb 13 from 17:00 - 18:30 in SB 142) will cover all material up to and including Slide 11 (binary search tree exmaple) of the Lecture 14-15 notes.
Feb 6 - Assignment 2 has been posted, available through the
"assigments" page.
Feb 1 - Complete notes for the lecture on Basic Data Structures are now available (old
version from the schedule page has been replaced).
Jan 20 - Assignment 1 has been posted, available through the
"assigments" page.
Jan 11 - Office hours have been changed to Friday from 13-15.
Last updated:
http://www.cpsc.ucalgary.ca/~jacobs/Courses/cpsc331/W12/news.html