Algorithm

Section outline

• Select section General

  General

  Collapse all Expand all

  • Select activity Announcements

    

    Announcements Forum
  • Select activity Welcome to Algorithm and Algorithm Lab Course........

    Welcome to Algorithm and Algorithm Lab Course.............

  • Select activity Label

    
    

  • Select activity Instructor          &nbsp...

    Instructor              : Tanzina Afroz Rimi

    
    Destination            : Lecturer
    Office                     : Room #103 (1st floor), Daffodil Tower-5, Daffodil International University, 102,                                                              Subhanbagh, Dhanmondi, Dhaka-1207
    Office Hour            : Sunday (14.00/16.00), Wednesday(14.00/16.00) or by appointment
    Contact Number    : +8801716405475
    E-mail                     : tanzinaafroz.cse@diu.edubd
    Appointment in the Google Calendar: Click here

  • Select activity Course Rationale Algorithms deals with effici...

    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.

    
    

  • Select activity Course ObjectiveThis course introduces students to...

    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.

  • Select activity Course Outcomes (CO’s) CO1 A...

    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.

    
    

  • Select activity Let Make Some Fun with Algorithm before starting w...

    Let Make Some Fun with Algorithm before starting with the visualization

  • Select activity Grading SchemeTheory Class      &nb...

    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%
    

  • Select activity Text Book:a.    Introduction to Alg...

    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:

    • www.visualgo.net 
    • www.geeksforgeeks.org
    • www.topcoder.com 
    • www.codeforces.com 

    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/

    
    

  • Select activity Student Interest Survey

    

    Student Interest Survey

    Please let me know what do you want to learn from this course

  • Select activity Google Classroom Code: 

    Google Classroom Code: 

  • Select activity Recordings:For O_9:1st class2nd class01/05/20204/0...

    Recordings:
    

    For O_9:

    1st class

    2nd class

    01/05/2020

    4/06/2020

    8/06/2020

    10/06/2020

    11/06/2020

    15/06/2020

    16/06/2020

    17/06/2020

    22/06/2020

    24/06/2020

    25/06/2020

    29/06/2020

    01/07/2020

    02/07/2020

    20/07/2020

    22/07/2020

    23/07/2020

    27/07/2020

    For O_11:

    2nd class

    31/04/2020

    1/05/2020

    2/05/2020

    4/06/2020

    8/06/2020

    10/06/2020

    11/06/2020

    15/06/2020

    16/06/2020

    17/06/2020

    22/06/2020

    24/06/2020

    25/06/2020

    29/06/2020

    01/07/2020

    02/07/2020

    20/07/2020

    22/07/2020

    23/07/2020

    27/07/2020

    
    

    
    

  • Select activity Announcements

    

    Announcements Forum
  • Select activity How to submit code using Pastebin

    Completion

    Students must

    

    Mark as done

    How to submit code using Pastebin

    
    

  • Select activity What's app group:O-9 sectionO-11 Section

    Completion

    Students must

    

    Mark as done

    What's app group:

    O-9 section

    O-11 Section

  • Select activity Online Exam Response Submission Template 2020

    

    Online Exam Response Submission Template 2020 File

    Completion

    Students must

    

    View
  • Select activity Open Book Exam Guideline CSE-Student

    

    Open Book Exam Guideline CSE-Student File

    Completion

    Students must

    

    View
  • Select activity Calendar

    Completion

    Students must

    

    Mark as done

    Calendar

    
    

  • Select activity Calendar (copy)

    Completion

    Students must

    

    Mark as done

    Calendar

    
    

• Select section Week-01 Preparing Background

  Week-01 Preparing Background

  • Select activity Topics of discussionIntroduction and importance of...

    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 plan	Topics	Materials
    Week-01 Lecture-01           Video on Lecture  PPT on Lecture	Introduction, Motivation Course logistics	Video Link      PPT link
    Week-01 Lecture-02 Video on Lecture  PPT on Lecture	Function and Recursion  Euclid’s Greatest Common  Divisor(GCD) Algorithm	Video Link PPT link
    Week-01 Lab Video on Lab Manual on Lab	A decision on structures and loop,   Array, String, Function, Recursion	Video Link            Manual Link

    
    

  • Select activity Discussion on Week-01

    

    Discussion on Week-01 Forum

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

    Conditional Statement 

    Loop

    Break & continue

    Array

  • Select activity String/Function

    

    String/Function Assignment

    Not available unless: You belong to CSE_214_O_11
• Select section Week-02 Notation and Complexity Analysis

  Week-02 Notation and Complexity Analysis

  • Select activity Topics of discussionIntroduction with the Asy...

    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 plan	Topics	Materials
    Week-02 Lecture-01 Video on Lecture  PPT on Lecture	Asymptotic Notation	Video Link PPT link Add-Content
    Week-02 Lecture-02 Video on Lecture  PPT on Lecture	Complexity Analysis	Video Link PPT link
    Week-02 Lab Video on Lab Manual on Lab	problems with Array, String,  Function, Recursion	Video Link Manual Link

    
    

  • Select activity Discussion on Week-02

    

    Discussion on Week-02 Forum

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

  • Select activity Time Complexity

    Time Complexity

    
    

  • Select activity String/Function -O-9

    

    String/Function -O-9 Assignment

    Not available unless: You belong to Section_O_9
• Select section Week-03 Searching and Sorting Algorithm Based on Brute Force Approach

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

  • Select activity Topics of discussionIntroduction to brute for...

    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 plan	Topics	Materials
    Week-03 Lecture-01                  Video on Lecture  PPT on Lecture	Brute Force algorithm                           Linear Search Insertion Sort	Video Link PPT link
    Week-03 Lecture-02 Video on Lecture  PPT on Lecture	Bubble Sort, Selection Sort	Video Link PPT link
    Week-03 Lab Video on Lab Manual on Lab	Linear Search	Video Link Manual Link

    
    

  • Select activity Discussion on Week-03

    

    Discussion on Week-03 Forum

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

  • Select activity Linear Search

    Linear Search

    
    

  • Select activity Selection Sort

    Completion

    Students must

    

    Mark as done

    Selection Sort

    
    

    
    
  • Select activity Insertion Sort

    Completion

    Students must

    

    Mark as done

    Insertion Sort

    
    

  • Select activity Quiz-01

    

    Quiz-01

    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

  • Select activity Linear Search & Insertion Sort

    

    Linear Search & Insertion Sort Assignment

    Not available unless: You belong to CSE_214_O_11
  • Select activity Linear Search & Insertion Sort - O9

    

    Linear Search & Insertion Sort - O9 Assignment

    Not available unless: You belong to Section_O_9
  • Select activity Bubble sort & Selection Sort

    

    Bubble sort & Selection Sort Assignment

    Not available unless: You belong to CSE_214_O_11
  • Select activity Bubble sort & Selection Sort

    

    Bubble sort & Selection Sort Assignment

    Not available unless: You belong to Section_O_9
• Select section Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach

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

  • Select activity Topics of discussionIntroduction to Divide an...

    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 plan	Topics	Materials
    Week-04 Lecture-01                                   Video on Lecture  PPT on Lecture	Binary Search Merge Sort Divide and Conquer Approach	Video Link PPT link
    Week-04 Lecture-02 Video on Lecture  PPT on Lecture	Quick Sort	Video Link PPT link
    Week-04 Lab Video on Lab Manual on Lab	Bubble Sort Insertion Sort Binary Search	Video Link   Manual Link

    
    

  • Select activity Merge Sort  

    Completion

    Students must

    

    Mark as done

    Merge Sort

     

  • Select activity Binary Search

    Completion

    Students must

    

    Mark as done

    Binary Search

    
    

  • Select activity Discussion on Week-04

    

    Discussion on Week-04 Forum

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

  • Select activity Recursion

    

    Recursion Assignment

    Not available unless: You belong to CSE_214_O_11
• Select section Week-05 Introduction to Greedy Approach

  Week-05 Introduction to Greedy Approach

  • Select activity Topics of discussionIntroduction to Greedy Approac...

    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-01           Video on Lecture  PPT on Lecture	Coin Change (Greedy Method)                       Bin-Packing Problem	Video Link                  PPT link
    Week-05 Lecture-02 Video on Lecture  PPT on Lecture	Greedy Partial Knapsack Greedy Huffman Coding	Video Link PPT link
    Week-05 Lab Video on Lab Manual on Lab	Selection Sort Merge Sort Quick Sort	Video Link Manual Link

    
    

  • Select activity Quick sort

    

    Quick sort Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Coin Change

    

    Coin Change Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Lab implementation

    

    Lab implementation Assignment

    Not available unless: You belong to CSE_214_O_11
  • Select activity Lab implementation

    

    Lab implementation Assignment

    Not available unless: You belong to Section_O_9
  • Select activity Bin packing 

    Completion

    Students must

    

    Mark as done

    Bin packing 

    
    

  • Select activity How to write Pseudocode

    

    How to write Pseudocode Interactive Content

    Completion

    Students must

    

    Mark as done
  • Select activity Assignment 01

    

    Assignment 01

    Submit Your Assignment on...

  • Select activity Discussion on Week-05

    

    Discussion on Week-05 Forum

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

• Select section Week-06 Introduction to Dynamic Programming

  Week-06 Introduction to Dynamic Programming

  • Select activity Topics of discussion Introduction to Dynamic ...

    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 plan	Topics	Materials
    Week-06 Lecture-01                  Video on Lecture  PPT on Lecture	Dynamic Programming                           Fibonacci Numbers Problem	Video Link PPT link
    Week-06 Lecture-02 Video on Lecture  PPT on Lecture	DP: Coin Change  DP: 0/1 Knapsack	Video Link PPT link
    Week-06 Lab Video on Lab Manual on Lab	Bin Packing Lab performance-01	Video Link Manual Link

    
    

  • Select activity Quiz-02

    

    Quiz-02

    Quiz Syllabus:

    • Binary Search
    • Bubble Sort
    • Selection Sort
    • Merge Sort
    • Quick Sort
    • Coin Change (Greedy Based)
    • Bin-Packing
    • Partial Knapsack

  • Select activity Quiz-1

    

    Quiz-1 Assignment

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion on Week-06

    

    Discussion on Week-06 Forum

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

• Select section Week-07 Mid-Term Examination

  Week-07 Mid-Term Examination

  • Select activity Label

    
    

  • Select activity Assignment for Midterm Exam, Summer 2020.

    

    Assignment for Midterm Exam, Summer 2020.

    Completion

    Students must

    

    Mark as done
  • Select activity Mid Term Syllabus:Week-01 to Week-06

    Mid Term Syllabus:

    • Week-01 to Week-06

  • Select activity Discussion on Week-07

    

    Discussion on Week-07 Forum

    Discuss on Midterm content if you have any confession or question
  • Select activity Paper submission

    

    Paper submission Assignment

    Completion

    Students must

    

    Mark as done
• Select section Week-08 Introduction to Dynamic Programming (Continue)

  Week-08 Introduction to Dynamic Programming (Continue)

  • Select activity Topics of discussionIntroduction to Dynamic Progra...

    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                  Video on Lecture  PPT on Lecture	Longest Common Subsequence (LCS)	Video Link PPT link
    Week-08 Lecture-02 Video on Lecture  PPT on Lecture	Longest Increasing Subsequence(LIS)	Video Link PPT link
    Week-08 Lab Video on Lab Manual on Lab	Bin Packing,  LCS, LIS	Video Link Manual Link

    
    

  • Select activity Discussion on Week-08

    

    Discussion on Week-08 Forum

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

• Select section Week-09 Introduction to Graph And Graph Traversal

  Week-09 Introduction to Graph And Graph Traversal

  • Select activity Topics of discussionIntroduction to GraphGraph Rep...

    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 plan	Topics	Materials
    Week-09 Lecture-01                  Video on Lecture  PPT on Lecture	Graph and Graph Representation	Video Link PPT link
    Week-09 Lecture-02 Video on Lecture  PPT on Lecture	BFS, DFS	Video Link PPT link
    Week-09 Lab Video on Lab Manual on Lab	DFS	Video Link Manual Link

    
    

  • Select activity Discussion on Week-09

    

    Discussion on Week-09 Forum

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

  • Select activity Assignment-02

    

    Assignment-02
  • Select activity Coin-change & knapsack

    

    Coin-change & knapsack Assignment

    Not available unless: You belong to CSE_214_O_11
• Select section Week-10 Graph Application

  Week-10 Graph Application

  • Select activity Topics of discussionDFS ApplicationQuiz #03Expecte...

    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	Video Link PPT link
    Week-10 Lecture-02 Video on Lecture  PPT on Lecture	Ts, SCC	Video Link PPT link
    Week-10 Lab Video on Lab Manual on Lab	DFS, MST Lab performance-02	Video Link Manual Link

    
    

  • Select activity Quiz-03

    

    Quiz-03

    Quiz Syllabus:

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

  • Select activity Discussion on Week-10

    

    Discussion on Week-10 Forum

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

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

  Week-11 Graph: Single Source Shortest Path Algorithm

  • Select activity Topics of discussionDiscussion on Minimum Spanning...

    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

    
    

    Week-11 Plan

    week plan	Topics	Materials
    Week-11 Lecture-01                  Video on Lecture  PPT on Lecture	MST: Kruskal’s Algorithm           MST: Prim’s Algorithm	Video Link            PPT link
    Week-11 Lecture-02 Video on Lecture  PPT on Lecture	SSSP: Dijkstra’s Algorithm	Video Link PPT link
    Week-11 Lab Video on Lab Manual on Lab	MST, Dijkstra’s Algorithm	Video Link Manual Link

    
    

  • Select activity Discussion on Week-11

    

    Discussion on Week-11 Forum

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

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

  Week-12 Graph: All Pair Shortest Path Algorithm

  • Select activity Topics of discussionDiscussion on All Pair Shortes...

    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	Video Link            PPT link
    Week-12 Lecture-02 Video on Lecture  PPT on Lecture	Floyd–Warshall algorithm	Video Link PPT link
    Week-12 Lab Video on Lab Manual on Lab	Floyd–Warshall algorithm	Video Link Manual Link

    
    

  • Select activity Lab Project Submission Link

    Lab Project Submission Link

  • Select activity Discussion on Week-12

    

    Discussion on Week-12 Forum

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

• Select section Week-13 Final Presentation and Lab Final

  Week-13 Final Presentation and Lab Final

  • Select activity Presentation Slide/Videos Submission LinkLab Final...

    Presentation Slide/Videos Submission Link
    

    Lab Final.

    
    

  • Select activity Discussion on Week-13

    

    Discussion on Week-13 Forum

    Discuss on Week-13 on Final Presentation and Lab Final.

    
    

    
    

    . 

• Select section Week-14 Final Examination

  Week-14 Final Examination

  • Select activity Label

    
    

  • Select activity Assignment for Final Exam, Summer 2020.

    

    Assignment for Final Exam, Summer 2020.

    Completion

    Students must

    

    Mark as done
  • Select activity Discussion on Week-14

    

    Discussion on Week-14 Forum

    Discuss on Final Exam content if you have any confession or question

  • Select activity End of the Semester.

    End of the Semester.