2018/2019(2) – IF184401 Design & Analysis of Algorithms (E)

IF184401 Design & Analysis of Algorithms (E)

• 2nd Semester, 2018/2019
• Wednesday, IF-107a, 14:00-15:40
• Thursday, IF-107a, 10:00-11:40
• TA (Teaching Assistant): Arya Wiranata [arya_wiranata(at)live(at)com]

Reference

• Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2009) Introduction to Algorithms, 3rd Edition. Cambridge, Massachusetts; London, England: The MIT Press.

News

• 2019-05-02 11:22 The grades have been updated. Alhamdulillah, all of the praises to our Good Lord, finally our classes have been finished. Thank you for our togetherness. togetherness in happiness, InsyaAllah. I am sorry for some mistakes might happen in our classes. May our Good Lord gives us some knowledge and wisdom from our classes, and also gives us successes and blesses. Amin.
• 2019-04-11 14:38 The grades have been updated.
• 2019-04-07 21:25 Final exam: the question, has been released.
• 2019-03-29 20:17 The grades have been updated.
• 2019-03-29 08:33 Saturday’s class (2019-03-30) will be from 10:00-finished (1st lecture) and on 11:30-finished (2nd lecture).
• 2019-03-22 18:13 Quiz 2: the question, has been released.
• 2019-03-07 21:42 The grades have been released.
• 2019-03-07 14:52 Midterm exam: the question, has been released.
• 2019-02-22 15:32 Updating Quiz 1: email address of TA (Arya Wiranata)
• 2019-02-20 11:23 Updating Quiz 1: the question.
• 2019-02-15 13:29 Saturday’s class (2019-02-16) will be from 10:00-finished (1st lecture) and on 11:30-finished (2nd lecture). It was from 09:00-finished (1st lecture) and from 10:30-finished (2nd lecture).
• 2019-02-13 18:36 Quiz 1: the question, has been released.
• 2019-02-06 14:00 Welcome to our DAA class E, guys! May we are all going to get passed, knowledge, happiness and wisdom!

Grade

Grades of students can be seen as in the following.

• IF184401 Design & Analysis of Algorithms (E): The Grades

Final Exam

• Starting date: 10 April 2019
• Deadline: 18 April 2019, 23:59 WIB.
• Exam type: Open
• Send to: yifana(at)gmail(dot)com & CC to arya_wiranata(at)live(at)com with the subject: IF184401_DAA(E)_FIN_NRP_Name
• File type and format: A full report of the answers of the questions; in PDF format. Put this report along with your declaration into 1 (one) .ZIP file.
• Filename format: IF184401_DAA(E)_FIN_NRP_Name.PDF
• Final exam: the question

Quiz 2

• Starting date: 23 March 2019
• Deadline: 30 March 2019, 23:59 WIB.
• Exam type: Open, Teamwork.
• Send to: yifana(at)gmail(dot)com & CC to arya_wiranata(at)live(at)com with the subject: IF184401_DAA(E)_Q2_NRP1_Name1_NRP2_Name2_NRP3_Name3
• File type and format: A full report of the design & analysis of algorithms; source code, output and analysis; in PDF format. Please email your group GitHub link to our email above.
• Filename format: IF184401_DAA(E)_Q2_NRP1_Name1_NRP2_Name2_NRP3_Name3.ZIP
• Quiz 2: the question

Midterm Exam

• Starting date: 9 March 2019
• Deadline: 16 March 2019, 23:59 WIB.
• Exam type: Open
• Send to: yifana(at)gmail(dot)com & CC to arya_wiranata(at)live(at)com with the subject: IF184401_DAA(E)_MID_NRP_Name
• File type and format: A full report of the source code, output and analysis; in PDF format. Put this report along with your declaration and all of .java files (or any other programming language’s source code) into 1 (one) .ZIP file.
• Filename format: IF184401_DAA(E)_MID_NRP_Name.ZIP
• Midterm exam: the question & the source code

Quiz 1

• Starting date: 13 February 2019
• Deadline: 23 February 2019, 23:59 WIB.
• Exam type: Open
• Send to: yifana(at)gmail(dot)com & CC to arya_wiranata(at)live(at)com with the subject: IF184401_DAA(E)_Q1_NRP_Name
• File type and format: A full report of the title, problem description, problem abstraction, solution and source code; in PDF format
• Filename format: IF184401_DAA(E)_Q1_NRP_Name.PDF
• Quiz 1: the question

Presentation Files – provided by Rully Soelaiman, Department of Informatics, ITS, Surabaya, Indonesia.

• 01. 2019-02-06, 14:00-finished, IF-107a – Lecture #1: Introduction & getting started. DAA (A & B): Lecture #1 (Ch.1-2)
• 02. 2019-02-07, 10:00-finished, IF-107a – Lecture #2: Correctness of algorithms, asymptotic analysis, big O notation (Ch.2-4)
• 03. 2019-02-13, 14:00-finished, IF-107a – Lecture #3: Correctness of algorithms, asymptotic analysis, big O notation (continued). DAA (A & B): Lecture #2 (Ch.2-4)
• 04. 2019-02-14, 10:00-finished, IF-107a – Lecture #4: Solving recurrences (Ch.2)
• 05. Saturday, 2019-02-16, 10:00-finished, IF-106 – Lecture #5: Solving recurrences(continued) (Ch.2)
• 06. Saturday, 2019-02-16, 11:30-finished, IF-106 – Lecture #6: Sorting: Heapsort & Quicksort (Ch.6-7)
• 07. 2019-02-20, 14:00-finished, IF-107a – Lecture #7: ADTs and data structures (Ch.10-11)
• 08. 2019-02-21, 10:00-finished, IF-107a – Lecture #8: ADTs and data structures (continued) (Ch.10-11)
• 09. Saturday, 2019-02-23, 09:00-finished, IF-106 – Lecture #9: Quiz 1: the question.
• 10. Saturday, 2019-02-23, 10:30-finished, IF-106 – Lecture #10: Quiz 1: the question (continued).
• 11. 2019-02-27, 14:00-finished, IF-107a – Lecture #11: Binary search trees (Ch.12)
• 12. 2019-02-28, 10:00-finished, IF-107a – Lecture #12: Red-Black trees (Ch.13)
• 13. Saturday, 2019-03-02, 09:00-finished, IF-106 – Lecture #13: B-Trees (Ch.18)
• 14. Saturday, 2019-03-02, 10:30-finished, IF-106 – Lecture #14: AVL tree (Ch.13)
• 15. 2019-03-06, 14:00-finished, IF-107a – Lecture #15: Dynamic programming (Ch.15)
• 16. Saturday, 2019-03-09, 09:00-finished, IF-106 – Lecture #16: Midterm exam: the question & the source code.
• 17. Saturday, 2019-03-09, 10:30-finished, IF-106 – Lecture #17: Midterm exam: the question & the source code (continued).
• 18. 2019-03-13, 14:00-finished, IF-107a – Lecture #18: Graphs (Ch.22)
• 19. 2019-03-14, 10:00-finished, IF-107a – Lecture #19: Graphs (continued) (Ch.22)
• 20. Saturday, 2019-03-16, 09:00-finished, IF-106 – Lecture #20: Minimum spanning trees & greedy algorithms (Ch.22-23)
• 21. Saturday, 2019-03-16, 10:30-finished, IF-106 – Lecture #21: Minimum spanning trees & greedy algorithms (continued) (Ch.22-23)
• 22. 2019-03-20, 14:00-finished, IF-107a – Lecture #22: Shortest paths in weighted graphs (Ch.24)
• 23. 2019-03-21, 10:00-finished, IF-107a – Lecture #23: Shortest paths in weighted graphs (continued) (Ch.24)
• 24. Saturday, 2019-03-23, 09:00-finished, IF-106 – Lecture #24: Quiz 2: the question.
• 25. Saturday, 2019-03-23, 10:30-finished, IF-106 – Lecture #25: Quiz 2: the question (continued).
• 26. 2019-03-27, 14:00-finished, IF-107a – Lecture #26: Introduction to computational geometry (Ch.33)
• 27. 2019-03-28, 10:00-finished, IF-107a – Lecture #27: Amortized analysis (Ch.17)
• 28. Saturday, 2019-03-30, 10:00-finished, IF-106 – Lecture #28: NP-Completeness (Ch.34)
• 29. Saturday, 2019-03-30, 11:30-finished, IF-106 – Lecture #29: NP-Completeness (continued) (Ch.34)
• 30. 2019-04-04, 10:00-finished, IF-107a – Lecture #30: NP-Completeness (continued) (Ch.34)
• 31. 2019-04-10, 14:00-finished, IF-107a – Lecture #31: Final exam: the question.
• 32. 2019-04-11, 10:00-finished, IF-107a – Lecture #32: Final exam: the question (continued).