|Announcements |||Course information |||Assignments and tests |||Labs |||Lecture outline|
Assignment submission and marks: Assignment will be submitted via the course D2L page . This site will also be used to post sensitive information such as passwords to solutions.
Please submit all programming parts of the assignment on D2L. The written part is due at the beginning of the corresponding lecture. If you would like to typeset and submit the written part on D2L, please email me about that; the deadline will be the same.
Policy on collaboration: The work you submit must be your own. You may discuss problems from assignments with each other; however, you should prepare written solutions and code alone. Plagiarism is a serious academic offense and will be dealt with accordingly.
|6 x 5% = 30%||10 x 2% = 20%||1 x 15%= 15%||1 x 35% = 35%|
|Week 1:||Overview, review, recursion, analysis||1,2,3,4|
|Week 2:||Stacks and queues, lists and iterators, Trees||5,6,7|
|Week 3:||trees, heaps,priority queues||7,8|
|Week 4:||Hash tables||9|
|Week 5:||Analysis tools: induction||4.3|
|Week 6:||Skip lists, binary search trees, AVL trees||9.4, 10|
|Week 7:||(2,4) trees, red-black trees, splay trees||10|
|Week 8:||Sorting, graphs||11,13|
|Week 9:||DFS, BFS, shortest paths, midterm review||13|
|Week 10:||Midterm, minimal spanning trees||12, 13|
|Week 11:||Text processing, algorithm design paradigms: greedy algorithms||13|
|Week 12:||Text processing and dynamic programming , all-pairs-shortest path.||12|
|Week 13:||algorithm case study, review for the final exam.||3-13|