- Understand the fundamentals of object-oriented data structures and their real-world applications.
- Describe the properties and operations of Binary Search Trees, AVL trees, and other search trees.
- Implement various tree-based data structures and perform operations like insert, delete, and search.
- Analyze heap structures for priority queue implementation and dynamic memory management.
- Develop algorithms for constructing and balancing AVL and Red-Black Trees.
- Apply disjoint set operations in the context of union-find and fast find problems.
- Compare graph traversal methods such as DFS and BFS for efficient searching.
- Construct Minimum Spanning Trees using Prim’s and Kruskal’s algorithms.
- Differentiate among sorting techniques and their time complexities.
- Demonstrate programming ability through the practical implementation of all studied data structures.

Object-Oriented Data Structures in C++
Apply OOP principles to implement modular and reusable data structures in C++.
Introduction
What you'll learn ?
- Explain how different object-oriented data structures optimize data handling and processing.
- Identify suitable tree structures like BST, AVL, and Red-Black trees for specific use cases.
- Write C++ programs to perform insertion, deletion, and searching on various trees.
- Evaluate heap operations for effective use in real-time priority queue problems.
- Balance AVL trees using rotations and apply Red-Black Tree transformations.
- Utilize union-find algorithms in problems involving disjoint subsets.
- Perform depth-first and breadth-first graph traversals to explore complex data networks.
- Build Minimum Spanning Trees using standard algorithms like Prim’s and Kruskal’s.
- Assess the efficiency of various sorting methods based on input data and use-case.
- Create functional C++ programs integrating multiple data structures for given problem statements.
Certification
- KLiC courses are recognised by Yashwantrao Chavan Maharashtra Open University (YCMOU).
- MKCL provides certificate to the KLiC learner after his/her successful course completion.
- Yashwantrao Chavan Maharashtra Open University (YCMOU) provides mark sheet to successfully passed KLiC learners (Jurisdiction: Maharashtra).
Academic Approach
The academic approach of the courses focuses on the “work-centric” education i.e. begin with work (and not from a book!), derive knowledge from work and apply that knowledge to make the work more wholesome, useful and delightful. The ultimate objective is to empower the Learner to engage in socially useful and productive work. It aims at leading the learner to his/her rewarding career as an employee or entrepreneur as well as development of the community to which s/he belongs. Learning methodology:
- Step -1: Learners are given an overview of the course and its connection to life and work.
- Step -2: Learners are exposed to the specific tool(s) used in the course through the various real-life applications of the tool(s).
- Step -3: Learners are acquainted with the careers and the hierarchy of roles they can perform at workplaces after attaining increasing levels of mastery over the tool(s).
- Step -4: Learners are acquainted with the architecture of the tool or tool map so as to appreciate various parts of the tool, their functions, utility and inter-relations.
- Step -5: Learners are exposed to simple application development methodology by using the tool at the beginner’s level.
- Step -6: Learners perform the differential skills related to the use of the tool to improve the given ready-made industry-standard outputs.
- Step -7: Learners are engaged in appreciation of real-life case studies developed by the experts.
- Step -8: Learners are encouraged to proceed from appreciation to imitation of the experts.
- Step -9: After the imitation experience, they are required to improve the expert’s outputs so that they proceed from mere imitation to emulation.
- Step-10: Emulation is taken a level further from working with differential skills towards the visualization and creation of a complete output according to the requirements provided. (Long Assignments)
- Step-11: Understanding the requirements, communicating one’s own thoughts and presenting are important skills required in facing an interview for securing a work order/job. For instilling these skills, learners are presented with various subject-specific technical as well as HR-oriented questions and encouraged to answer them.
- Step-12: Finally, they develop the integral skills involving optimal methods and best practices to produce useful outputs right from scratch, publish them in their ePortfolio and thereby proceed from emulation to self-expression, from self-expression to self-confidence and from self-confidence to self-reliance and self-esteem!
Syllabus
- Introduction
- Operation on BST - search and insert
- Deletion from a BST
- Programming: Binary Search Tree
- Generating BST from preorder
- Applications of Binary Tree
- Generating BST from post order
- Binary Search Tree: Problems and Solution
- Introduction
- Operation on AVL tree
- Programming various operations on AVL
- AVL Tree: Problems and Solution
- Balancing AVL tree
- Programming Balancing of AVL
- 2-3 Trees Introduction
- 2-3-4 trees Introduction
- Searching in a 2-3 Tree
- Insertion in a 2-3 Tree
- Deletion from a 2-3 Tree
- Introduction to red black tree
- Operations on red black tree
- Operation on red black tree to a 2-3-4 tree
- Priority Queue
- Introduction to Heap
- Insertion in a heap
- Heap: Problems, Solution and Implementation
- Heap as a priority queue and Implementation
- Heap as a priority queue and Implementation
- Replacement of a node in heap
- Introduction to Disjoint subsets
- Fast find implementation
- Fast Union Implementation
- Definition and terminologies
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Spanning Tree
- Disjoint subsets
- Minimum Spanning Tree
- Prim's method
- Kruskal's method
- Programming: Minimal spanning tree
- Introduction
- Linear Search
- Binary Search
- Interpolation Search
- Introduction to sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Shell Sort
- Comparison of Sorting Methods
- Merge Sort
- Quick Sort
Evaluation Pattern
Evaluation Pattern of KLiC Courses consists of 4 Sections as per below table:
Section No. | Section Name | Total Marks | Minimum Passing Marks |
---|---|---|---|
1 | Learning Progression | 25 | 10 |
2 | Internal Assessment | 25 | 10 |
3 | Final Online Examination | 50 | 20 |
Total | 100 | 40 | |
4 | SUPWs (Socially Useful and Productive Work in form of Assignments) | 5 Assignments | 2 Assignments to be Completed & Uploaded |
YCMOU Mark Sheet
Printed Mark Sheet will be issued by YCMOU on successful completion of Section 1, Section 2 and Section 3 and will be delivered to the learner by MKCL.
YCMOU Mark Sheet will be available only for Maharashtra jurisdiction learners
MKCL's KLiC Certificate
The certificate will be provided to the learner who will satisfy the below criteria:
- Learners who have successfully completed above mentioned 3 Sections i.e. Section 1, Section 2 and Section 3
- Additionally, learner should have completed Section 4 (i.e. Section 4 will comprise of SUPWs i.e. Socially Useful and Productive Work in form of Assignments)
- Learner has to complete and upload minimum 2 out of 5 Assignments
Courses Fee Structure from 01 July, 2025 Onwards
KLiC 30 hour course fee applicable from 01 July, 2025 all over Maharashtra
KLiC Course Duration | MFO (Inclusive of GST) |
ALC Share (Service Charges to be collected by ALC) |
---|---|---|
30 hours | Rs. 300/- | Rs. 1,500/- |
* Above mentioned fee is applicable for all Modes of KLiC Courses offered at Authorised Learning Center (ALC) and at Satellite Center
* Total fee is including of Course fees, Examination fees and Certification fees
* MKCL reserves the right to modify the Fee anytime without any prior notice