Topic outline

  • General

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

      Video Message By the Instructor: 

        


          


      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



    • Header

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


    • Google Classroom Code: pcrzfl7

    • Class_Attendance_Link.


    • Class Link PCE

    • Meet Link for PCE URL

    • Class Link PCQ

    • Class Link PCQ URL

    • Lab_Attendance_Link.


    • all in one

    • Lab Documentation URL

    • LAB Tracking

  • Week-01 Preparing Background

  • Week-02 Notation and Complexity Analysis

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

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

    • Topics of discussion

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

      Expected Learning Outcome

      1. Knowledge about the Binary Search algorithm and its complexity
      2. Knowledge about the Merge sort algorithm and its complexity
      3. Knowledge about the 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

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

      Quick Sort

      Video Link
      PPT link

      PPT 2

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


      Bubble Sort
      Insertion Sort
      Binary Search

       Video Link  
      Manual Link


    • Class Record PCE

    • Merge Sort PCE URL
    • Quick Sort PCE URL

    • Class Record PCQ

    • Quick Sort PCQ URL

    • Lab Class Record

    • Interactive Contents

    • QUIZ 01

    • Quiz PCQ Assignment
      Restricted Not available unless: You belong to PCQ
    • Quiz PCE Assignment
      Restricted Not available unless: You belong to PCE

      Exam Time: 1.30 Hours                                                       Late Submission Till: 13.30 pm(with -5 deduction)

      Question:

      1. Consider your student ID as the input array (Only Digit). First of all, make a sum of all the digits in your ID.                                              10
        1. Now, if the summation is an even number, sort the array using the algorithm which first finds the smallest number and then place it in the right position. (Step wise simulation)
        2. Now, if the summation is an odd number, sort the array using the algorithm that sorts an array pairwise. (Step wise simulation)
      2. Again, consider your student ID as the input array (Only Digit). Make a summation of these digits. Then calculate the mod 8 of the sum result.    05
        1. Now, search the modulus result in your student ID array using an algorithm that will search the entire array one by one until the desired number is found. (Step wise simulation)
      ***Late submission will deduct -5

    • 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

      Lab Evaluation on Divide and conquer and Brute force approach




    • Class Record PCE

    • Mid Discussion URL

    • Class Record PCQ

    • Mid Discussion URL

    • Lab Class Record

    • Lab Evaluation-25 Marks

    • Lab Evaluation PCQ(CSE215) Assignment
      Restricted Not available unless: You belong to PCQ

      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.                                                                          [10]

      2. Devise an algorithm which will find out the smallest element from an n sized array.                                                                                    [05]

      3. Take your mothers name in an array and search your last name's last letter as a searching element.                                                       [05]

      4. Narrate a problem where you can use any particular sorting Algorithm and  also mention why you have selected it.                           [10]

      5. Oral for all(Once you submit your work, you can appear in Oral)                                                                                                                     [10]

      Even ID holders will answer the EVEN numbered problems (2,4) and odd ID holders will answer the ODD numbered  (1,3) problems. Number 5 is mandatory for all.  


      Time: 1.5 Hours for submission ,1.5 hours for Oral. Oral will start at 11.30 am , roll wise.  

      ***Late submission will deduct -5

      ***No submission over any media except BLC will be considered in any circumstances. Upload partial works if you can not submit within time as after given time NO SCRIPTS WILL BE EVALUATED IN ANY CIRCUMSTANCES. 

    • Classwork PCE 

    • Bin Packing Problem(PCE) Assignment
      Restricted Not available unless: You belong to PCE

      Solve the First Fit decreasing and Full Bin Packing problem from slide and submit here


    • Classwork PCQ

    • Bin Packing Problem(PCQ) Assignment
      Restricted Not available unless: You belong to PCQ

      Solve the First Fit decreasing and Full Bin Packing problem from slide and submit here


    • Interactive Contents

  • Week-06 Mid-Term Examination

    • mid term

    • Mid Term Syllabus:

      • Week-01 to Week-05

    • Mid Exam Summer 2021-PCE 

      Your Script must contain your course code, ID and section and exam type like: CSE214_171-15-887_MID_PCE

    • Mid Exam PCE Assignment
      Restricted Not available unless: You belong to PCE

      No submission over email, Telegram, messenger, WhatsApp after due time will be considered in any circumstances. 

      Dear Students, 

      Please go through the exam rule before starting your examination. For any kind of assistance during exam contact me via Telegram .

      Your File name must be like this (Ex. CSE214_171-15-1234_PCF_Mid.pdf)


      Steps to be followed: 

      1. Download the question and answer script
      2.  Answer and upload the pdf file here within 2.30 hours.
      3. Your file size must be less than 10MB. Use online compressor if needed.

      4. Follow the instructions strictly. 




    • Mid Exam Summer-2021  PCQ


    • Mid Exam PCQ Assignment
      Restricted Not available unless: You belong to PCQ

      No submission over email, Telegram, messenger, WhatsApp after due time will be considered in any circumstances. 

      Dear Students, 

      Please go through the exam rule before starting your examination. For any kind of assistance during exam contact me via Telegram .

      Your File name must be like this (Ex. CSE214_171-15-1234_PCF_Mid.pdf)


      Steps to be followed: 

      1. Download the question and answer script
      2.  Answer and upload the pdf file here within 2.30 hours.
      3. Your file size must be less than 10MB. Use online compressor if needed.

      4. Follow the instructions strictly. 




    • Mid script submission-PCQ URL
      Restricted Not available unless: You belong to PCQ
    • Form Submission_PCE URL
      Restricted Not available unless: You belong to PCE

  • Week-07 Introduction to Dynamic Programming

  • 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


    • Class Record PCQ

    • LCS, LIS PCQ URL

    • Class Record PCE

    • LCS, LIS PCE URL

    • Classwork on LCS, LIS

    • Classwork on LCS, LIS Assignment
      Restricted Not available unless: You belong to PCQ

      1. For LCS: Input First name, Last name

      2. For LIS: Input Your ID 

    • Discussion on Week-08 Forum

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

  • Week-09 Introduction to Graph And Graph Traversal

  • Week-10 Graph Application

    • Topics of discussion

      1. DFS Application
      2. Quiz #03


      Expected Learning Outcome

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



      Week-10 Plan
      week 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


    • Presentation

    • Presentation PCQ Assignment
      Restricted Not available unless: You belong to PCQ

      Propose a real life problem with it's solving Algorithm(Individual)

      ****No repetition will be considered. 

    • Presentation PCE Assignment
      Restricted Not available unless: You belong to PCE

      Propose a real life problem with it's solving Algorithm(Individual)

      ****No repetition will be considered. 

    • Discussion on Week-10 Forum

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

    • Class Record PCQ

    • DFS Application URL

    • Class Record PCE

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

      MST: Kruskal’s Algorithm          
      MST: Prim’s Algorithm
                      


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

      SSSP: Dijkstra’s Algorithm

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

       MST, Dijkstra’s Algorithm


    • QUIZ 02(16 August)

    • Quiz-02

      Quiz Syllabus:

      • Dp: LCS
      • DP: LIS
      • Graph representation
      • BFS
      • DFS

    • Mid Term(absent student)

    • Class Record PCE

    • Prim's, Kruskal's URL

    • Class Record PCQ

    • Prim's, Kruskal's URL
    • Final Discussion URL

  • Week-12 Lab Final

    Topics:


    All the problems solved till now including:


    1. Brute force

    2. Divide and Conquer

    3. Greedy Approach

    4. Dynamic programming


    • Discussion on Week-13 Forum

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



      . 

    • Lab Report Submission

    • Lab Report Submission Assignment
      Restricted Not available unless: You belong to PCQ

      Submit all the problems solved in the entire semester in a PDF form as Lab Report

    • Lab Final

    • Lab Final Script Submission Assignment
      Restricted Not available unless: You belong to PCQ

      1. Except Viva, No examination will be counted
      2. Viva will be held ID wise. If you are absent during your turn, you'll get the chance once all the session is over.
      3. Viva will start from 11 am and within 11.30 all the submission must be done.

  • Week-14 Final Examination

    • Final

    • Final Examination Script submission and Question(PCE) Assignment
      Restricted Not available unless: You belong to PCE

      1. Must mention your course code(CSE214) and section name(

      PC-E/PC-Q) and your Id as file name.

      E.G. 151-15-151_CSE214_PCA

      2. Must submit in BLC

    • Final Examination Script submission and Question(PCQ) Assignment
      Restricted Not available unless: You belong to PCQ

      1. Must mention your course code(CSE214) and section name(

      PC-E/PC-Q) and your Id as file name.

      E.G. 151-15-151_CSE214_PCA

      2. Must submit in BLC

    • End of the Semester.

    • Discussion on Week-14 Forum

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