Course

In the introduction, students learn dsa with c++ overview, variables, data types, operators, and control structures.

In the OOP module, they learn and get an understanding of object-oriented programming , such as encapsulation, inheritance, and polymorphism.

In arrays and strings, they learn to declare and initialize. And access their elements, and how to use them in programs.

In this section, students learn to link lists in C++ with basic link operations; such as insertion, deletion, and traversal.

Stacks are containers of objects based on arrays, and they follow a Last-In-First-Out (LIFO) order. They learn about stacks and queues with arrays and linked lists. They learn to perform stack, push, pop, enqueue, and dequeue.

In trees, we've covered the implementation of binary trees with traversals, searching, insertion, and deletion.

They learn to graph representations, traversal algorithms, the shortest path algorithms, and minimum spanning tree algorithms.

In this module, they learn bubble sort, insertion sort, selection sort, merge sort, quicksort, linear search, and binary search.

• Introduction to C, C++ programming language
• Differences between C and C++
• Variables and data types in C++
• Basic input and output functions in C++

• Introduction to classes and objects
• Data members and member functions
• Constructors and destructors
• Access specifiers: public, private, and protected

• Understanding inheritance
• Types of inheritance
• Virtual functions and polymorphism
• Abstract classes and interfaces

• Introduction to templates
• Function templates and class templates
• Introduction to exception handling
• Try, catch, and throw blocks

• Flowcharts
• Variables and Data Types
• Conditional Statements

• While LOOPS
• Patterns
• For Loops
• Functions

• Introduction to Arrays
• Searching and Sorting
• Strings and 2D Arrays
• Strings
• 2D Arrays
• 2D Arrays, Storage of 2D Arrays

• Recursion
• Time and Space Complexity

• Basics of Oops
• Advance Concepts of Oops

• Linked Lists
• Stacks and Queues

• Generic Trees
• Binary Trees
• Binary Search Trees