Topic outline

  • Welcome Note

    Assalamu 'Alaikum.

    I am Amir Sohel, welcoming you to Algorithms Course.  

    I hope we will learn together to enrich ourselves and together we can make this journey memorable. 
    May the Almighty grant you peace and happiness always.


    • Header


    		•

      Instructor : Amir Sohel (MAS)

      Office Room #317 AB-4

      Contact Number:  01688752572

      Email : amir.cse@diu.edu.bd




    • 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. 


    • Grading Scheme

      Theory Class

      Lab Class

      Attendance: 7%
      Class Tests/Quizzes:  15% 
      Assignment: 5%
      Presentation (using video/ppt): 8%
      Midterm Exam: 25%
      Final Exam: 40%

      Lab Attendance: 10%
      Lab Performance Test: 25%
      Assignment + Viva: 10%
      Project: 25%
      Lab Final: 30%


    • 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



      Click here for 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:


      **** 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/


    • Algorithm Project List



    • Navigation Link


      • Class Test: Demo Quiz, 
                                   Quiz - 1, 

                                 Quiz - 2, 

                                 Quiz-3. 


      • Assignment: ASN1, ASN2, ASN3       
      • Presentation    
         

      Week2Go:   


      WK1     WK2     WK3     WK4     WK5     WK6    WK7     WK8     WK9    WK10    WK11  WK12    WK13    WK14


  • Week-01 Preparing Background


    • Topics of discussion 

      1. Introduction and importance of Algorithm and its application
      2. Function and Recursion, 
      3. Euclid’s Greatest Common Divisor(GCD) Algorithm

      Expected Learning Outcome 

      1. Gain knowledge about the importance of algorithm
      2. Perform exercise on function and recursion function

    •  
      Week-01 Plan

      Week plan

      Topics

      Materials  

      Week-01: Lecture-01

      Introduction to Algorithms

      •  Video Lecture                                 
        

      Week-01: Lecture-02

      Computational complexity and Asymptotic Notation of Algorithms

       


       
       

      Week-01: Lab - 01                              

      Problems with C Basics, Loops, Array, F unction, Recursion

        



    • Lab -01

    • Lab task submission Assignment
      Opened: Wednesday, 3 August 2022, 12:00 AM
      Due: Wednesday, 10 August 2022, 12:00 AM
      View Make a submission

  • Week-02: Notation and Complexity Analysis

  • Week-03 Searching and Sorting Algorithm Based on Brute Force Approach

  • Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach



    • Topics of discussion

      1. Introduction to Divide and Conquer Approach.
      2. Introduction to the searching Algorithm based on Divide and Conquer Approach. 
      3. Introduction to the Sorting Algorithm based on Divide and Conquer Approach. 

      Expected Learning Outcome

      1. Knowledge about the Binary Search algorithm and its complexity
      2. Knowledge about the Merge sort algorithm and its complexity
      3. Knowledge about the Quick sort algorithm and its complexity
      4. Exercise the Sorting and searching Algorithm with some additional problems.

    • Week-04 Plan

      Week plan

      Topics

      Materials  

      Week-04: Lecture-07

      Discussion on Divide and Conquer Approach:

      Merge Sort


      Week-04: Lecture-08

      Divide and Conquer Approach:   Quick Sort

       


       

       

      Week-04: Lab - 04

      Section: O-2:

      Lab Performance Test : 1


      • Lab Performance Test : 1




    • Lab Task
    • Lab task submission Assignment
      Opened: Saturday, 3 September 2022, 12:00 AM
      Due: Saturday, 10 September 2022, 11:59 PM
      View Make a submission

  • Week-05 Introduction to Greedy Approach


    • Topics of discussion

      1. Introduction to Greedy Approach
      2. Discussion on Coin Change Problem
      3. Discussion on Bin packing Problem
      4. Discussion on Knapsack Problem
      5. Discussion on Hoffman coding
      6. Assignment-01

      Expected Learning Outcome

      1. Solve the Coin Change Problem based on Greedy Method
      2. Solve the Knapsack Problem based on Greedy Method
      3. Solve the Hoffman coding based on Greedy Method
      4.  Solve the  Bin packing Problem based on Greedy Method
      5.  Exercise the Sorting Algorithm with some additional problems in the Lab.

    • Week-05 Plan

      Week plan

      Topics

      Materials  

      Week-05: Lecture-09

       Greedy Method:  

      • Coin Change        
      • Bin-Packing Problem

       

       

      Week-05: Lecture-10


      Date: 

      • Greedy Partial Knapsack
      • Greedy Huffman Coding

        


       
       

      Week-05: Lab - 05




      Implementation of

      • Merge Sort

      • Quick Sort



    • Discussion forum
      View Make forum posts: 1



    • Lab - 05


    • Lab task submission Assignment
      Opened: Saturday, 10 September 2022, 12:00 AM
      Due: Saturday, 17 September 2022, 12:00 AM
      View Make a submission
    • Quiz-2
      Opened: Monday, 26 September 2022, 8:00 PM
      Closed: Monday, 26 September 2022, 9:00 PM
      View

      Quiz-2

  • Week-06: Introduction to Dynamic Programming

  • Week-07 Mid-Term Examination

    • Week-08: Introduction to Dynamic Programming (Continue)

      • l

      • Topics of discussion 

        1. Introduction to Dynamic Programming (DP)
        2. Discussion on longest Common Subsequence and Edit Distance Problem
        3. Discussion on longest Increasing Subsequence (DP)

        Expected Learning Outcome

        1. Solve the Longest Common Subsequence (LCS) Problem based on DP
        2. Solve the Longest Increasing Subsequence (LIS)
        3. Exercise the Bin-packing, LCS, LIS Algorithm with some additional problems in the Lab.

      • Week-08 Plan

        Week plan

        Topics

        Materials  

        Week-08: Lecture-01


        Longest Increasing Subsequence(LIS)

        LIS

        Week-08: Lecture-02

        Longest Common Subsequence (LCS)  

        LCS

        Week-08: Lab - 07


        Implementation of LCS, LIS 

        Lab Task - 7



      • Lab - 08


      • Exercise submission Assignment
        Opened: Monday, 31 October 2022, 12:00 AM
        Due: Monday, 7 November 2022, 12:00 AM
        View Make a submission
      • Lab task submission Assignment
        Opened: Saturday, 17 September 2022, 12:00 AM
        Due: Saturday, 24 September 2022, 12:00 AM
        View Make a submission

    • Week-09: Introduction to Graph And Graph Traversal

    • Week-10: Graph Application



      • Topics of discussion    

        1. DFS Application
        2. Quiz #03

        Expected Learning Outcome 

        1. Full Tree Traversal
        2. Cycle Finding
        3. Component FInding
        4. Topological Sort (TS)
        5. Strongly Connected Component (SCC)

      • Week-10 Plan

        Week plan

        Topics

        Materials  
        Week-10: Lecture-01
        • Video on Lecture 
        • PPT on Lecture

        Full Tree Traversal
        Cycle Finding
        Component Finding     

        Week-10: Lecture-02
        • Video on Lecture 
        • PPT on Lecture

        Ts, SCC

         Week-10: Lab - 09
        • Video on Lab
        • Manual on Lab

        DFS, MST
        Lab performance-02

      • Quiz-03

        Quiz Syllabus:

        • DP: Coin Change
        • DP: 0/1 Knapsack
        • Dp: LCS
        • DP: LIS
        • Graph representation
        • BFS
        • DFS

      • Discussion on Week-10 Forum

        Discuss on Week-10 content if you have any problem and confusion. 

      • Quiz 3
        Opened: Wednesday, 7 December 2022, 8:00 PM
        Closed: Wednesday, 7 December 2022, 8:59 PM
        View

    • Week-11: Graph: Single Source Shortest Path Algorithm

    • Week-12: Graph: All Pair Shortest Path Algorithm


      • Topics of discussion  

        1. Discussion on All Pair Shortest Path Algorithm

        Expected Learning Outcome

        1. Solve SSSP using Bellmen Ford Algorithm 
        2. All Pairs Shortest Path: Floyd–Warshall algorithm

      • Week-12 Plan

        Week plan

        Topics

        Materials  
        Week-12: Lecture-01
        • Video on Lecture 
        • PPT on Lecture

        SSSP: Bellman-Ford Algorithm  

        Week-12: Lecture-02
        • Video on Lecture 
        • PPT on Lecture

        Floyd–Warshall algorithm

         Week-12: Lab - 11
        • Video on Lab
        • Manual on Lab

        Implementation of 

        Floyd–Warshall algorithm

    • Week-13: Final Presentation and Lab Final

      • Week-14: Final Examination