|
Algorithms Design
Final Grades :
Final Result
87/04/28
Project :
Project Definition
Course
General Imformation:
86-2
: Spring 2008 Info
(MS Word)
Download
Presentations:
1- Introduction
2- Asymptotic Analysis
3- Recurrences
4-
Divide and Conquer
5-
Greedy Algorithms
6-Dynamic
Programming
7-
Graph Algorithms (part1)
8-
Graph Algorithms
(part2)
9- Backtracking
Grading:
|
Item
|
Grade
|
|
Projects
|
2
|
|
Midterm Exam
|
6
|
|
Final Exam
|
10
|
|
Quizzes and Take-Home Assignments
|
2
|
|
Total
|
20
|
Course References:
Textbooks:
1 - T.H. Cormen, C. E. Leiserson, R. L. Rivest, and C.
Stein, Introduction to Algorithms, 2nd Edition, Mc Graw
Hill, 2001.
E. Horowitz, S.
Sahni, S. Rajasekaran, Computer Algorithms, Computer Science
Press, 1997.
Another Book:
R. Neapolitan
and K. Naimipour, Foundations of Algorithms using C++ Pseudocode, 2nd
Edition, Jones and Bartlett, 1998.
Exams:
Previous Semesters:
86-1
Return to top of page
|
