Computer Science 2711 -- Introduction to Algorithms and Data Structures, Winter 2008

Announcements | Course information | Assignments and tests | Labs | Lecture outline
-----------------------------------------------

Announcements

21/4/2008 Exam and preliminary course marks are now posted here . If there is something wrong with your mark (e.g., you don't see an assignment that you submitted, or an assignment mark is incorrect) please email me no later than 3pm Tuesday!
16/4/2008 Term marks are now posted on the lab page .

Old announcements

Course information

Course Information Sheet

Lectures: 14:00-14:50 Monday, Wednesday and Friday in EN-1051
Instructor: Antonina Kolokolova , email: [Your browser cannot view this email address] , office ER-6011.
Instructor office hours: W/F 13:00-13:50
Labs: Thursday morning 900 - 1200 in CS-1019. The lab webpage is here
Textbook: Data Structures and Algorithms in Java (4th Edition) by Michael T. Goodrich and Roberto Tamassia, 2006.
Reference book: Introduction to Algorithms (Second Edition). Cormen, Leiserson, Rivest, and Stein.

Important Information on Account Access, Printing and Java Version
Help Centre Schedule

Marking scheme:
Assigments Quizzes Midterm Final exam
6 x 4% = 24% 9 x 2% = 18% 1 x 18%= 18% 1 x 40% = 40%

-----------------------------------------------

Assignments and tests

Submission Details for All Assignments

Assignment 1. Due Jan 25, 2008. Assignment 2. Due Feb 6, 2008. Assignment 3. Due Feb 15, 2008.
Assignment 4. Due Feb 27, 2008. Assignment 5. Due Mar 19, 2008. Assignment 6. Due Mar 26, 2008.

-----------------------------------------------

Tentative course outline

Some slides handouts

Week Topics Readings (chapters)
Week 1: Jan 7,9,11 Overview, review, recursion, analysis 1,2,3,4
Week 2: Jan 14,16,18 Stacks and queues, lists and iterators, Trees 5,6,7
Week 3: Jan 21,23,25 trees, heaps,priority queues 7,8
Week 4: Jan 28,30, Feb 1 Hash tables 9
Week 5: Feb 8,10, 12 Review of induction 4.3
Week 6: Feb 11,13, 15 Skip lists, binary search trees, AVL trees 9.4, 10
Week 7: Feb 18,20,22 Semester break 18th-20th, (2,4) trees, red-black trees, splay trees, sorting 10
Week 8: Feb 25,27, 29 Sorting, Dynamic Programming, midterm review 10,11
Week 9: Mar 3,5,7 Midterm , text processing , Friday lecture canceled. 11
Week 10: Mar 10,12,14 Text processing, algorithm design paradigms: greedy algorithms and dynamic programming 12
Week 11: Mar 17,19,21 Graphs, DFS, BFS 13
Week 12: Mar 24,26,28 Graphs 13
Week 13: Mar 31, Apr 2,4 Graphs 13

-----------------------------------------------