Welcome to Algorithm Course

Instructor              : Saif Mahmud Parvez

Destination            : Lecturer

Contact Number    : 01765455133

E-mail                     : saif.cse@diu.edubd

Course Rationale 

Algorithms deals with efficient ways to solve different mathematical and real-life problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve computational problems. This course emphasizes the relationship between algorithms and programming and explores algorithms from the programmer’s perspective for solving problems efficiently using various programming languages.

Course Objective

This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:
• Analyse the asymptotic performance of algorithms.
• Demonstrate familiarity with major algorithms and data structures.
• Apply important algorithmic design paradigms and methods of analysis.
• Synthesize efficient algorithms in common engineering design situations.

Course Outcomes (CO’s)

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.

Let Make Some Fun with Algorithm before starting with the visualization

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

Course Outline

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:

Google Classroom Code: