Topic outline

  • Welcome Note


    Assalamu 'Alaikum.

    I am Amir Sohel, welcoming you to Algorithms Course. We will use same BLC course for both theory and lab. 

    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.


    • 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

      Lab 1 topics

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

    • First class simple task 1 Assignment
      View Make a submission



    • Lecture Materials 

    • Video of Lecture 01 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture 1 URL
      Restricted Not available unless: You belong to PC-D
    • video of Lecture-2 URL
      Restricted Not available unless: You belong to PC-P
    • Video of Lecture 2 URL
      Restricted Not available unless: You belong to PC-D



    • Lab -01

    • Submission of Lab Task - 1 Assignment
      Restricted Not available unless: You belong to PC-P
    • Video of lab 1 URL
      Restricted Not available unless: You belong to PC-P



    • Discussion on Week - 01


    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D



    • Student Feedback

  • Week-02: Notation and Complexity Analysis


    • Topics of discussion

      1. Introduction with the Asymptotic Notation 
      2. Discussion on the Complexity of Algorithms
      3. Importance of Complexity for designing an Algorithm

      Expected Learning Outcome 

      1. Gain knowledge about the importance of algorithm
      2. Find out the Asymptotic Notation from an Algorithm
      3. Find out the complexity from any code or algorithm

    • Exercise on Lecture-3 Assignment
      Restricted Not available unless: You belong to PC-D



    • Lecture Material


    • Video of lecture-3 URL
      Restricted Not available unless: You belong to PC-P
    • Video of Lecture-3 URL
      Restricted Not available unless: You belong to PC-D
    • Lecture-4 slide File
    • video of lecture- 4 URL
      Restricted Not available unless: You belong to PC-P
    • Video of Lecture-4 URL
      Restricted Not available unless: You belong to PC-D



    • Lab Task


    • Lab task 2 submission Assignment
      Restricted Not available unless: You belong to PC-P
    • Video of lab-2 URL
      Restricted Not available unless: You belong to PC-P



    • Discussion on Week - 02


    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D



    • Student Feedback

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


    •

    • Topics of discussion

      1. Introduction to brute force techniques.
      2. Introduction to the searching Algorithm.
      3. Introduction to the sorting Algorithm


      Expected Learning Outcome

      1. Knowledge about the Linear Search algorithm and its complexity
      2. Knowledge about the Insertion sort algorithm and its complexity
      3. Knowledge about the Bubble sort algorithm and its complexity
      4.  Knowledge about the Selection sort algorithm and its complexity
      5.  Exercise the Sorting and searching Algorithm with some additional problems.

    • Exercise on Lecture-5 Assignment
      View Make a submission
    • Lecture-6 Exercise Assignment
      View Make a submission



    • Lecture Material

    • Video of lecture-5 URL
      Restricted Not available unless: You belong to PC-P
    • video of lecture-5 URL
      Restricted Not available unless: You belong to PC-D
    • Lecture- 6 slide File
    • video of lecture-6 URL
      Restricted Not available unless: You belong to PC-D
    • video of lecture-6 URL
      Restricted Not available unless: You belong to PC-P



    • Lab - 03


    • Lab task-3 submission Assignment
      Restricted Not available unless: You belong to PC-P
    • video of lab 3 instructions URL
      Restricted Not available unless: You belong to PC-P
    • video of lab-3 performance URL
      Restricted Not available unless: You belong to PC-P



    • Discussion on Week - 03


    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P



    • Student Feedback


  • Quiz-1

    • Quiz-1
      Restricted Not available unless: You belong to PC-P
    • Quiz-1
      Restricted Not available unless: You belong to PC-D

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

    • Exercise on Lecture-7 Assignment
      View Make a submission



    • Lecture Material

    • Video of lecture-7 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture-7 URL
      Restricted Not available unless: You belong to PC-D



    • Lab Task
    • Lab task -4 submission Assignment
      Restricted Not available unless: You belong to PC-P
    • Video of lab 4 instructions URL
      Restricted Not available unless: You belong to PC-P



    • Discussion On Week 4

    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D



    • Student Feedback



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

    • Lecture 8 exercise Assignment
      View Make a submission



    • Lecture Material

    • Lecture-8 slide File
    • video of lecture 8 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture-8 URL
      Restricted Not available unless: You belong to PC-D
    • Lecture-9 slide File
    • Video of lecture 9 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 9 URL
      Restricted Not available unless: You belong to PC-P



    • Lab - 05


    • Lab Task 5 Assignment
      Restricted Not available unless: You belong to PC-P
    • Video of lab task 5 instruction URL
      Restricted Not available unless: You belong to PC-P



    • Discussion Forum

    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D



    • Student Feedback



  • Week-07 Mid-Term Examination


    • mid term

    • Mid Term Syllabus:
      • Week-01 to Week-05

    • Instruction for  Mid Term Exam:

      (1) Download the Question paper (pdf) and answer script template (doc) from DIU BLC

      (2) Write responses in the answer script template either type or hand written

      (3) Save the answer script template as pdf e.g. CSE214-O1-111-15-1234-mid.pdf (Course Code-Section-Student ID)

      (4) Upload the pdf in DIU BLC and if failed, then send in email or telegram in private within the given time


      Exam Condition:

      During this open book exam, you need to ensure the following items and code of conducts:

      (1) You can use your Books, online repository and other relevant materials

      (2) Your other supporting materials like clock, pen, pencil, eraser, calculator etc

      (3)  No discussion in group or with your classmates as it will be reflected in your answers

      (4) No sharing of codes, write-ups or ideas as this will be automatically detected by DIU BLC and will lead to negative marking proposed by the system

      (5) No copy text or code or anything from Internet as this will be detected by DIU BLC system plagiarism checker and this will lead to negative marking by the system




    •  Mid Term Exam - Summer 2021

      Date: 08 July, 2021
      Time: 01:30 pm - 04:00PM



    • Submit your Answer Script in BLC
    • Midterm Exam Answer Submission Assignment
      Restricted Not available unless: You belong to PC-D
    • Midterm Exam Answer Submission Assignment
      Restricted Not available unless: You belong to PC-P

  • Week-06: Introduction to Dynamic Programming



    • Topics of discussion

      1. Introduction to Dynamic Programming (DP)
      2. Discussion on Fibonacci Numbers Problem
      3. Discussion on Coin Change Problem (DP)
      4. Discussion on Knapsack Problem (0/1)


      Expected Learning Outcome

      1. Solve the Coin Change Problem based on DP
      2. Solve the Knapsack Problem based on DP
      3. Solve the Fibonacci Numbers Problem based on DP
      4. Exercise the Bin-packing Algorithm with some additional problems in the Lab.




    • Lecture Material

    • Lecture 10 Slide File
    • Video of lecture 10 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 10 URL
      Restricted Not available unless: You belong to PC-P
    • Lecture 11 slide File
    • Video of Lecture 11 URL
      Restricted Not available unless: You belong to PC-D
    • Video of Lecture 11 URL
      Restricted Not available unless: You belong to PC-P



    • Lab Task 


    • Lab task 6 Assignment
      View Make a submission
    • Instruction of Lab task 6 URL
      Restricted Not available unless: You belong to PC-P



    • Students Feedback



    • Discussion Forum

    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D

  • Presentation

    • Submit your presentation URL
      Restricted Not available unless: You belong to PC-P
    • Submit your presentation URL
      Restricted Not available unless: You belong to PC-D

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

    • Exercise on Lecture 13 Assignment
      View Make a submission
    • Exercise on lecture 14 Assignment
      View Make a submission



    • Lecture Material

    • Video of Lecture 12 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 12 URL
      Restricted Not available unless: You belong to PC-P
    • Video of Lecture 13 URL
      Restricted Not available unless: You belong to PC-P
    • Video of Lecture 13 URL
      Restricted Not available unless: You belong to PC-D
    • Video of Lecture 14 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture 14 URL
      Restricted Not available unless: You belong to PC-D



    • Lab - 07


    • Lab task 7 submission Assignment
      Restricted Not available unless: You belong to PC-P
    • Instruction of lab task 7 URL
      Restricted Not available unless: You belong to PC-P



    • Students Feedback



    • Discussion Forum

    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D

  • Week-09: Introduction to Graph And Graph Traversal


    • Topics of discussion  

      1. Introduction to Graph
      2. Graph Representation
      3. Discussion on Graph Traversal

      Expected Learning Outcome 

      1. Solve the Breadth-First Search (BFS) algorithm
      2. Solve the Depth First Search (DFS) Algorithm

    • Exercise on Lecture 16 Assignment
      View Make a submission



    • Lecture Material

    • video of lecture 15 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture 15 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 16 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture 16 URL
      Restricted Not available unless: You belong to PC-D



    • Lab - 08


    • Lab task 8 submission Assignment
      Restricted Not available unless: You belong to PC-P



    • Discussion Forum

    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D



    • Students Feedback

  • 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-11: Graph: Single Source Shortest Path Algorithm


    • Topics of discussion  

      1. Discussion on Minimum Spanning Tree (MST)
      2. Discussion on Single Source Shortest Path

      Expected Learning Outcome 

      1. Solve MST using Kruskal’s Algorithm
      2. Solve MST using Prim’s Algorithm
      3. Single-Source Shortest Path(SSSP) by Dijkstra’s Algorithm



    • Project submission


    • Project submission link URL
      Restricted Not available unless: You belong to PC-P
      Submit your project here



    • Lecture Material


    • Lecture slide 17 File
    • Video of lecture 17 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 17 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture 18 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 18 URL
      Restricted Not available unless: You belong to PC-P



    • Lab - 09


    • Video of lab performance URL
      Restricted Not available unless: You belong to PC-P



    • Discussion Forum

    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-D
    • Weekly discussion Forum
      Restricted Not available unless: You belong to PC-P



    • Students Feedback

  • 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



    • Lecture Material


    • Video of lecture 19 URL
      Restricted Not available unless: You belong to PC-P
    • Video of lecture 19 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 20 URL
      Restricted Not available unless: You belong to PC-D
    • Video of lecture 20 URL
      Restricted Not available unless: You belong to PC-P



    • Lab - 10


    • Lab performance video URL
      Restricted Not available unless: You belong to PC-P



    • Exercise for final 


    • Exercise submission Assignment

      You have to submit the exercises of those lectures which was not submitted before.

      Questions are on lecture slides

  • Week-13: Lab Final


    • Lab Final Question and answer submission Assignment
      Restricted Not available unless: You belong to PC-P

      Add screenshot of code and output of the problems and Upload in PDF format 

  • Week-14: Final Examination


    • Final

    • Final Syllabus:
      • Week-01 to Week-11

    • Instruction for  Final Exam:

      (1) Download the Question paper (pdf) and answer script template (doc) from DIU BLC

      (2) Write responses in the answer script template either type or hand written

      (3) Save the answer script template as pdf e.g. CSE214-O1-111-15-1234-final.pdf (Course Code-Section-Student ID)

      (4) Upload the pdf in DIU BLC and if failed, then send in email or telegram in private within the given time


      Exam duration: 4 hrs


      Exam Condition:

      During this open book exam, you need to ensure the following items and code of conducts:

      (1) You can use your Books, online repository and other relevant materials

      (2) Your other supporting materials like clock, pen, pencil, eraser, calculator etc

      (3)  No discussion in group or with your classmates as it will be reflected in your answers

      (4) No sharing of codes, write-ups or ideas as this will be automatically detected by DIU BLC and will lead to negative marking proposed by the system

      (5) No copy text or code or anything from Internet as this will be detected by DIU BLC system plagiarism checker and this will lead to negative marking by the system


      Penalties for Late Exam in DIU BLC


      Click to know more





    • End of the Semester.





    • Final exam paper submission 


    • Final exam file submission Assignment
      Restricted Not available unless: You belong to PC-D
    • Final exam file submission Assignment
      Restricted Not available unless: You belong to PC-P

  • Topic 17

    • Topic 18

      • Topic 19

        • Topic 20