Section outline
-
-
Please let me know what do you want to learn from this course
CO1 |
Analyze and calculate time complexity and space complexity of various algorithms or any written code using mathematical formula and comparison of algorithms. |
CO2 |
Generate and interpret the output of iterative and recursive codes with the analysis of the problem definition. |
CO3 |
Identify which algorithm listed under which algorithmic paradigm. Compare among various algorithms/implemented codes and choose the efficient one. |
CO4 |
Break down and describe the simulation of various algorithms for different input values. |
CO5 |
Design and apply appropriate algorithms to solve real-life problems. |
Grading Scheme
Theory Class Lab Class
Attendance: 7% Attendance: 10%
Class Tests/Quizzes: 15% Lab performance Test: 40%
Assignment: 5% Lab problem Solving: 25%
Presentation (using video/ppt): 8% Lab Submission: 25%
Midterm Exam: 25%
Final Exam: 40%
Text Book:
a. Introduction to Algorithms, (3rd Edition, MIT Press, 2009) ISBN: 9780262033848. Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
Reference Books:
a. Algorithms (4th Edition)
Author: Robert Sedgewick and Kevin Wayne
b. Algorithm Design
Author: Jon Kleinberg, Eva Tardos
c. Data Structures And Algorithms Made Easy In JAVA Author: Narasimha Karumanchi
Useful Web Links:
Additional Support for Students
· Student Portal: http://studentportal.diu.edu.bd/
· Academic Guidelines https://daffodilvarsity.edu.bd/article/academic-guidelines
· Rules and Regulations of DIU https://daffodilvarsity.edu.bd/article/rules-and-regulation
· Career Development Center: https://cdc.daffodilvarsity.edu.bd/
· For general queries: http://daffodilvarsity.edu.bd/
Please let me know what do you want to learn from this course
Google meeting link: Click here