Section outline

  • General

    Collapse all Expand all
    • forum icon
      Announcements Forum
    • Dear Students,

      Welcome to the 2020 Summer Semester!


      Welcome back, Students. I can’t wait to see all your smiling faces again! . I am here to support you every step of the way.

      I encourage you to make the most of your time here.

      Remember to make it a great year. I will see you soon.

      Your's,
      Faisal Ahmed
      Lecturer, Dept of CSE, DIU
    • survey icon
      Experience with BLC Survey
      Students must
      Mark as done
    • url icon
      Join us on TELEGRAM URL
      Students must
      Mark as done

    • Description

    • Instructor,

      Faisal

      Name                      : Faisal Ahmed
      Destination            : Lecturer                                                                                   
      Office                      : DIU, Asulia                                                                        
      Cell                         : 01776107653
      E-mail                    : faisalahmed.cse@diu.edu.bd
      Web Profile          : https://sites.google.com/diu.edu.bd/faisal-ahmed/home


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

      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/


    • forum icon
      Announcements Forum

  • Week-01 Preparing Background

    • Topics of discussion

      1. Introduction and importance of Algorithm and its application
      2. Function and Recursion, 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 planTopicsMaterials                 
      Week-01 Lecture-01          
      • Video on Lecture 
      • PPT on Lecture
      		Introduction, Motivation
      Course logistics

      Week-01 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Function and Recursion
       Euclid’s Greatest Common
       Divisor(GCD) Algorithm       

       Week-01 Lab
      • Video on Lab
      • Manual on Lab

      A decision on structures and loop,  
      Array, String, Function, Recursion


    • forum icon
      Discussion on Week-01 Forum

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

  • 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


      Week-02 Plan
      week planTopicsMaterials
       Week-02 Lecture-01
      • Video on Lecture 
      • PPT on Lecture
      		Asymptotic Notation

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

       Complexity Analysis

       Week-02 Lab
      • Video on Lab
      • Manual on Lab

      problems with Array, String,
       Function, Recursion


    • forum icon
      Discussion on Week-02 Forum

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

  • 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
      4. Quiz #01

      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.

      Week-03 Plan
      week planTopicsMaterials
       Week-03 Lecture-01                 
      • Video on Lecture 
      • PPT on Lecture

      Brute Force algorithm                          
      Linear Search
      Insertion Sort

      Week-03 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Bubble Sort,
      Selection Sort

       Week-03 Lab
      • Video on Lab
      • Manual on Lab

      Linear Search


    • quiz icon
      Quiz-01
      Students must
      View

      Quiz Syllabus:

      • Function and Recursion
      • Euclid’s Greatest Common Divisor(GCD) Algorithm
      • Asymptotic Notation 
      • Complexity Analysis
      • Searching: Linear Search and brute force techniques.
      • Sorting: Insertion Sort

    • forum icon
      Discussion on Week-03 Forum

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

  • 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 Quicksort algorithm and its complexity
      4. Exercise the Sorting and searching Algorithm with some additional problems.


      Week-04 Plan
      week planTopicsMaterials
       Week-04 Lecture-01                                  
      • Video on Lecture 
      • PPT on Lecture


      Binary Search
      Merge Sort
      Divide and Conquer Approach                    

      Video Link
      PPT link

      FA_Lacture

      Week-04 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Quick Sort

      Video Link
      PPT link

      FA_Lecture

       Week-04 Lab
      • Video on Lab
      • Manual on Lab


      Bubble Sort
      Insertion Sort
      Binary Search

       Video Link  
      Manual Link

      FA_Lecture


    • assign icon
      Submit your activity and assignments on lab-4 (Linear Search & Binary Search and Quick Sort))
      Students must
      View
      Make a submission
    • forum icon
      Discussion on Week-04 Forum

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

  • 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 planTopicsMaterials
       Week-05 Lecture-01          
      • Video on Lecture 
      • PPT on Lecture

      Coin Change (Greedy Method)                      
      Bin-Packing Problem

      Week-05 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Greedy Partial Knapsack
      Greedy Huffman Coding

       Week-05 Lab
      • Video on Lab
      • Manual on Lab

      Selection Sort
      Merge Sort
      Quick Sort


    • assign icon
      Assignment 01

      Submit Your Assignment on...

    • assign icon
      Submit your activty and assignment on (selection sort, quick sort, bubble sort, marge sort ))
      Students must
      Mark as done
    • forum icon
      Discussion on Week-05 Forum

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

    • quiz icon
      Quiz 2
      Students must
      View
      Receive a grade
    • assign icon
      MID TERM EXAMINATION (Please read the instructions first) Assignment
      Students must
      Mark as done

  • 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)
      5. Quiz #02


      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.

      Week-06 Plan
      week planTopicsMaterials
       Week-06 Lecture-01                 
      • Video on Lecture 
      • PPT on Lecture

      Dynamic Programming                          
      Fibonacci Numbers Problem

      Week-06 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      DP: Coin Change 
      DP: 0/1 Knapsack

       Week-06 Lab
      • Video on Lab
      • Manual on Lab

      Bin Packing
      Lab performance-01


    • assign icon
      Lab 6 parformance Assignment
      Students must
      Mark as done
    • forum icon
      Discussion on Week-06 Forum

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

  • Week-07 Mid-Term Examination

    • mid term

    • Mid Term Syllabus:

      • Week-01 to Week-06

    • forum icon
      Discussion on Week-07 Forum
      Discuss on Midterm content if you have any confession or question

  • Week-08 Introduction to Dynamic Programming (Continue)

    • 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 planTopicsMaterials
       Week-08 Lecture-01                 
      • Video on Lecture 
      • PPT on Lecture

      Longest Common Subsequence (LCS)                         

      Week-08 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Longest Increasing Subsequence(LIS)

       Week-08 Lab
      • Video on Lab
      • Manual on Lab

      Bin Packing,  LCS, LIS


    • forum icon
      Discussion on Week-08 Forum

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

    • assign icon
      Lab Activity Assignment
      Students must
      Mark as done

  • Week-09 Introduction to Graph And Graph Traversal

    • Topics of discussion

      1. Introduction to Graph
      2. Graph Representation
      3. Discussion on Graph Traversal
      4. Assignment-02


      Expected Learning Outcome

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


      Week-09 Plan
      week planTopicsMaterials
       Week-09 Lecture-01                 
      • Video on Lecture 
      • PPT on Lecture

      Graph and Graph Representation                         

      Week-09 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      BFS, DFS

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

      DFS


    • forum icon
      Discussion on Week-09 Forum

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

    • assign icon
      Assignment-02

  • 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 planTopicsMaterials
       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
      • Video on Lab
      • Manual on Lab

      DFS, MST
      Lab performance-02


    • forum icon
      Discussion on Week-10 Forum

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

    • assign icon
      Final Assignment
      Students must
      Mark as done
    • assign icon
      Quiz-3 Assignment
      Students must
      Mark as done
    • assign icon
      Final Lab Work Assignment
      Students must
      Mark as done

  • Week-14 Final Examination