Topic outline

  • General

    Welcome Letter

    Dear Students

    Welcome to the Algorithm (CSE 213)  course, I, Ferdousur Rahman Sarker will be your co-pilot in this online journey of learning.

    I care about your success in these courses. I'm glad you are here.

    Md. Ferdousur Rahman Sarker
    Lecturer, Department of Computer Science and Engineering
    Daffodil International University






    Instructor

    Ferdousur Rahman Sarker

    Lecturer, Department of CSE
    Daffodil International University

    www.frsarker.com

    Office: Room: 109, Daffodil Tower 5

    Email: ferdousur.cse0299.c@diu.edu.bd

    Phone: +8801714072380




    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. 



    Text Books

    1.
    Introduction to Algorithms
    by Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, Clifford Stein
    2.
    Algorithms (4th Edition)
    by Robert Sedgewick and Kevin Wayne
    3.
    Algorithm Design
    by Jon Kleinberg, Eva Tardos



    Assessment Plan (Theory)

    Final Exam
    40
    Mid-term Exam
    25
    Avg. of 3 Class Tests
    15
    Attendance
    07
    Assignment
    05
    Presentation
    08
    Total
    100


  • WEEK 1 Preparing Background





  • WEEK 2 Notation and Complexity Analysis





  • WEEK 3 Searching and Sorting Algorithm





  • WEEK 4 Searching and Sorting Algorithm





  • WEEK 5 Introduction to Greedy Approach





  • WEEK 6 Introduction to Dynamic Programming





  • This topic

    WEEK 7 Mid-Term Examination





  • WEEK 8 Shortest Path Algorithm





  • WEEK 9 Introduction to Graph And Graph Traversal





  • WEEK 10 Graph Application





  • WEEK 11 Single Source Shortest Path Algorithm





  • Week-12 Graph: All Pair Shortest Path Algorithm

    WEEK 12 Graph: All Pair Shortest Path Algorithm





  • WEEK 13 Review & Revisit all memories





  • WEEK 14 Final Examination