Topic outline

• General
  

  General

  • Welcome to Algorithm and Algorithm Lab. Welcome Audio by Course Teacher: 

    
    

    
    

    Instructor	: Taslima Ferdaus Shuva
    Designation	: Senior Lecturer
    Office address	: Room no 601, Level 6, CSE Building, DIU(UC)
    Email	: shuva.cse@diu.edu.bd
    Employee ID:	: 710001783

    
    

    Appointment in the Google Calendar:  Click here

    
    

    
    

    Mark as done
  • 
    

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

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

    
    

  • Google Classroom Code: gtjm4l3

  • Class_Attendance_Link.

    
    

  • Lab_Attendance_Link.

    
    

    Mark as done
  • Announcements Forum
  • 
    

    Mark as done
  • Lab Documentation URL

    Mark as done
  • 
    

    Navigation

    Class Test: CT1, CT2, CT3      Assignment: ASN1 , ASN2   Presentation        Mid Exam       Final Exam
    Week2Go:   WK1    WK2    WK3    WK4    WK5    WK6   WK7    WK8    WK9    WK10    WK11    WK12    WK13    WK14

    
    

    Mark as done
  • Welcome to Algorithm and Algorithm Lab. Welcome Audio by Course Teacher: 

    
    

    
    

    Instructor	: Taslima Ferdaus Shuva
    Designation	: Senior Lecturer
    Office address	: Room no 601, Level 6, CSE Building, DIU(UC)
    Email	: shuva.cse@diu.edu.bd
    Employee ID:	: 710001783

    
    

    Appointment in the Google Calendar:  Click here

    
    

    
    

    Mark as done
  • 
    

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

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

    
    

  • Google Classroom Code: gtjm4l3

  • Class_Attendance_Link.

    
    

  • Lab_Attendance_Link.

    
    

    Mark as done
  • Announcements Forum
  • 
    

    Mark as done
  • Lab Documentation URL

    Mark as done
  • 
    

    Navigation

    Class Test: CT1, CT2, CT3      Assignment: ASN1 , ASN2   Presentation        Mid Exam       Final Exam
    Week2Go:   WK1    WK2    WK3    WK4    WK5    WK6   WK7    WK8    WK9    WK10    WK11    WK12    WK13    WK14

    
    

    Mark as done
• Week-01 Preparing Background
  

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

    
    

  • Discussion on Week-01 Forum

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

  • Class Record

    Mark as done
  • Week_1_Lec_1(20 Sep 2020) URL

    Mark as done
  • Week-01_Lecture 02(23 September) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab_Week-01(21/09) URL

    Mark as done
  • Lab_Week_01(part two) URL

    Mark as done
  • Interactive Contents

    Mark as done
  • Importance of Algorithms Interactive Content

    Mark as done
  • 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

    
    

  • Discussion on Week-01 Forum

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

  • Class Record

    Mark as done
  • Week_1_Lec_1(20 Sep 2020) URL

    Mark as done
  • Week-01_Lecture 02(23 September) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab_Week-01(21/09) URL

    Mark as done
  • Lab_Week_01(part two) URL

    Mark as done
  • Interactive Contents

    Mark as done
  • Importance of Algorithms Interactive Content

    Mark as done
• Week-02 Notation and Complexity Analysis
  

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

    
    

  • Class Record

    Mark as done
  • Recursion(23 September) URL

    Mark as done
  • Week 2 Lec-01(Intro to Complexity)-27 Sep URL

    Mark as done
  • Asymptotic notation and complexity Analysis(30-09-2020) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab 2 Part 1(28-09-2020) URL

    Mark as done
  • Lab2_Part_02(28 September) URL

    Mark as done
  • Discussion on Week-02 Forum

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

  • Interactive Contents

    Mark as done
  • Array Interactive Content

    Mark as done
  • Strings Interactive Content

    Mark as done
  • Functions Interactive Content

    Mark as done
  • Recursion Interactive Content

    Mark as done
  • 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

    
    

  • Class Record

    Mark as done
  • Recursion(23 September) URL

    Mark as done
  • Week 2 Lec-01(Intro to Complexity)-27 Sep URL

    Mark as done
  • Asymptotic notation and complexity Analysis(30-09-2020) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab 2 Part 1(28-09-2020) URL

    Mark as done
  • Lab2_Part_02(28 September) URL

    Mark as done
  • Discussion on Week-02 Forum

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

  • Interactive Contents

    Mark as done
  • Array Interactive Content

    Mark as done
  • Strings Interactive Content

    Mark as done
  • Functions Interactive Content

    Mark as done
  • Recursion Interactive Content

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

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

    
    

  • Class Record

    Mark as done
  • Brute Force Technique(04-10-2020) URL

    Mark as done
  • Bubble sort, Selection Sort(07 October) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Linear Search and Insertion sort(05 October) URL

    Mark as done
  • Discussion on Week-03 Forum

    Solve selection sort by yourself and comment when done.

  • Interactive Contents

    Mark as done
  • Linear Search Interactive Content

    Mark as done
  • Bubble Sort Interactive Content

    Mark as done
  • Insertion Sort Interactive Content

    Mark as done
  • 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

    
    

  • Class Record

    Mark as done
  • Brute Force Technique(04-10-2020) URL

    Mark as done
  • Bubble sort, Selection Sort(07 October) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Linear Search and Insertion sort(05 October) URL

    Mark as done
  • Discussion on Week-03 Forum

    Solve selection sort by yourself and comment when done.

  • Interactive Contents

    Mark as done
  • Linear Search Interactive Content

    Mark as done
  • Bubble Sort Interactive Content

    Mark as done
  • Insertion Sort Interactive Content

    Mark as done
• Week-04 Searching and Sorting Algorithm Based on Divide and Conquer 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 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

    
    

  • Class Record

    Mark as done
  • Binary Search(14 October) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab Selection sort, Bubble sort(12 oct)_part1 URL

    Mark as done
  • Lab Selection sort, Bubble sort(12 oct)_part-02 URL

    Mark as done
  • Discussion on Week-04 Forum

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

  • Interactive Contents

    Mark as done
  • Binary Search Interactive Content

    Mark as done
  • Quicksort algorithm Interactive Content

    Mark as done
  • QUIZ 01

    Mark as done
  • Quiz-01(11 October)

    Quiz Syllabus:

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

    
    

  • Lab_Assignment 01(12 October)

    No late submission will be accepted

    Mark as done
  • Assignment 01

    Mark as done

    1. Suppose DIU is setting up a high configuration Computer Lab at Ashulia Campus. Now there will be hundreds of computers and they all need to be labeled. After labelling the lab assistant got puzzled thinking that how he’s going to sort them in the lab room. Help him to sort the PC’s . You can do it by sampling any 10 PC’s so that he understands the process. 

    
    

  • 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

    
    

  • Class Record

    Mark as done
  • Binary Search(14 October) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab Selection sort, Bubble sort(12 oct)_part1 URL

    Mark as done
  • Lab Selection sort, Bubble sort(12 oct)_part-02 URL

    Mark as done
  • Discussion on Week-04 Forum

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

  • Interactive Contents

    Mark as done
  • Binary Search Interactive Content

    Mark as done
  • Quicksort algorithm Interactive Content

    Mark as done
  • QUIZ 01

    Mark as done
  • Quiz-01(11 October)

    Quiz Syllabus:

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

    
    

  • Lab_Assignment 01(12 October)

    No late submission will be accepted

    Mark as done
  • Assignment 01

    Mark as done

    1. Suppose DIU is setting up a high configuration Computer Lab at Ashulia Campus. Now there will be hundreds of computers and they all need to be labeled. After labelling the lab assistant got puzzled thinking that how he’s going to sort them in the lab room. Help him to sort the PC’s . You can do it by sampling any 10 PC’s so that he understands the process. 

    
    

• Week-05 Introduction to Greedy Approach
  

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

    
    

  • Class Record

    Mark as done
  • Sorting Algorithm Practice-21 October URL

    Mark as done
  • Mid Discussion-01 November URL

    Mark as done
  • Greedy Algorithm(02 November) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Binary Search(19 October) URL

    Mark as done
  • Merge Sort(19 October) URL

    Mark as done
  • Greedy Approach(Knapsack, Haffman)- 23 November URL

    Mark as done
  • Classwork for Theory Course Forum

    Real life implementation of sorting Algorithm.

  • Interactive Contents

    Mark as done
  • Bubble, Merge & Insertion Sort Algorithms Interactive Content

    Mark as done
  • 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

    
    

  • Class Record

    Mark as done
  • Sorting Algorithm Practice-21 October URL

    Mark as done
  • Mid Discussion-01 November URL

    Mark as done
  • Greedy Algorithm(02 November) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Binary Search(19 October) URL

    Mark as done
  • Merge Sort(19 October) URL

    Mark as done
  • Greedy Approach(Knapsack, Haffman)- 23 November URL

    Mark as done
  • Classwork for Theory Course Forum

    Real life implementation of sorting Algorithm.

  • Interactive Contents

    Mark as done
  • Bubble, Merge & Insertion Sort Algorithms Interactive Content

    Mark as done
• Week-06 Mid-Term Examination
  

  Week-06 Mid-Term Examination

  • 
    

  • Mid Term Syllabus:

    • Week-01 to Week-06

  • MID Term Rules and Regulations File

    Mark as done

    Students must go through the rules before appearing in Examination

  • Mid Exam Fall 2020-PC 

    Students of Permanent campus will submit here

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_PC

    Mark as done
  • Mid Exam Fall 2020-PC Assignment

    Mark as done

    Dear Students, 

       Please go through the exam rule before starting your examination. For any kind of assistance during exam contact me via Telegram . You an call me over phone/ Email me/ Post on Google Classroom.

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_PC

    
    Steps to be followed: 
    1. Download the question
    2. Download the answer script
    3. Answer and upload the pdf file here.
    4. Submit via Google Forms and BLC.

    
    
    

  • Mid Exam Fall 2020-UC 

    Students of Uttara campus will submit here

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_UC

    
    

    Mark as done
  • Mid Exam Fall 2020-UC Assignment

    Mark as done

    Dear Students, 

       Please go through the exam rule before starting your examination. For any kind of assistance during exam contact me via Telegram . You an call me over phone/ Email me/ Post on Google Classroom.

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_UC

    
    Steps to be followed: 
    1. Download the question
    2. Download the answer script
    3. Answer and upload the pdf file here.
    4. Submit via Google Forms and BLC.

    
    
    

  • Google Form Submission

    Mark as done
  • Mid CSE221/214 URL

    Mark as done
  • Mid(Overlap) Exam Fall 2020-PC-Old 

    Mark as done
  • 
    

  • Mid Term Syllabus:

    • Week-01 to Week-06

  • MID Term Rules and Regulations File

    Mark as done

    Students must go through the rules before appearing in Examination

  • Mid Exam Fall 2020-PC 

    Students of Permanent campus will submit here

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_PC

    Mark as done
  • Mid Exam Fall 2020-PC Assignment

    Mark as done

    Dear Students, 

       Please go through the exam rule before starting your examination. For any kind of assistance during exam contact me via Telegram . You an call me over phone/ Email me/ Post on Google Classroom.

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_PC

    
    Steps to be followed: 
    1. Download the question
    2. Download the answer script
    3. Answer and upload the pdf file here.
    4. Submit via Google Forms and BLC.

    
    
    

  • Mid Exam Fall 2020-UC 

    Students of Uttara campus will submit here

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_UC

    
    

    Mark as done
  • Mid Exam Fall 2020-UC Assignment

    Mark as done

    Dear Students, 

       Please go through the exam rule before starting your examination. For any kind of assistance during exam contact me via Telegram . You an call me over phone/ Email me/ Post on Google Classroom.

    Your Script must contain your course code, ID and campus Name like: CSE221_171-15-887_UC

    
    Steps to be followed: 
    1. Download the question
    2. Download the answer script
    3. Answer and upload the pdf file here.
    4. Submit via Google Forms and BLC.

    
    
    

  • Google Form Submission

    Mark as done
  • Mid CSE221/214 URL

    Mark as done
  • Mid(Overlap) Exam Fall 2020-PC-Old 

    Mark as done
• Week-07 Introduction to Dynamic Programming
  

  Week-07 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 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

    
    

  • Class Record

    Mark as done
  • Class Record(22 November) URL

    Mark as done
  • DP Basics(25 November) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab Greedy coin Change URL

    Mark as done
  • Lab part 2- 23 November URL

    Mark as done
  • Lab_Assignment 02(23 November)

    No late submission will be accepted

    Mark as done
  • Greedy Coin Change Assignment

    Mark as done

    Submit your code and screenshot of output in a google doc and share the link here

  • 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

    
    

  • Class Record

    Mark as done
  • Class Record(22 November) URL

    Mark as done
  • DP Basics(25 November) URL

    Mark as done
  • Lab Class Record

    Mark as done
  • Lab Greedy coin Change URL

    Mark as done
  • Lab part 2- 23 November URL

    Mark as done
  • Lab_Assignment 02(23 November)

    No late submission will be accepted

    Mark as done
  • Greedy Coin Change Assignment

    Mark as done

    Submit your code and screenshot of output in a google doc and share the link here

• Week-08 Introduction to Dynamic Programming (Continue)
  

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

    
    

  • Class Record

    Mark as done
  • Lecture LCS & LIS(09 December) URL

    Mark as done
  • Discussion on Week-08 Forum

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

  • QUIZ 02(6 December)

    Mark as done
  • Quiz-02(6 December)

    Quiz Syllabus:

    • Partial Knapsack and up to week 7 coverage)

  • Lab Evaluation (7 December)

    Marks: 25

    Time: 2-3 hours

    Syllabus: 

    1. Searching and Sorting Algorithm Based on Brute Force Approach

    2. Searching and Sorting Algorithm Based on Divide and Conquer Approach

    3. Introduction to greedy approach

    
    

    Mark as done
  • Lab evaluation Assignment

    Mark as done

    Exam Time: 2 hours
    Answer any 2 questions including No 03

    1. Submit answers in a doc file with output screenshot

    2. If answers  are copied, you'll get only attendance marks(5 marks)

  • 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

    
    

  • Class Record

    Mark as done
  • Lecture LCS & LIS(09 December) URL

    Mark as done
  • Discussion on Week-08 Forum

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

  • QUIZ 02(6 December)

    Mark as done
  • Quiz-02(6 December)

    Quiz Syllabus:

    • Partial Knapsack and up to week 7 coverage)

  • Lab Evaluation (7 December)

    Marks: 25

    Time: 2-3 hours

    Syllabus: 

    1. Searching and Sorting Algorithm Based on Brute Force Approach

    2. Searching and Sorting Algorithm Based on Divide and Conquer Approach

    3. Introduction to greedy approach

    
    

    Mark as done
  • Lab evaluation Assignment

    Mark as done

    Exam Time: 2 hours
    Answer any 2 questions including No 03

    1. Submit answers in a doc file with output screenshot

    2. If answers  are copied, you'll get only attendance marks(5 marks)

• Week-09 Introduction to Graph And Graph Traversal
  

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

    
    

  • Discussion on Week-09 Forum

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

  • Assignment

    Mark as done
  • Class Record

    Mark as done
  • Graph Traversal(BFS, DFS)- 13 DECEMBER URL

    Mark as done
  • Final Discussion URL

    Mark as done
  • 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

    
    

  • Discussion on Week-09 Forum

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

  • Assignment

    Mark as done
  • Class Record

    Mark as done
  • Graph Traversal(BFS, DFS)- 13 DECEMBER URL

    Mark as done
  • Final Discussion URL

    Mark as done
• Week-10 Graph Application
  

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

    
    

  • QUIZ 03(16 December)

    Mark as done
  • Quiz-03

    Quiz Syllabus:

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

  • Presentation

    Mark as done
  • Presentation(9 December) Assignment

    Mark as done

    You have to choose between the two options:

    1. Paper Review

    2. Propose a real life problem with it's solving Algorithm

    ****No repetition will be considered. 

  • 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

    
    

  • QUIZ 03(16 December)

    Mark as done
  • Quiz-03

    Quiz Syllabus:

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

  • Presentation

    Mark as done
  • Presentation(9 December) Assignment

    Mark as done

    You have to choose between the two options:

    1. Paper Review

    2. Propose a real life problem with it's solving Algorithm

    ****No repetition will be considered. 

• Week-11 Graph: Single Source Shortest Path Algorithm
  

  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

    
    

    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

    
    

  • Discussion on Week-11 Forum

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

  • 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

    
    

  • Discussion on Week-11 Forum

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

• Week-12 Graph: All Pair 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	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

    
    

  • Lab Project Submission Link

  • Discussion on Week-12 Forum

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

  • 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

    
    

  • Lab Project Submission Link

  • Discussion on Week-12 Forum

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

• Week-13 Final Presentation and Lab Final
  

  Week-13 Final Presentation and Lab Final

  • Presentation Slide/Videos Submission Link
    

    Lab Final.

    
    

  • Discussion on Week-13 Forum

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

    
    

    
    

    . 

  • Lab final Assignment

    Mark as done
  • Presentation Slide/Videos Submission Link
    

    Lab Final.

    
    

  • Discussion on Week-13 Forum

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

    
    

    
    

    . 

  • Lab final Assignment

    Mark as done
• Week-14 Final Examination
  

  Week-14 Final Examination

  • 
    

  • Discussion on Week-14 Forum

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

  • Final Examination Script submission and Question Assignment

    Mark as done

    1. Must mention your course code(CSE221/CSE214) and section name(UCA,UC-Old/PC-Old) and your Id as file name.
    E.G. 151-15-151_CSE221_UC(old)

    2. Must submit in BLC and Google form(Both platform is mandatory)

  • Google form submission URL

    Mark as done

    Make sure to mention your id, Course code and section

  • Final Term Syllabus:

    • Week-05 to Week-9

    
    

  • End of the Semester.

  • 
    

  • Discussion on Week-14 Forum

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

  • Final Examination Script submission and Question Assignment

    Mark as done

    1. Must mention your course code(CSE221/CSE214) and section name(UCA,UC-Old/PC-Old) and your Id as file name.
    E.G. 151-15-151_CSE221_UC(old)

    2. Must submit in BLC and Google form(Both platform is mandatory)

  • Google form submission URL

    Mark as done

    Make sure to mention your id, Course code and section

  • Final Term Syllabus:

    • Week-05 to Week-9

    
    

  • End of the Semester.