What to study ? Your future depends on what path you follow.
Live online class through
High Performance Computing
Parallel programming and parallel algorithms View details
Offline classes
C, C++ & DSA
Time 7:30 to 8:30 PM (Evening)
Days : Tue, Thu & Sat.
Starts on 5-March-2026
Fee Rs.12000/-
(Cannot be paid in installments)
Pay fee and book your seat now.
Classroom audio recording / code will be available for download through our website.
This helps students to revise, write down missed theory and document everything in neat and tidy fashion.
C,   C++   &   DSA Course contents
C Programming Language
  1. Fundamentals
  2. Structure of a program
  3. Installing MinGW
  4. Compiling
  5. why include header files
  6. Performing I/O
  7. if/else
  8. switch/case
  9. for/while/do-while loop
  10. Array
  11. Array algorithms
  12. Sorting algorithms
  13. Creating functions other than main
  14. Pointers
  15. Call by value / reference
  16. Passing array as arguments
  17. Using Pointers as an array
  18. Global variable
  19. Dynamic memory allocation
  20. malloc & free
  21. Character data type
  22. Strings
  23. scanf / format specifiers / stdin buffer
  24. Clearing stdin buffer
  25. String algorithms & functions
  26. Structures
  27. Pointer to structure
  28. Structure padding & packing
  29. Pointer to function
  30. Passing command line arguments
  31. Creating macros
  32. typedef
  33. Linked list and tree algorithms
  34. File handling
  35. Reading/writing char to file
  36. Reading/writing string to file
  37. Reading/Writing structures to file
  38. Creating header files
  39. Include guards
  40. Creating library
  41. Application development
C++ Programming Language
  1. Polymorphism
  2. Call by reference (Creating alias)
  3. Encapsulation
  4. Static method
  5. Static property
  6. this pointer
  7. Procedural v/s Object oriented programming
  8. namespaces
  9. Overloading insertion operator
  10. Overloading extraction operator
  11. Creating Monitor / Keyboard classes
  12. cout / cin
  13. Dynamic memory allocation
  14. new and delete operators
  15. Function parameter with default argument
  16. Empty Constructor
  17. Default Constructor
  18. Parameterized Constructor
  19. Default argument constructor
  20. Copy constructor
  21. Move constructor
  22. Copy assignment operator
  23. Move assignment operator
  24. Overloading data type
  25. Friend function
  26. Friend class
  27. Return Value Optimization (RVO)
  28. Creating TMString class
  29. Overloading arithmetic operators
  30. Overloading relational operators
  31. Overloading dereferencing operator
  32. Functors (callable objects)
  33. function templates
  34. Class templates
  35. Function templates
  36. Creating TMVector class
  37. Overloading [] subscript operator
  38. Creating TMList class
  39. Overloading increment/decrement operators
  40. Creating Iterators
  41. Standard Template Library
  42. STL Types: List,Stack,Queue,Map & Set
  43. STL - When to use what, in online assesment coding rounds
  44. Inheritance
  45. Virtual Inheritance
  46. Constructor execution sequence in case of inheritance
  47. Destructor execution sequence in case of inheritance
  48. Method Overriding
  49. Virtual functions
  50. Virtual destructor
  51. Virtual polymorphism
  52. Pure virtual functions
  53. Abstract class
  54. File Handling
  55. Smart Pointers (Unique/Shared/Weak)
  56. Exception handling
  57. cache hit/cache miss
  58. Code Optimization to avoid cache miss
  59. lambdas
  60. Multithreading
  61. Synchronizing threads
  62. Communication between threads
Data Structures & Algorithms
  1. Linear sort
  2. Bubble sort
  3. Selection sort
  4. Insertion sort
  5. Shell sort
  6. Creating Max/Min Heap
  7. Heap sort
  8. Priority Queue using heap
  9. Stack
  10. Queue
  11. Quick Sort using recursion
  12. Quick Sort without recursion
  13. Merge Sort using recursion
  14. Merge Sort without recursion
  15. Singly Linked List
    • add at end
    • insert at top
    • insert at position
    • traverse top to bottom
    • traverse bottom to top
    • remove from position
    • clear list
  17. Doubly Linked List
    • add at end
    • insert at top
    • insert at position
    • traverse top to bottom
    • traverse bottom to top
    • remove from position
    • clear list
  18. Binary Search Tree
    • insert
    • search
    • remove
    • inorder traversal with recursion
    • inorder traversal without recursion
    • preorder traversal with recursion
    • preorder traversal without recursion
    • postorder traversal with recursion
    • postorder traversal without recursion
    • level order traversal
    • getting the height of the tree
    • clear tree
  19. AVL Tree (Self balanced tree)
    • insert
    • search
    • remove
    • inorder traversal with recursion
    • inorder traversal without recursion
    • preorder traversal with recursion
    • preorder traversal without recursion
    • postorder traversal with recursion
    • postorder traversal without recursion
    • level order traversal
    • getting the height of the tree
    • clear tree
  20. Red Black Tree
    • insert
    • search
    • remove
    • inorder traversal with recursion
    • inorder traversal without recursion
    • preorder traversal with recursion
    • preorder traversal without recursion
    • postorder traversal with recursion
    • postorder traversal without recursion
    • level order traversal
    • getting the height of the tree
    • clear tree
  21. Creating Map class by wrapping up Red Black Tree
  22. Creating HashTable
  23. Converting infix expression to prefix/postfix
  24. Evaluating prefix/postfix expressions
  25. Graph (Shortest Path Algorithms)
  26. Dijkstra's (Breadth first search algorithm)
  27. Dijkstra's (Depth first search algorithm)

A 2026 Gift
for our students

You will get free access to our
Rust programming language
online course for free.

Those who are good at C/C++, learning Rust will be fun and and rewarding.

Access will be available from
15th Feb 2026