ENGI 5891: Design and Analysis of Algorithms
Announcements [updated]
The term mark for ENGI 5891 can be found here. Please let me know asap if you find anything incorrect. [posted Apr. 14]
We will review assignment-5 and talk about some issues related to the Final Exam in the last lecture on Apr. 8 (Wednesday) in EN-1000. [posted Mar. 30]
Due to requests from the class, the due date of Assignment-5 will be deferred to 11:00AM on Apr. 6 (Monday). [posted Apr. 2]
There will be a tutorial session for assignment-4 on Apr. 2 (Thursday) 13:00-13:50 in EN 1051. [posted Mar. 13]
Assignment-5 has been posted below. [posted Mar. 23]
Due to a request from the class, the due date of Assignment-4 will be deferred to 11:00AM on March 25 (Wednesday). [posted Mar. 22]
There will be a tutorial session for assignment 3 on March 19 (Thursday) 13:00-13:50 in EN 1051. [posted Mar. 13]
There will be a quiz in the Friday class (11:00AM-11:10AM). [posted Mar. 13]
Assignment-4 has been posted below. [posted Mar. 11]
There will be a tutorial session explaining the midterm exam on March 5 (Thursday) 13:00-13:50 in EN 1051. [posted Mar. 5]
Assignment-3 has been posted below. [posted Feb. 4]
Midterm exam will occur at 11:00-11:50 on Feb. 27 (Friday) in EN-1000. [posted Feb. 21]
Due date of Assignment-2 has been deferred to 11:00AM on Feb. 16 (Monday). [posted Feb. 11]
Office hours of Feb. 11 (Wednesday) have been moved from 15:30-17:30 to 12:00-14:00. [posted Feb. 11]
Assignment-2 has been posted below. [posted Feb. 4]
There will be a tutorial session on Feb. 5 (Thursday) 13:00-13:50 in EN 1051. [posted Feb. 2]
Assignment-1 has been posted below. [posted Jan. 16]
Lecture Notes
Course Outline [pdf] [posted Jan. 6]
Introduction I [pdf] [posted Jan. 8]
Introduction II [pdf] [posted Jan. 12]
Mathematical Background I [pdf] [posted Jan. 14]
Mathematical Background II [pdf] [posted Jan. 16]
Mathematical Background III [pdf]
[posted Jan. 19]
Relevant text
sections: Chapter 1, Sections 1.1, 1.2, 1.3, 1.4, 1.5, 1.6 (mainly up to and
including 1.6.2), 1.7 (useful formulas)
Fundamentals of Algorithmics [pdf]
[posted Jan. 21]
Relevant text
sections: Chapter 2, Sections 2.1 to 2.6, 2.7 (partially)
Asymptotic Notations I [pdf] [posted Jan. 26]
Asymptotic Notations II [pdf]
[posted Jan. 29]
Relevant text
sections: Chapter 3, Sections 3.1 to 3.3
Analysis of Algorithms I [pdf] [posted Jan. 31]
Analysis of Algorithms II [pdf] [posted Feb. 6]
Analysis of Algorithms III [pdf] [posted Feb. 9]
Analysis of Algorithms IV [pdf] [posted Feb. 13]
Analysis of Algorithms V [pdf] [posted Feb. 27]
Analysis of Algorithms VI [pdf] [posted Mar. 2]
Analysis of Algorithms VII [pdf] [posted Mar. 2]
Analysis of Algorithms VIII [pdf] [posted Mar. 5]
Analysis of Algorithms IX [pdf]
[posted Mar. 4]
Relevant text
sections: Chapter 4, Sections 4.1 to 4.7
Greedy Algorithms I [pdf] [posted Mar. 6]
Greedy Algorithms II [pdf] [posted Mar. 10]
Greedy Algorithms III [pdf] [posted Mar. 11]
Greedy Algorithms IV [pdf]
[posted Mar. 13]
Relevant text
sections: Chapter 6, Sections 6.1 to 6.4, and 6.6
Divide-and-Conquer I [pdf] [posted Mar. 17]
Divide-and-Conquer II [pdf] [posted Mar. 19]
Divide-and-Conquer III [pdf]
[posted Mar.
20]
Relevant text
sections: Chapter 7, Sections 7.1 to 7.4
Dynamic Programming I [pdf] [posted Mar. 20]
Dynamic Programming II [pdf] [posted Mar. 26]
Dynamic Programming III [pdf] [posted Mar. 27]
Graph Algorithms I [pdf] [posted Mar. 27]
Graph Algorithms II [pdf] [posted Mar. 30]
Graph
Algorithms III [pdf]
[posted Apr. 1]
Relevant text
sections: Chapter 9, Sections 9.1 to 9.5
Computational Complexity I [pdf] [posted Apr. 1]
Computational Complexity II [pdf]
[posted Apr.
6]
Relevant text
sections: Chapter 12, Sections 12.1 and 12.5
Assignments
Assignment 1 (Due 11:00AM, Friday, Jan. 30) [pdf] [posted Jan. 16]
Assignment 2 (Due 11:00AM, Friday, Feb. 13) [pdf] [posted Feb. 04]
Assignment 3 (Due 11:50AM, Wednesday, Mar. 11) [pdf] [posted Feb. 27]
Assignment 4 (Due 11:00AM, Monday Wednesday, Mar. 23
25) [pdf]
[posted Mar. 11]
Assignment 5 (Due 11:00AM, Friday Monday, Apr. 03
06) [pdf]
[posted Mar. 23]
General Information
Lecture time: Monday, Wednesday, Friday 11:00 - 11:50
Lecture room: EN-1000
Office hours: Wednesday 15:30 - 17:30, or by appointment
Course Textbook
G. Brassard and P. Bratley, Fundamentals of Algorithmics,
Prentice-Hall 1996
Evaluation Scheme
Quizzes: 5%
Assignments: 10%
Midterm: 25%
Final: 60%
Important Dates (Tentative)
Assignments (due dates): Jan. 30, Feb. 13, Mar. 6, Mar. 20,
Apr. 3
Midterm Exam: Feb. 27
Final Exam: TBD
Last Modified: Tue., Apr. 14, 2009 (at 16:30) by Lihong Zhang