Logo

Design and Analysis of Algorithms (DAA)

Design and Analysis of Algorithms(DAA) HamroCSIT Revision Class

19 lessons12h 18m totalUpdated June 2026

Course content

19 lessons · 12h 18m total

  • Functional Knapsack , Kruskal Algorithm , Huffman Coding
    53:00
  • Huffman Coding , Prims Algorithm , DijKstras Algorithm , Job Sequencing
    46:00
  • Job Sequencing , Chinese Remainder Theorem
    50:00
  • Longest Common Subsequence , Miller Rabin
    28:00
  • Backtracking , NQueens Problem
    27:00
  • 0 - 1 Knapsack Problem , Vertex Cover Problem
    45:00
  • GCD , Fibonacci , Sequential / Linear Search , Bubble / Selection / Insertion Sort
    40:00
  • GCD , Fibonacci , Sequential / Linear Search , Bubble / Selection / Insertion Sort Pseudo Code
    53:00
  • Binary Search , Min - Max , Merge / Quick / Heap Sort
    48:00
  • Binary Search , Min - Max , Merge / Quick Sort Code Tracing
    45:00
  • Quick Sort / Heap Sort (Max Heap) Code Tracing
    42:00
  • Asymptotic Notation , Big O Notation , Bin N Notation , Big Theta Notation
    23:00
  • Recurrence Relation and its method , Arithmetic / Geometric / Logarithmic Series
    49:00
  • Logarithmic Series , Recursion Tree Method
    34:00
  • Recursion Tree Method , Cost Calculation Formula , Master Method
    34:00
  • Substitution Method ( guess , base , inductive step )
    15:00
  • O - 1 Knapsack Problem Dynamic Programming and Formula Discussions
    27:00

Description

Design and Analysis of Algorithms(DAA) HamroCSIT Revision Class This course introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, divide and conquer strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness, and approximation algorithms. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed.