• CSE214 & CSE215 (Theory & LAB)

    "For me, great algorithms are the poetry of computation"

                                                                                                                                                                        --Francis Sullivan

    • Algorithm Online Class URL

      PC-A: 10:00 - 11:30 (Saturday), 08:30 - 10:00 (Monday), Lab 08:30 - 11:30 (Wednesday)

      PC-B: 13:00 - 14:30 (Saturday)  08:30 - 10:00 (Sunday) Lab 10:00 - 13:00 (Tuesday)


    • Counseling Hour URL

    • Instructor

                   






               Dr. S M Aminul Haque 
               (Associate Professor)
      aminul.cse@daffodilvarsity.edu.bd 

            Telegram: 01847140129

      Prefects

         

            Md. Fazley Rabbe                 Md. Sharif Khan          Md. Shohidul Islam Polash        Shazzad Hossen
            Algorithm Prefect                Algorithm Prefect               Algorithm Prefect               Algorithm Prefect
            fazley15-1519@diu.edu.bd                sharif15-2002@diu.edu.bd            shohidul15-2523@diu.edu.bd         shazzad15-2420@diu.edu.bd

              Telegram: 01701046745                    Telegram: 01741976078                     Telegram: 01316400647                  Telegram: 01645288850

    • Quick Navigation
      Assessments: CT1  CT2  CT3      Assignment       Presentation         Mid Exam       Final Exam  Lab Test-1   Lab Test-2   Lab Final
      Week2Go:   WK1    WK2    WK3    WK4    WK5    WK6   WK7    WK8
◄Week 7: Dynamic Programming (part 2)Lab Final►

Week 8: Graphs (part 1)

  • Week 8: Graphs (part 1)

    LESSON OBJECTIVE

    • To teach how graphs and trees play an important role in solving many of our real life problems and writing corresponding algorithms to solve the problems

    LEARNING OUTCOMES

    • Explain non-linear data structures (graphs & trees) and scenarios where they are used
    • Search over a graph or tree and make different operations on that
    • Interpret complexities of different graph operations

    TOPICS

    • Basics of graphs
    • Definitions of different types of graphs
    • Memory representation of graphs
    • Applications of graphs
    • Graph traversals (BFS, DFS)

    CONTENTS

◄Week 7: Dynamic Programming (part 2)Lab Final►