Bismillahir Rahmanir Raheem
Course Teacher:
Dr. Masud Hasan
Office: B20
Email: mhasan2010@gmail.com (in English please)
Website: https://sites.google.com/view/masudhasan
Book:
- CLRS: Introduction to Algorithms, by Cormen, Leiserson, Rivest, Stein. Third Edition, 2009, MIT Press.
Class Schedule:
- Sunday and Thursday, 1:00pm-2:15pm, B12-Lab3
Course Outline, Objectives, and Student Learning Outcome: [pdf]
Course Website: https://sites.google.com/view/tucs405august2018
Office Hours: S Th 11:15am-12:15pm, B20
Marks Distribution:
- Assignment 1, 2: 20%
- Mid Term 1: 20%
- Mid Term 2: 20%
- Final Exam: 40%
Topics, Textbook reading, Slides, Hand notes:
- Lecture 0: Preliminaries
- Slides [pdf]
- Textbook reading: Chapter 1, 3.2, Appendix A.Summation
- Lecture 1: Complexity Analysis Review
- Slides [pdf]
- Textbook Reading: Chapter 3.1
- Video from previous semester: video 1, video 2
- Lecture 2: Complexity Analysis of Sorting Algorithms
- Slides [pdf]
- Textbook Reading: Chapter 2, 7.1
- Video from previous semester: video 1, video 2
- Lecture 3: Complexity Analysis of Recursive Algorithms
- Slides [pdf]
- Textbook reading: Chapter 4.5
- Video from previous semester: video-1, video-2
- Lecture 4: Complexity Analysis of Randomized Quick Sort
- Slides [pdf]
- Textbook reading: Chapter 7.3, 7.4
- Video from previous semester: video-1, video-2
- Lecture 5: Dynamic Programming
- Slides [pdf]. Extra example [1] [2]
- Textbook reading: Chapter 15.4
- Video from previous semester: video-1, video-2
- Lecture 6: Amortized Analysis
- Slides [pdf]
- Textbook reading: Chapter 17 Preamble, 17.4.1 up to Page 466 first paragraph
- Video from previous semester: video-1, video-2
- Lecture 7: Heaps
- Slides [pdf]
- Textbook reading: Chapter 6
- Video from previous semester: video-1, video-2
Lecture 8: Skip List
- Slides [pdf]. Extra example [pdf]. Why forward steps is O(log n) in search [pdf].
- Textbook reading: [pdf]
- Video from previous semester: video-1
Lecture 9: Disjoint Set Data Structures
- Slides [pdf].
- Textbook reading: Chapter 21.1, 21.2
- Video from previous semester: video-1
Lecture 10: Minimum Spanning Tree
- Slides [pdf]
- Textbook reading: Chapter 23.2 (only Kruskal's algorithm from the textbook)
- Video from previous semester: video-1
Lecture 11: Shortest Path Algorithms
- Slides [pdf]
- Textbook reading:
- Video from previous semester: (covered in the video of Lecture 10 above)
Lecture 12: NP-Completeness
- Slides [pdf]. Extra example 1, 2
- Textbook reading:
- [CLRS] Chapter 34.Preamble, 34.1, 34.2, 34.3 (up to page 1069), 34.4, 34.5.
- [GJ] Relevant texts from Chapter 1, 2, 3 [pdf]
- Video from previous semester: Video-1, video-2, Lecture-12-video-3-Lecture-13-video-1
Lecture 13: Approximation Algorithms
- Slides [pdf]. Extra example 1, 2
- Textbook reading: Chapter 35.Preamble, 35.1
- Video from previous semester: See Lecture 12.
Lecture 14: Lower Bound Theory
- Slides [pdf]. Extra example [pdf]
- Textbook reading: Chapter 8.Preamble, 8.1
Lecture 15: Elementary Graph Algorithms
- Slides [pdf], Extra examples [DFS] [Topological Sort]
- Textbook reading: Ch 22.1, 22.2 (upto Page 597), 22.3 (upto Page 607), 22.4 (upto Page 614)
Lecture 16: Augmenting a Data Structure (Interval Trees from Red-Black Trees)
- Slides [pdf]
- Textbook reading: 14.Preamble, 14.2, 14.3 (upto Page 351).
Exercise:
Assignments:
- Best two will be counted.
- Assignment 1 [word]. Deadline: 14-10-2018, Sunday, in class. Late submission not allowed.
- Assignment 2 [pdf]. Deadline: 22-11-2018, Thursday, in class. Late submission not allowed.
- Assignment 3 [word]. Deadline: Final Exam time. Late submission not allowed.
Exams:
- Midterm exam 1:
- Date and time: 18-10-2018 (Thursday), in class.
- Syllabus: Lecture 0, 1, 2, 3, 4
- Question type: Both multiple choice and short questions
- Midterm exam 2:
- Date and time: 22-11-2018 (Thursday), in class.
- Syllabus: Lecture 5, 6, 7, 8, 9, 10, 11
- Question type: Both multiple choice and short questions
- Final Exam:
- Syllabus: All lectures (you can expect more questions from Lecture 12-16)
- Question type: Both multiple choice and short questions
Marks: [pdf]
Course Exit Survey: [Participate]