Algorithm Design using C/C++

Categories: Programming
Wishlist Share
Share Course
Page Link
Share On Social Media

What Will You Learn?

  • Introduction & Motivation
  • Recap of Function, Recursion
  • Euclid's Greatest Common Divisor
  • Asymptotic Notation
  • Complexity Analysis
  • Searching & Sorting (Binary, Bubble, Selection, Merge and Quick Sort)
  • Greedy Approach (Coin Change, Bin Packing, Knapsack, Huffman Coding)
  • Dynamic Programming (Fibonacci Numbers, Coin Change, Knapsack, LIS, LCS, Chain Multiplication)
  • BackTracking Basic & Permutation Generator
  • Graph (BFS, DFS)
  • Topological Sort & SCC
  • Minimum Spanning Tree & (Kruskal's, Prim's, Dijkstra's, Bellman Ford)
  • Shortest Path
  • Q-bit programming Contest

Topics of Course

Free Module 1: Fundamentals of Algorithmic Techniques and Complexity Analysis

  • 1-1: Introduction to Algorithms: Pseudocode, Approaches, and Complexity
    37:46
  • 1-2: Part-1 Time Complexity and Performance Analysis
    33:30
  • 1-2: Part-2 Time Complexity and Performance Analysis
    36:02

Live Class Link

Module 2: August Month Classes

Module 3: September Month Classes

Module 4: October Month Classes

Module 5: November Month Classes

Module 6: December Month Classes

Student Ratings & Reviews

No Review Yet
No Review Yet

Your Instructors

Saifullah Anik

Khairul Islam