Course

This section introduces the C++ programming language and its features, including variables, data types, operators, and control structures.

In this section, students learn the principles of object-oriented programming, such as encapsulation, inheritance, and polymorphism.

This section covers the basics of arrays and strings in C++, including how to declare and initialise them, how to access their elements, and how to use them in programs.

In this section, students learn how to implement linked lists in C++. This includes the basic operations on linked lists, such as insertion, deletion, and traversal.

This section covers the implementation of stacks and queues using arrays and linked lists. Students learn about stack and queue operations, such as push, pop, enqueue, and dequeue.

This section covers the implementation of binary trees, including traversals, searching, insertion, and deletion. Students also learn about balanced trees, such as AVL trees and red-black trees.

In this section, students learn about graphs and their implementation in C++. This includes graph representations, traversal algorithms, shortest path algorithms, and minimum spanning tree algorithms.

This section covers various sorting and searching algorithms, such as 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