Data Structure & Algorithms ( Basic )

Debaloy Chatterjee

profile
Popular
Data Structure & Algorithms ( Basic )
profile
₹2,000
90 mins

Module:

  1. Asymptotic Analysis
  2. Array (1D, 2D, 3-tuple)
  3. Stack & Queue
  4. Infix, Prefix, Postfix
  5. Single Linked List
  6. Double Linked List
  7. Circular Linked List (Circular Single & Circular Double)
  8. Searching (Linear & Binary)
  9. Iterative Sorting (bubble, selection, insertion)
  10. Recursive Sorting (merge, quick)
  11. Heap (min-max, adding, deleting, sort)
  12. Binary Trees, BST, Traversal (In-order, Pre-order, Post-order)
  13. AVL Tree, Splay Tree
  14. B Tree, B+ Tree
  15. Red-Black Tree, AA Tree
  16. Graphs Representation (Adj, List & Adj. Matrix), MCST (Prims & Kruskal)
  17. Graph Traversal (DFS, BFS)
  18. SSSP Problems (Djikstra & Bellman-Ford)
  19. APSP Problem (Floyd Warshall)


The course is designed for 20 days. If you purchase for 20 days, you get 30% discount and the course is extended to 30 days.



Schedule & Fees

  • Class length: 90 minutes
  • Rate: ₹ 1,500 per day


Standard Plan:

  • Duration: 20 days
  • Base Fee: ₹30,000 or ₹1,500 per day
  • Discount: NIL
  • Payable on day 1: Pay as you go
  • Effective Duration: 20 days

Full-Payment Offer:

  • Duration: 20 days
  • Base Fee: ₹30,000
  • Discount: 30% (₹ 9,000)
  • Payable on day 1: ₹ 21,000 (lump sum on Day 1)
  • Effective Duration: 30 days


The lump-sum payment must be made on Day 1 for the discount and 10-day extension to apply. Otherwise, the standard pay-as-you-go plan remains in effect.



Note for students:

I strongly recommend first exploring these topics through free YouTube resources such as Abdul Bari, Jenny’s Lectures, Naresh IT, and Gate Smasher.

Book my sessions only if you encounter specific doubts. When you do, please list the exact topics you’d like to cover so we can use your time most effectively.

If you are unable to pay, ping me and I will provide you with self study resources.


All the best! Keep learning!

Terms | Privacy