CS25C05 Data Structures using C++ – Semester II – ECE / VLSI / ElecComp – R-2025

Subject Code & Name: CS25C05 – Data Structures using C++

Regulation: R-2025

Semester: II (Second Semester)

Branch: ECE / VLSI / ElecComp

Credits / L-T-P: 4 Credits | L-T-P: 3-0-2

Course Objectives

• This course aims to provide an understanding of object-oriented programming principles using C++.

Full Unit-wise Syllabus

Unit I – Data Abstraction & Overloading

Overview of C++, Structures, Class Scope and Accessing Class Members, Reference Variables, Initialization, Constructors, Destructors, Member Functions and Classes, Friend Function, Dynamic Memory Allocation, Static Class Members, Container Classes and Integrators, Proxy Classes, Overloading: Function overloading and Operator Overloading.

Practical:

1. Program to Implement Constructors and Destructors.
2. Program to implement Member Functions, Classes and Friend Functions.
3. Program to Implement Dynamic Memory Allocation and Overloading.

Unit II – Inheritance & Polymorphism

Base Classes and Derived Classes, Protected Members, Casting Class pointers and Member Functions, Overriding, Public, Protected and Private Inheritance–Constructors and Destructors in derived Classes, Implicit Derived, Class Object to Base, Class Object Conversion, Composition Vs. Inheritance, Virtual functions, This Pointer, Abstract Base Classes and Concrete Classes, Virtual Destructors, Dynamic Binding.

Practical:

1. Program to Implement various inheritances.
2. Program to Implement virtual functions and dynamic binding.
3. Implementation of method overriding and operator overloading.

Unit III – Linear Data Structures

Asymptotic Notations: Big-Oh, Omega and Theta, Best, Worst and Average case Analysis: Definition and an example – Arrays and its representations, Stacks and Queues, Linked lists, Linked list based implementation of Stacks and Queues, Evaluation of Expressions, Linked list based polynomial addition.

Practical:

1. Program to Implement Various Operations on Arrays and Linked Lists.
2. Program to Implement Various Operations on Stacks and Queues using Array and Linked List.
3. Program to Evaluate the Infix Expressions by converting into Prefix and Postfix Expressions.

Unit IV – Non-Linear Data Structures

Trees, Binary Trees, Binary tree representation and traversals, Threaded binary trees, Binary tree representation of trees, Application of trees: Set representation and Union, Find operations, Graph and its representations, Graph Traversals, Connected components. Standard template library.

Practical:

1. Program to Implement Binary Tree Traversal and Graph Traversal Algorithm.
2. Program to Implement the Single Source Shortest Path Algorithm and All Pair Shortest Path Algorithm.
3. Program to find the Minimal Spanning Tree for a Graph.

Unit V – Searching, Sorting and Complexity Analysis

Insertion sort, Merge sort, Quicksort, Heapsort, Linear Search, Binary Search.

Practical:

1. Program to Implement Linear Search and Binary Search Algorithms.
2. Program to Implement Insertion Sort, Merge Sort, Quick Sort and Heap Sort Algorithms.

Course Outcomes (COs)

• CO1: Explain the concepts and applications of Data Structure in various engineering applications.
• CO2: Apply various Data Structure in real time.
• CO3: Develop suitable and interrupt the data in real world applications.

Assessment Pattern (Quick Note)

• Weightage: Continuous Assessment 50% | End Semester Examinations 50%
• Internal methodology: Quiz (5%), Assignments (20%), Flipped Class (5%), Practical (30%), Internal Examinations (40%)

Source: Official Anna University – B.E. Electronics and Communication Engineering R-2025 Syllabus
Last Updated: September 2026