Analysis and Design of Algorithms 1
Analisis dan Desain Algoritma 1
Semester Gasal 2011/2012
Instructor
Schedule
- Lectures
- Tuesdays: 12:00-12:50, at U2.02
- Fridays: 13:00-14:50, at U2.02
- Exams
Objectives
Syllabus
Textbooks
- Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, 3rd Edition, MIT Press, 2009.
- Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
- Greene, D.H., and Knuth, D.E., Mathematics for the Analysis of Algorithms, 3rd Edition, Birkhäuser Boston, 1980.
- Knuth, D.E., The Art of Computer Programming Volume 1-3, 3rd Edition, Addison-Weley, 1997.
Grading
- Exercises: 20%
- Mid-term exam: 40%
- Final exam: 40%
Lectures
Lecture 0 (September 13, 2011)
Lecture 1 (September 16, 2011)
- Analysis of Algorithms: Insertion and Merge Sorts
Lecture 2 (September 20, 2011)
- Asymptotic Notation and Recurrences
Lecture 3 (September 23, 2011)
- Asymptotic Notation and Recurrences
Lecture 4 (September 27, 2011)
- Asymptotic Notation and Recurrences; Divide and Conquer
Lecture 5 (September 30, 2011)
Lecture 6 (October 4, 2011)
- Quicksort and Randomized Algorithms
Lecture 7 (October 14, 2011)
- Quicksort and Randomized Algorithms; Sorting Lower Bounds
Lecture 8 (October 15, 2011)
- Sorting Lower Bounds, Counting and Radix Sorts
Lecture 9 (October 18, 2011)
Lecture 10 (October 21, 2011)
Lecture 11 (October 25, 2011)
Lecture 12 (October 27, 2011)
- Basic Data Structures
- Selamat mengerjakan ujian tengah semester. Semoga berhasil.
- Pertemuan-pertemuan selanjutnya akan diampu oleh Pak Drs. Suprapto, M.Kom.
Reza Pulungan
pulungan@ugm.ac.id