Section outline

  • Assalamu 'Alaikum.

    I am Fatema Tuj Johora, welcoming you to Algorithms Course.  

    I hope we will learn together to enrich ourselves and together we can make this journey memorable. 
    May the Almighty grant you peace and happiness always.


    • Header


    • Instructor : Fatema Tuj Johora (FTJ)

      Office Room #316 (2nd floor) - AB4

      Office Hour   : 8:30 am to 4:00pm

      Contact Number:  01315689508

      Email: fatema.cse@diu.edu.bd



    • 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%
      Class Tests/Quizzes:  15% 
      Assignment: 5%
      Presentation (using video/ppt): 8%
      Midterm Exam: 25%
      Final Exam: 40%

      Lab Attendance: 10%
      Lab Performance Test: 25%
      Assignment + Viva: 10%
      Project: 25%
      Lab Final: 30%


    • Text Book:

      a.    Introduction to Algorithms ,

      Click here for 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/


    • NOTICE BOARD

      QUIZ FOR PC-C: 

      TOPICS: GRAPH